blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 3 264 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 5 140 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 986
values | visit_date timestamp[us] | revision_date timestamp[us] | committer_date timestamp[us] | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 23
values | gha_event_created_at timestamp[us] | gha_created_at timestamp[us] | gha_language stringclasses 145
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 3 10.4M | extension stringclasses 122
values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8aa4b42a0f95e473b03ad222c03449c1897a7893 | 1f2737e41a6d72dff53a5e7949d1da9a1011cb99 | /angelscript_2.28.0/angelscript/source/as_scriptobject.h | afe72cc8b8754b72170000a97b4c4a11ea714eea | [] | no_license | leadcoder/gass-dependencies | bd58c3c7502562b41a8ebb868e841491bba7925e | 7c0895f54a22313071a8b556a664f2e0f995b4de | refs/heads/master | 2021-01-23T18:48:29.500615 | 2019-04-23T20:59:48 | 2019-04-23T20:59:48 | 40,589,311 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,287 | h | /*
AngelCode Scripting Library
Copyright (c) 2003-2013 Andreas Jonsson
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any
damages arising from the use of this software.
Permission is granted to anyone to use this ... | [
"leadcoder@03e3fbca-29a6-eb1c-c96b-1d8cf88ad296"
] | leadcoder@03e3fbca-29a6-eb1c-c96b-1d8cf88ad296 |
abfe60b9d62c7fa4d5233174dd9aa0ce3f62eb35 | 49536aafb22a77a6caf249c7fadef46d63d24dfe | /tensorflow/tensorflow/core/grappler/optimizers/constant_folding.h | 91a3f277b87741c0db888f64937a43d2027ec653 | [
"Apache-2.0"
] | permissive | wangzhi01/deeplearning-1 | 4e5ad93f0d9ecd302b74352f80fe1fa6ae70bf0d | 46ab82253d956953b8aa98e97ceb6cd290e82288 | refs/heads/master | 2020-05-28T03:14:55.687567 | 2018-09-12T16:52:09 | 2018-09-12T16:52:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,419 | h | /* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable ... | [
"hanshuobest@163.com"
] | hanshuobest@163.com |
c98421d3300af40fc197dfb9ba0efd5619450650 | 9f34e12675a3d3f4bdadda2ea6e4bd7e43cbad0c | /leet_lint_code/lint_code/fibonacci.cpp | 9147a7c6a18b50607b3aeeb5e4c1e2626ce8abe4 | [] | no_license | hailingu/leet_lint_code | 125bc403123c0f2ebef76f9a5667886c6a4bdd44 | ff45eaa40ade4184f14c59a46db10d648c421de4 | refs/heads/master | 2021-06-02T01:44:19.621561 | 2020-04-24T02:14:49 | 2020-04-24T02:14:49 | 129,344,064 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 566 | cpp | // Copyright © 2018 Hailin Gu. All rights reserved.
// License(GPL)
// Author: Hailin Gu
// This is a answer of lint code problem 366.
#ifndef LEETLINTCODE_LINTCODE_FIBONACCI_CPP
#define LEETLINTCODE_LINTCODE_FIBONACCI_CPP
#include <vector>
class Fibonacci {
public:
int fibonacci(int n) {
if (1 == n) return... | [
"hailin.gu@hypers.com"
] | hailin.gu@hypers.com |
7d2130e161265aab9ef04461a96e45b6ef462cba | cefb732ca99b8bb2484c1a23443da5f4a07600fc | /funciones.hpp | 98afa2805b438e0c8a992a040961f2edb24c12b5 | [] | no_license | klavman/Error-polygonal-approximation-Cplusplus | a3d78834f74863675633f59d9f29d38948bb6298 | 82ff19f465c5a049ffe793b42b4f513d44872432 | refs/heads/master | 2021-05-29T13:44:07.334669 | 2015-03-03T11:46:10 | 2015-03-03T11:46:10 | 31,595,461 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 545 | hpp | /*!
\file funciones.hpp
\brief Calcular el error cometido por la aproximación poligonal de un contorno
\author Francisco Javier Clavero Alvarez
\date 16-02-2015
*/
#include <vector>
#include "punto2D.hpp"
using namespace ed;
void cargaContorno(std::vector<Punto2D> &contorno, std::string ficheroContorno);
... | [
"jc.klavman76@gmail.com"
] | jc.klavman76@gmail.com |
a2f3eb17eb8845ae0fe8047212ab49301d49a4c7 | 187f38b099a09bed572d8ff96785a27d30d11bdb | /applications/mne_scan/plugins/rtfwd/rtfwd.cpp | 146645a6a13e08aeb3042e951056e1d9322f4459 | [
"BSD-3-Clause"
] | permissive | svdecomposer/mne-cpp | 20f172438eafae1b13fa6626b90318af8ee51383 | dad9a6da135a46cd4985d99881e6f6a569b66e5a | refs/heads/master | 2021-07-11T00:59:19.541378 | 2020-08-14T14:34:25 | 2020-08-14T18:21:28 | 186,504,467 | 3 | 1 | NOASSERTION | 2020-01-14T14:26:43 | 2019-05-13T22:29:44 | C++ | UTF-8 | C++ | false | false | 19,630 | cpp | //=============================================================================================================
/**
* @file rtfwd.cpp
* @author Ruben Dörfel <ruben.doerfel@tu-ilmenau.de>
* @since 0.1.1
* @date May, 2020
*
* @section LICENSE
*
* Copyright (C) 2020, Ruben Dörfel. All rights reserved... | [
"lorenzesch@hotmail.com"
] | lorenzesch@hotmail.com |
85c2fdf420718d0d679d51bba0b37d148a9e9d8c | a04a81dab51b4c69b6aec9c3e2a80275a5de8798 | /BOJ/5719_gps.cpp | 60530070c5e887ae0e5561c7d27655a6bb73c9e2 | [] | no_license | joseoyeon/Algorithm | afdfd8fb8c30a6d4b8571a713e92ead4e04c652d | 78d5d238529bee931230449631730f3771608eb6 | refs/heads/master | 2023-01-21T11:54:03.331075 | 2023-01-06T05:25:32 | 2023-01-06T05:25:32 | 176,685,215 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,614 | cpp | #include<bits/stdc++.h>
#define INF 987654321
using namespace std;
struct Data {
int node, weight;
Data(int node, int weight) : node(node), weight(weight){};
bool operator <(const Data d) const {
return weight > d.weight;
}
};
int main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0... | [
"joseoyoen60@gmail.com"
] | joseoyoen60@gmail.com |
c625ff75462e1eca84c2c57c1ef677a9f60da66f | 8b5652e5e3823739a18d9a7966fedddf17bc183d | /External/cocos2dx-store/Soomla/rewards/CCVirtualItemReward.h | b418af209e9017abc3403f2109b4f442bf0bde78 | [
"MIT"
] | permissive | tovchenko/espreso | 4d6ed4a13f7dd4a82b3d4176e5f586e20baa54aa | 71c2a2f0e5bbd046b8b8cb63084b84bccabb7aa7 | refs/heads/master | 2016-09-06T10:44:20.370679 | 2015-02-25T14:39:20 | 2015-02-25T14:39:20 | 18,293,105 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,467 | h | //
// Created by Fedor on 04/06/14.
//
#ifndef __CCVirtualItemReward_H_
#define __CCVirtualItemReward_H_
#include "../../../soomla-cocos2dx-core/Soomla/rewards/CCReward.h"
#include "../../../soomla-cocos2dx-core/Soomla/CCCommonConsts.h"
#include "../CCStoreConsts.h"
namespace soomla {
class CCVirtualItemReward :... | [
"doctorset@gmail.com"
] | doctorset@gmail.com |
a3415b510d15bc284e8e47ec40d4eaf0385e3f52 | 0657de9b1587ac081855ecf564c832045cb707be | /1300 - 1399 ladder/Difficulty Level - 4/Ciel and Flowers.cpp | 4d524d54e6abc14d32a83a3bfd97623e9515585b | [] | no_license | anuragdvd/a2oj-ladders | cb49f431ad03a3272b35691e4b6cb1c5133648b8 | 2fe258013ed33325c8365b81662ece7a6a7a602f | refs/heads/master | 2023-01-22T05:12:51.941348 | 2020-12-04T00:46:29 | 2020-12-04T00:46:29 | 287,341,586 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 948 | cpp | // Ciel and Flowers :: https://codeforces.com/problemset/problem/322/B
#include<bits/stdc++.h>
#define fr(i,c,b) for(int i=c;i<b;i++)
#define frl(i,c,b) for(ll i=c;i<b;i++)
#define si(x) int x; scanf("%d", &x)
#define sll(x) ll x; scanf("%lld", &x)
#define pi(x) printf("%d", x)
#define pll(x) printf("%lld", x)
#define... | [
"alltrickbyte@gmail.com"
] | alltrickbyte@gmail.com |
f81deb172854e584d189ffb6bdbed62c34890e25 | d07a162fae98a9092f5eaa9588898436bb6c29f9 | /cosesdelpen/Geometry/Plane.cpp | ab22420a778cc3fd4d51cd1727b40a02a6829b1e | [] | no_license | Setsilvestre/codipen | 8b6ae74d2610777f22f9760b0fca9e45beb628b1 | 3e2659e9f25ab67fd460c3163a0ca206c7e000ec | refs/heads/master | 2016-08-04T17:02:52.299401 | 2015-02-23T09:30:01 | 2015-02-23T09:30:01 | 31,201,147 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,609 | cpp | #include "Plane.h"
//Constructor
Plane::Plane()
{
}
//Destructor
Plane::~Plane()
{
}
//Setters
void Plane::setPlanePoint(const float& x, const float& y, const float& z){
this->point.coord.x = x;
this->point.coord.y = y;
this->point.coord.z = z;
}
void Plane::setPlaneNormal(const float& x, const float& y, const floa... | [
"xavier_figuerola@hotmail.com"
] | xavier_figuerola@hotmail.com |
7f0e00213a43bf75e10b8f5cf3f0c9ee8b353dcb | 29b2e290739a85506a1067424c94e357e287da3b | /optimizer/BigTreeException.h | 2b085aed5a7ba188da9cc7eefc5596c896e253a3 | [] | no_license | CalderWhite/hash-bash | 23969560638e614975fbe61747057fbd4f1f0e77 | 15b693d3f555e640df48bb99593dab266f119097 | refs/heads/master | 2020-06-28T04:36:47.678936 | 2020-01-24T00:57:44 | 2020-01-24T00:57:44 | 200,144,483 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 246 | h | #pragma once
#include <iostream>
#include <exception>
/**
* Custom exceptions to improve error catching/info.
*/
class BigTreeException: public std::runtime_error {
public:
BigTreeException(const char* msg) : std::runtime_error(msg){}
};
| [
"calderwhite1@gmail.com"
] | calderwhite1@gmail.com |
953559733610011e8e3c321319846ee810d2a104 | 9168d79f8668e4e704d361a03396bc01b7a6fc54 | /OpenCV/Function.cpp | 4e50e177b18e9df5d78c9aef3a46a9790f1a66fe | [] | no_license | Satvik-Verma/Virtual-Paint-Project-1 | 42e872c7f8335b240f20ac178d0f136087f885d6 | 4ac8baf19bf1d7dac87e61d14374e7847b34bb23 | refs/heads/master | 2023-06-18T22:06:35.908501 | 2021-07-06T20:24:23 | 2021-07-06T20:24:23 | 383,536,037 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 707 | cpp | #include<iostream>
#include<opencv2/highgui.hpp>
#include<opencv2/imgcodecs.hpp>
#include<opencv2/imgproc.hpp>
using namespace cv;
using namespace std;
void main() {
string path = "Resources/shapes.png";
Mat img = imread(path);
Mat imgGray, imgBlur, imgCanny, imgDil, imgErod;
Mat kernel = getStructuringElement(M... | [
"satvikrohella@gmail.com"
] | satvikrohella@gmail.com |
7de3450b35d4d3b2f59fedcbeb03acb8a1f2c130 | 63f31d35c65d44e0f40190d0d6e1170e540cd226 | /BaiTapTuan14/BTtuan14.cpp | 65999edc1ce03a0f867de10a4c8e85473432e5f2 | [] | no_license | Tannb9119/KyThuatLapTrinhC-Cplusplus | a3fdd978022b9981ba85a85dfb7e98e2e94e1923 | 2edd8fb2a7f9451743957095cca1659df6d295f3 | refs/heads/main | 2023-02-13T02:46:41.436573 | 2021-01-14T14:09:52 | 2021-01-14T14:09:52 | 314,602,733 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,239 | cpp | #include <iostream>
#include <string>
using namespace std;
template <class T>
class Node
{
public:
T value;
Node *next;
Node(T v) : value(v), next(0){};
};
template <class T>
class List
{
Node<T> *head, *tail;
int count;
public:
List() : count(0) { head = 0, tail = 0; }
~List()
{
... | [
"="
] | = |
f1285e6c1b8361df6f6adcb5be8acf3785991172 | 15b0d541817cd26cb2c5706d8211131142119f59 | /cuboid.h | 485de00b0eabeeddf6c381a8316a453a7fe846dc | [] | no_license | isaiasfrederick/CudaFragCubing | 07a5a7c642e48e11c31bb44469b646e377b15e4e | 1b12609f61e481442cb45a3a0f7b372b8644c0db | refs/heads/master | 2021-01-10T10:23:47.601434 | 2016-04-10T00:23:06 | 2016-04-10T00:59:07 | 55,873,762 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,143 | h | #ifndef CUBOID_H
#define CUBOID_H
#include <vector>
#include <map>
#include <iostream>
#include <list>
#include <map>
#include <fstream>
#include <string>
#include <sstream>
#include <algorithm>
#include "constantes.h"
using namespace std;
typedef struct
{
vector<int> dimensions;
} CubDim;
typedef struct
{
vecto... | [
"isaiasfrederick@gmail.com"
] | isaiasfrederick@gmail.com |
cb3fc2db580103a09d0a6e91da85c04b0181b64f | 7e797415eddea48580c78f10a571b1e2cb596d65 | /source/thirdparty/GL/GL/VertexBuffer.hpp | 0fba4a91358d846ac9764734fbfc407460f4e95a | [] | no_license | razzie/PotatoGame | dcf8a393221faf3d0cdd41a6f5f88b141fcb5536 | 495d243693d82df43a053dbf75b38163f598a9b7 | refs/heads/master | 2022-08-19T16:42:23.278074 | 2018-08-09T20:00:46 | 2018-08-09T20:02:22 | 144,187,201 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,434 | hpp | /*
Copyright (C) 2012 Alexander Overvoorde
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, modify, merge, publish, d... | [
"gabor@gorzsony.com"
] | gabor@gorzsony.com |
16c081a77af26565f3ef7cd92ae51a7c9a182159 | 2be90d61ff00b1b9f9e0ab807d1b6e6e7877c783 | /main.cpp | 34deff1848fab78318f073459aaa2b62eee7526d | [
"BSD-3-Clause"
] | permissive | pietrotedeschi/secureais | 791f97fa3f5504bcd309dc03c9c92b917922538e | a2531191849e1eabb15aa223912d73b2bb80f287 | refs/heads/master | 2020-12-28T14:48:55.429255 | 2020-01-19T11:31:02 | 2020-01-19T11:31:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 26,867 | cpp | /*
main.cpp
@authors Ahmed Aziz, Pietro Tedeschi, Savio Sciancalepore, Roberto Di Pietro
@Description: A program for implementing the SecureAIS Protocol PoC
@version 1.0 17/01/19
Compile command, add flag -DPORT_SEND or -DPORT_RECEIVE to set another port,
-DGEN_KEYS= true or false to set whether to gene... | [
"crilabhbku@gmail.com"
] | crilabhbku@gmail.com |
27432c6fc66843527454e4ad982b9385c1dcec37 | 303eede865fa5d517dab4674167211a7dc47faf5 | /engine.cpp | 688fd52b6227352d5b22fef82f1662c417f4355a | [
"CC-BY-4.0"
] | permissive | andras-szabo/brick-by-brick | 3ceb0712db2474a19955025fd8f2c4ce60b084f8 | 271fcf9296ea6787465f4ed870f5c021f194c57e | refs/heads/master | 2021-01-01T15:31:17.661237 | 2014-06-26T09:56:01 | 2014-06-26T09:56:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,389 | cpp | #include "engine.h"
#include "introState.h"
#include "menuState.h"
#include "gameState.h"
#include "pauseState.h"
#include "controlState.h"
#include "messageState.h"
#include "ResourcePath.hpp"
#include <fstream>
cEngine::cEngine()
{
mWindow.create(sf::VideoMode(gkWindowSize.x, gkWindowSize.y), " Brick by brick " ... | [
"andras.szabo.fin@gmail.com"
] | andras.szabo.fin@gmail.com |
b39b9827bc29280e3c0d0715a372181b32657d2c | a994c13785b94adf85e725fccf620eb6396238f4 | /practice/20181003/2103.cc | a48907494b0cadad628f7d3db1910c7c9a434dd4 | [] | no_license | vijaybnotion/DSnP_textbook | 4f0f8b9cab4916cd90fdcf7adcde0e74a18a5790 | 4872bf446cd336fa31ac323a34d9fa2d60311dd2 | refs/heads/master | 2023-03-27T02:12:04.310413 | 2019-01-13T13:13:45 | 2019-01-13T13:13:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 237 | cc | #include <iostream>
using namespace std;
void f( const int * ptr ){
cout << "inside f()" << endl;
cout << ptr;
}
int main(){
int ptr[] = {3,1,4,1,5};
cout << "inside main: ptr = " << &ptr << endl;
f( ptr );
return 0;
}
| [
"a58524andy@gmail.com"
] | a58524andy@gmail.com |
33f0a9d73dedde95f85b4068ddc8ffb6b001cb1f | 3a578cc42c4b740f15bc594dbaaa31bb9d87c947 | /contrib/devtools/syscoin-tidy/syscoin-tidy.cpp | 7dbd7634f0bf907a40375066d5e47e28193c0ebf | [
"MIT",
"LicenseRef-scancode-public-domain"
] | permissive | syscoin/syscoin | 7dded55aaf33a454bf1be1e80cb89b60f4fe5409 | 310151bd2e4860375de146c0568293559ad8b459 | refs/heads/master | 2023-08-17T06:35:29.025512 | 2023-08-16T11:57:03 | 2023-08-17T01:25:08 | 52,762,278 | 144 | 90 | MIT | 2023-09-08T17:52:13 | 2016-02-29T03:47:32 | C++ | UTF-8 | C++ | false | false | 729 | cpp | // Copyright (c) 2023 Bitcoin Developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "logprintf.h"
#include <clang-tidy/ClangTidyModule.h>
#include <clang-tidy/ClangTidyModuleRegistry.h>
class SyscoinModule final ... | [
"sidhujag@syscoin.org"
] | sidhujag@syscoin.org |
98edec6bf509a33f8a25ab4d4d30aae113c3327e | 02a471403eb0d6d13edac3dbcd985e6fca467b23 | /AutoWeight.cpp | 56577fa1a4c1cbb93f28cdc7a362e0ee564e9125 | [] | no_license | qiuri2008/repoCkd | d2786dcb2357ca227bba350b91465b7f9ddcb1f4 | c34ea043053b5dfc541bf410ccde85c2c2f90785 | refs/heads/master | 2021-05-11T11:48:04.567837 | 2018-01-16T07:14:18 | 2018-01-16T07:14:18 | 117,645,548 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 28,723 | cpp | // AutoWeight.cpp : implementation file
//
#include "stdafx.h"
#include "CKD录入.h"
#include "PageCkd.h"
#include <bitset>
#include "Global.h"
#include <afxtempl.h>
#include "excel2003.h"
#include "user.h"
#include "PropSheet.h"
#include "SaveDlg.h"
#include "AutoWeight.h"
#include ".\autoweight.h"
#define TEST_AUTOWE... | [
"jiangzhaowei2002@126.com"
] | jiangzhaowei2002@126.com |
aa72d34c3b4faa2363a5713430d9414a4c2f9a50 | a62342d6359a88b0aee911e549a4973fa38de9ea | /0.6.0.3/Internal/SDK/CustomPlaySound_AnimNotify_classes.h | 6c2d4f43889a36a6f3e788be34e71d559dc86460 | [] | no_license | zanzo420/Medieval-Dynasty-SDK | d020ad634328ee8ee612ba4bd7e36b36dab740ce | d720e49ae1505e087790b2743506921afb28fc18 | refs/heads/main | 2023-06-20T03:00:17.986041 | 2021-07-15T04:51:34 | 2021-07-15T04:51:34 | 386,165,085 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,325 | h | #pragma once
// Name: Medieval Dynasty, Version: 0.6.0.3
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Classes
//-----------------------------------------------... | [
"zp2kshield@gmail.com"
] | zp2kshield@gmail.com |
6b7960ad74263d8b9bd62c9199bcdeda9d76f5cb | f0b2c4dccd80bdd5f79f695204e92bac46209279 | /warmup-j.cpp | 5c130245d8de80c8e848c0be7fe0938558629698 | [] | no_license | alexanderfs/acm | e22437a369d9c357a0af93c059c4d63ee7f5d221 | 8d7ae810ee08f0ad24e54c3236f8f3fc7b63aa18 | refs/heads/master | 2021-01-01T17:32:58.257647 | 2014-04-30T06:42:33 | 2014-04-30T06:42:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,187 | cpp | /*******************************************************************
* Copyright (C) Alex AN
*
* File Name :
* Author : Alex AN
* Create :
* Mail : alexbupt@gmail.com
* Blog : http://blog.csdn.net/alexbupt
*
* Description :
*
*********... | [
"alexbupt@gmail.com"
] | alexbupt@gmail.com |
05f46100030f15be4809d68873a7bdeeb58712d3 | ba9485e8ea33acee24dc7bd61049ecfe9f8b8930 | /ac/prev/agc007_b.cpp | ca064571630340034f5a259192b9f378d90d89cd | [] | no_license | diohabara/competitive_programming | a0b90a74b0b923a636b9c82c75b690fef11fe8a4 | 1fb493eb44ce03e289d1245bf7d3dc450f513135 | refs/heads/master | 2021-12-11T22:43:40.925262 | 2021-11-06T12:56:49 | 2021-11-06T12:56:49 | 166,757,685 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 786 | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define all(obj) (obj).begin(), (obj).end()
static const int dx[4] = {0, 1, 0, -1};
static const int dy[4] = {1, 0, -1, 0};
static const char dir[4] = {'u', 'r', 'd', 'l'};
static const ll INF = 1 << 21;... | [
"kadoitakemaru0902@g.ecc.u-tokyo.ac.jp"
] | kadoitakemaru0902@g.ecc.u-tokyo.ac.jp |
068ef801e623d3e8ec33918857a85af0b15317cf | 568fa24f8de432ed5b6c9f1d6ad0a9e32c5274b7 | /source/app/collector/registry/gaggle_collector_impl.h | 77703c71d8fb88725f15e790f064208c3d8f87e3 | [] | no_license | ankeesler/btool | 2cb450041e589c78bf93e5a5d9eb238b3e494224 | 9f4a4c919cb4d40d6d91fa8aafd814d74edf7d09 | refs/heads/main | 2022-07-21T18:51:42.962440 | 2022-06-01T21:54:58 | 2022-06-01T21:54:58 | 188,036,175 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 998 | h | #ifndef BTOOL_APP_COLLECTOR_REGISTRY_GAGGLECOLLECTORIMPL_H_
#define BTOOL_APP_COLLECTOR_REGISTRY_GAGGLECOLLECTORIMPL_H_
#include <string>
#include <vector>
#include "app/collector/registry/registry_collectini.h"
#include "app/collector/resolver_factory_delegate.h"
#include "app/collector/store.h"
#include "node/node.... | [
"ankeesler1@gmail.com"
] | ankeesler1@gmail.com |
96b792709fc414ce6a0caa61efbcb08e0db096b6 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/CMake/CMake-gumtree/Kitware_CMake_old_hunk_1261.cpp | 9bda79a22808389d66ed0ae68e9e65797881ab57 | [] | 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 | 166 | cpp | return;
}
fprintf(stderr, "Writing %s...\n", currentFilename.c_str());
this->WriteHeader(str);
this->WriteConnections(ptrIt->first.c_str(),
| [
"993273596@qq.com"
] | 993273596@qq.com |
25805ab7c8ccb759cf7d00dd138ed4c05bc719b6 | 61b4ff34410a8af8291a940c4fb32c4cc20408c4 | /mit-carbon-Graphite-baecdec/common/tile/memory_subsystem/cache/compressed_cache_set.cc | d06adee0de6b8c21187b49f178ef342eab36f683 | [
"MIT"
] | permissive | puyuning/graphite_git | 84d1138907fccfe4427b3d238a629c6c2151f09c | 99576d50d3647baf813757bd9b8ca7338d44b920 | refs/heads/master | 2021-01-10T04:44:15.067633 | 2015-11-13T11:52:57 | 2015-11-13T11:52:57 | 46,118,450 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,157 | cc | #include <cstring>
#include "compressed_cache_set.h"
#include "compressed_cache.h"
#include "log.h"
#include <vector>
CompressedCacheSet::CompressedCacheSet(UInt32 set_num, CachingProtocolType caching_protocol_type, SInt32 cache_level,
CacheReplacementPolicy* replacement_policy, UInt32 associativity,... | [
"puyuning@puyuning-System-Product-Name.(none)"
] | puyuning@puyuning-System-Product-Name.(none) |
960a08a58d8c01125f884184ad7a009457d6e4b5 | 0fdb6565a31358a7021c30bbfd0e95a1a9d39e25 | /src/morganaFields/feQr3d.hpp | 69e541472ce844d827c3f0c3e2b4a0905f002d2d | [] | no_license | feof81/morganaPublic | b8b61a08d222a2ade3484cbdfc80c9790c0e5508 | 540cdbcdcf56e5cd13c0dc98c04f724543025bce | refs/heads/master | 2023-01-28T01:12:51.711178 | 2023-01-11T16:56:37 | 2023-01-11T16:56:37 | 216,569,123 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 19,052 | hpp | /*%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
This file is part of Morgana.
Author: Andrea Villa, andrea.villa81@fastwebnet.it
Morgana is free software: you can redistribute it and/or modify it under the terms of the GNU Gene... | [
"andrea.massimo.villa@gmail.com"
] | andrea.massimo.villa@gmail.com |
5759f73d1d981f5ed3d2a81e1fad2bc8b91f9413 | 211105066f0b0406bb98db261fdaff542c07c574 | /Season 2/day 5/Programs/2WriteData/WriteData/WriteData.ino | 64fe2833e5f79746d38d7f47a55863ba8e9a7aec | [] | no_license | WShme2017/kaderisasiWS | 550db1bf366d79b11951dbb1bb70910e2ab7fe9c | af7ba81d40abf670001d651e55c735be2d0f76a1 | refs/heads/master | 2021-01-19T15:13:06.622994 | 2018-02-21T10:22:19 | 2018-02-21T10:22:19 | 100,951,107 | 7 | 73 | null | 2018-02-21T10:22:20 | 2017-08-21T12:40:29 | Arduino | UTF-8 | C++ | false | false | 1,173 | ino | // include ThingSpeak and ESP8266 WiFi Libraries
#include <ThingSpeak.h>
#include <ESP8266WiFi.h>
// set your Router user name and passward
char ssid[] = "yashf"; // your network SSID (name)
char pass[] = "12211221"; // your network password
// that you have already remembered from ThingSpeak websie
unsi... | [
"noreply@github.com"
] | WShme2017.noreply@github.com |
d242be82b461880aca0c7dbe09b6e7ea63901ce8 | ed53676faf6a1c4dcc30182be0934337abcd1047 | /trantor/tests/AsyncFileLoggerTest.cc | 298f5cc94f4fc9d655eda677e096a310dd30df89 | [] | no_license | flyish/trantor | 7c83fdec1f59ec439b0e71cd1bdb0fcde51b3ada | b4c959616e29e01b3ded28da08fa5e0c90435065 | refs/heads/master | 2021-06-15T05:31:27.048414 | 2017-03-31T14:12:53 | 2017-03-31T14:12:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,206 | cc | #include <trantor/utils/Logger.h>
#include <trantor/utils/AsyncFileLogger.h>
#include <stdlib.h>
#include <thread>
int main()
{
trantor::AsyncFileLogger asyncFileLogger;
asyncFileLogger.setFileName("async_test");
asyncFileLogger.startLogging();
trantor::Logger::setOutputFunction([&](const char *msg,cons... | [
"20741618@qq.com"
] | 20741618@qq.com |
840428f9dc4a9dae8ba417e86e718d6103f71031 | 64f44cf54f71eb01cbec30e199b38c5215c6f69f | /computer/spectrum/computer.cpp | 8e1d3267701a0c4de3196669c809032b4de015f5 | [] | no_license | electrified/cpuqt | a988495c087d6d1b6dfef2bba02aada51c38ce54 | 958908efc431d6c55638e40425be8d537493a7b5 | refs/heads/main | 2023-03-05T06:24:12.880916 | 2021-02-15T20:14:15 | 2021-02-15T20:35:15 | 333,570,656 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 73 | cpp | #include "computer.h"
Computer::Computer() {}
Computer::~Computer() {}
| [
"ebwibble@hotmail.com"
] | ebwibble@hotmail.com |
25fee1fc2abe6efc254d66caf6b399d8d6ac161e | 39e0af37e018858dfa5513d3aedaa26270bedc11 | /Src/1075.cpp | 8d0f8fc6c35252b06f568749e3304c141f04238d | [] | no_license | BeyondSword/JPAT | 1089e65d08ad32352662059f7cb6be18a20a0f8b | 9ceb22ade20485afb70514d47bb19b09666f1370 | refs/heads/master | 2020-06-28T19:37:17.751477 | 2019-09-07T15:21:04 | 2019-09-07T15:21:04 | 200,321,637 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,356 | cpp | #include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
const int MAXN=10001;
struct Stu{
int id;
int p[6];
int sub[6];
int ac;
int tot;
int need_sort;
int rank;
}stu[MAXN+1];
bool comparison(struct Stu &A, struct Stu &B){
if(A.need_sort == B.need_sort){
... | [
"andyjiangandy@outlook.com"
] | andyjiangandy@outlook.com |
73f62caf4451954a9c2789309ab935ff220cb0cd | 7e5be101928eb7ea43bc1a335d3475536f8a5bb2 | /2016 Training/11.19/A.cpp | bd3f6f2e4284dc3d941d36d7351cd75393c64828 | [] | no_license | TaoSama/ICPC-Code-Library | f94d4df0786a8a1c175da02de0a3033f9bd103ec | ec80ec66a94a5ea1d560c54fe08be0ecfcfc025e | refs/heads/master | 2020-04-04T06:19:21.023777 | 2018-11-05T18:22:32 | 2018-11-05T18:22:32 | 54,618,194 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,965 | cpp | //
// Created by TaoSama on 2016-11-19
// Copyright (c) 2016 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:102400000,102400000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#i... | [
"lwt1367@gmail.com"
] | lwt1367@gmail.com |
927362a0fa9e5fb524c704b530e12a5f9a33b340 | 8152a57e4a931b69bf03f847e9436fd06b1d80a4 | /src/mixTX.h | 2a84f1bd81ba10bf805b157b9d188fe8527dbb1b | [
"MIT"
] | permissive | coinrescue/helmin | 42a536862fe90ba79aea37989efdd964c5577492 | b692f30779049acb1d35728f2f511adc3bfa66b8 | refs/heads/master | 2020-11-23T22:00:16.249177 | 2019-12-13T22:54:27 | 2019-12-13T22:54:27 | 227,838,716 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,792 | h | // Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2018 The Helmin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef DARKSEND_H
#define DARKSEND_H... | [
"seniormanagement@computerstudio.eu"
] | seniormanagement@computerstudio.eu |
43d2249bc3fc5e5c53d10347ef988619fbeaf107 | ac13959437a22b0dd7a0e808e44e12971ff6f79f | /CodeC3/NhuQuynh_C3_Bai1.cpp | 07aefd09b726b3daaf52a75146c6b4ac2afe4f28 | [] | no_license | hieu-ln/IT81-09 | a6a8845ed1565ce11a1a1ba98f3f7a9a554dcba0 | f84c8322926a05fe6b2ae5832cfb4a1ba073e0f8 | refs/heads/master | 2020-06-11T06:42:04.968585 | 2019-08-17T17:04:54 | 2019-08-17T17:04:54 | 193,879,288 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 5,023 | cpp | #include <iostream>
#include <ctime>
using namespace std;
//1.1
#define max 1000
int a[max];
int n;
//1.2
//khoi tao ngau nhien
void Init(int a[], int &n)
{
cout << "Nhap sluong ptu: ";
do{
cin >> n;
if (n < 0 || n > max)
cout << "Nhap n tu 1 - " << max << ". nhap lai: ";
} while(n < 0 || n > max);
for (in... | [
"1851050124quynh@ou.edu.vn"
] | 1851050124quynh@ou.edu.vn |
3d585e6d4c3d720bcf54ea3c0f396818dc5a370a | a8c588bae9db3b73c8b6aac4deb6a914cf718a65 | /PAT-A/1094.cpp | accf3c13b5bc99850bce9b41738d203c408dbaaf | [] | no_license | zzhhch/pat | 688f9227fe161135074c7b31e85c5a6b8ff51e1d | fd7592869be5218bb73fa572dc75d474418828c3 | refs/heads/master | 2020-03-24T11:09:31.025066 | 2019-06-03T06:29:14 | 2019-06-03T06:29:14 | 142,677,123 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 635 | cpp | #include<cstdio>
#include<queue>
#include<vector>
using namespace std;
const int maxn=110;
vector<int> tree[maxn];
int n,m,maxNum=0,Depth=0;
int hashTable[maxn]={0};
void DFS(int index,int depth){
hashTable[depth]++;
for(int i=0;i<tree[index].size();i++){
DFS(tree[index][i],depth+1);
}
}
int main()
{
scanf("%d... | [
"zhanghength@163.com"
] | zhanghength@163.com |
f8a17f6c889f8a106e3089bbeb9973b54b9a2a53 | c64c4f679ce0ba061c58bbf25e2eea5a196c53a7 | /sartajekram/450-D/450-D-95263919.cpp | 45d1c1b27a1a8ce4993982f7f3dc1416340027b3 | [] | no_license | sartajekram419/CodeforcesSolutions | b6c564e8b8ce2718d99fe4829a63bd6629b92461 | f9d3594a84e95e0df6456adf2ea535b7399bf232 | refs/heads/master | 2023-03-23T07:44:12.527848 | 2021-03-21T07:19:54 | 2021-03-21T07:19:54 | 248,037,922 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,833 | cpp | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
#define inf 1e18
#define PI acos(-1.0)
#define mod 1000000007
typedef pair<ll, ll> pi;
ll n,m,k;
ll dis[100005],in[100005];
vector<pi>g[100005];
vector<pi>v;
void initialize()
{
f... | [
"sartajekram419@gmail.com"
] | sartajekram419@gmail.com |
b8dab793f83a666322450cc2879e8d0044359a4c | 64ad587f239164671b5e82fa12783e3ff9f5d627 | /PGA/EA_library/random.h | f6a516f53a22cb61b815d2be90aa95e09eeb3a1d | [
"MIT"
] | permissive | LandBuffalo/PGA | 246ed50fd6341ef591a7c2c91f1b3a69599ebb17 | d73dcf625231917c9685b4dedf4f05d9406ded6c | refs/heads/master | 2020-03-28T14:43:11.290877 | 2018-09-12T17:13:32 | 2018-09-12T17:13:32 | 148,512,425 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 625 | h | #ifndef __RANDOM_H__
#define __RANDOM_H__
#pragma once
#include "config.h"
class Random
{
public:
Random();
~Random();
int Permutate(vector<int> & requested_island_ID, int arrary_length, int permutation_length);
vector<int> Permutate(int arrary_length, int permutation_length);
vector<int> ... | [
"roy.chenjin@gmail.com"
] | roy.chenjin@gmail.com |
aca6b390fbcac12f337778b65ca88b67f48d8621 | b08df58bd0f7f5c7d1919845f616234b8a763331 | /Conditional and loops/LeapYear.cpp | aa8984f132bb1dfe6584bfd055213db71a57eb7d | [] | no_license | harshbhandari7/CPP | 55ba1e763f1a7e6d319baba89caeca08888439f3 | c4b07f2c325f0d5d829498d498c175304c7ead71 | refs/heads/master | 2020-09-24T22:34:49.232005 | 2020-02-04T03:01:37 | 2020-02-04T03:01:37 | 225,859,077 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 258 | cpp | #include<stdio.h>
int main(){
int year;
printf("Enter the year ");
scanf("%d",&year);
if(year%4==0&&year%400==0)
{
printf("%d ",year);
printf("is a Leap year");
}
else
{ printf("%d ",year);
printf("is not a Leap year");
}
}
| [
"harshbhandari32@gmail.com"
] | harshbhandari32@gmail.com |
f87826e20a209c53a06a7e6862f3f53aa531958a | c8e62b5a343a9853ee570af208247c31745eea13 | /zadace/dz04-teorija-brojeva/bomboni.dosilovic.cpp | be667ecc2663695abb2e1d4855998c4c3b3b3e43 | [] | no_license | hermanzdosilovic/natpro | 9b9e6ab9273801b1f75c9bfade784980faf1f493 | 10b6c5d8a91492856ce6b22a19de79a3b0906d2b | refs/heads/master | 2021-01-24T10:59:52.150688 | 2015-02-28T17:51:32 | 2015-02-28T17:51:32 | 70,276,664 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 741 | cpp | #include <cstdio>
#include <cmath>
#define MAX(X, Y) ((X) > (Y) ? (X) : (Y))
const int MAXLEN = 200000;
const int MAXN = 2000000;
int N, n[MAXLEN + 3], maxn;
int zastupljenost[MAXN + 3];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &n[i]);
maxn = MAX(maxn, n[i]);
}
for (i... | [
"hermanz.dosilovic@gmail.com"
] | hermanz.dosilovic@gmail.com |
25014ca98787233f095932c6ae51a511df81ac45 | 2835cbdb95f8e223ab8ab972df1f124687205860 | /task02/part1-2/complexnumber.cpp | ce0f4e4c957920d24dfb82df0fc57e76a948f769 | [] | no_license | beerfekt/Fortgeschrittene-Programmiertechniken | 433406981805fd738f7093f0dec2cc03089cc3bd | ead2b7b18213823375e9849586a51f56d2be8567 | refs/heads/master | 2021-04-30T15:25:29.798268 | 2018-02-12T11:37:00 | 2018-02-12T11:37:00 | 121,238,852 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 220 | cpp | #include "complexnumber.h"
//Konstruktoren
//standart eigen -> wird hier nicht angegeben
ComplexNumber::ComplexNumber(){};
//allgemein
ComplexNumber::ComplexNumber(double x, double y): allgemeinx(x), allgemeiny(y){};
| [
"christoph.beer@gmx.de"
] | christoph.beer@gmx.de |
3c3a35c67dc03e54de32be7a7ebdd941f4e8099e | fd451cb1a829c72ea51a93168eba81a475f983a1 | /liuyubo/08-Minimum-Span-Trees/Course Code (C++)/05-Implementation-of-Optimized-Prim-Algorithm/DenseGraph.h | 4b0ee41b08810d713a19ce407ce3a66038c3cde2 | [] | no_license | shapigou123/Programming | e9fd63f509fb2b45ba9792b13092da6aa8abe935 | 64215eb0f333b583690e32cd9fcce02236713603 | refs/heads/master | 2021-06-26T02:33:56.623872 | 2017-09-07T07:12:11 | 2017-09-07T07:12:11 | 94,725,535 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,559 | h | //
// Created by liuyubobobo on 9/26/16.
//
#ifndef INC_05_IMPLEMENTATION_OF_OPTIMIZED_PRIM_ALGORITHM_DENSEGRAPH_H
#define INC_05_IMPLEMENTATION_OF_OPTIMIZED_PRIM_ALGORITHM_DENSEGRAPH_H
#include <iostream>
#include <vector>
#include <cassert>
#include "Edge.h"
using namespace std;
// 稠密图 - 邻接矩阵
template <typename W... | [
"563594467@qq.com"
] | 563594467@qq.com |
f47aecc5552035e92bd068814d4bbe10b833d9e5 | f431304e068b60713b3a449347a9de07a81c7926 | /src/app/bsp.hpp | 059540ec72aa36edd8e8ba57cc8728df4e46f4f1 | [] | no_license | khoinguyentran/hdb-node | 538ae51baa0ec82a32779cccd7521ef398ae4c88 | 073157d197b3aa850789bd75440dd814069b7c35 | refs/heads/master | 2021-01-21T10:13:23.771689 | 2013-09-19T04:51:37 | 2013-09-19T04:51:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 224 | hpp | #ifndef BSP_HPP
#define BSP_HPP
#include <cstddef>
namespace app
{
size_t const BSP_TICKS_PER_SEC = static_cast< size_t >(50);
inline size_t SECONDS(size_t duration)
{
return duration * BSP_TICKS_PER_SEC;
}
}
#endif
| [
"hans@freebies.i.kaisquare.com"
] | hans@freebies.i.kaisquare.com |
8d68cff26c934db88e5a24edf371ac5bb95171a6 | b1a7cce559cda225fe0b57033cd93c826185fafd | /数据结构/ 第二次竞赛/2-树递归创建:遍历/test-2-2/main.cpp | d44cdcdb27d7fb5b98512737e9424dfd3389f9aa | [
"Apache-2.0"
] | permissive | nju-rookie/DS | cf59374576f7e514725f385c63d0ece3322b2b59 | 507f933af618dc2d9644406a42d925dc93517fb4 | refs/heads/master | 2020-09-17T00:47:46.416451 | 2019-11-25T12:00:48 | 2019-11-25T12:00:48 | 223,937,110 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,664 | cpp | //
// main.cpp
// test-2-2
//
// Created by 谢宇 on 2019/10/31.
// Copyright © 2019 谢宇. All rights reserved.
// 给定两个二叉树，检查它们是否呈镜像对称的。即树的结构成轴对称，且对应节点的节点值相同
#include <iostream>
using namespace std;
struct node{
int data;
node* left;
node* right;
};
void InOrder(node *Tree);
void PostOrder(node *Tree);
... | [
"xieyu@xieyudeMBP.lan"
] | xieyu@xieyudeMBP.lan |
aa985e6922293e952d3822e0052f298606a79140 | cb47afd436e34d6f49243ef1b228aa020d9f31b6 | /OpenGLFramework/OpenGLFramework/RHomingRockets.cpp | 87d937cebd44c25ff05f47da119a28b27ef8fb50 | [
"MIT"
] | permissive | PlayeRom/SpaceShooter | b803993380d22c9ddd1388bca4f2e3ad926a7b8c | c284ca6503800ed1e45fc8ceeaf9d98d38917f30 | refs/heads/master | 2022-06-17T22:16:20.473496 | 2020-05-08T22:53:56 | 2020-05-08T22:53:56 | 262,427,517 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,065 | cpp |
#include "StdAfx.h"
#include "GameControl.h"
#include "RGame.h"
#include "RBonus.h"
#include "../Draw/3DObjManager.h"
#include "RHomingRockets.h"
CRHomingRockets::CRHomingRockets()
{
m_pGameCtrl = CGameControl::GetInstance();
// tworzenie tablicy rakiet
SHomingRockets sHomingRockets;
sHomingRockets... | [
"romek21@op.pl"
] | romek21@op.pl |
9c8180e754aeb606796ef1345fd4ca90db6a9224 | 0d37a489416e75ff013ebec2fbc2fdad80a521ac | /lib-properties/include/devicesparamsconst.h | d90c8d8de1266b484454e10c883f6c0ac7dc7b9b | [] | no_license | JohnSHoover/rpidmx512 | fc26f7ee9ead5c1a9cb4dbbac5b4963744d3353d | ed1416b693d28030ba9ae45a25adf0f280bfc70b | refs/heads/master | 2022-04-10T17:31:36.334680 | 2020-04-10T16:48:45 | 2020-04-10T16:48:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,979 | h | /**
* @file devicesparamsconst.h
*
*/
/* Copyright (C) 2019-2020 by Arjan van Vught mailto:info@orangepi-dmx.nl
*
* 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, i... | [
"Arjan.van.Vught@gmail.com"
] | Arjan.van.Vught@gmail.com |
0842487825c671eeb0286937b4eda9976f1b00ba | bec96028ff3184d61bb08b79fcde54ae11052838 | /models/gen_models/opcuacnc_cncaxistypebase.h | 6115d138ddafc45c373e5eb59eff1fe4f2bc38db | [] | no_license | impulze/thesiscode | 2b8d9bc31721746359de67b904533d5704be0689 | e5502db149aeaa436867ea4454c05d7958de0f78 | refs/heads/master | 2020-12-24T14:01:14.851387 | 2016-08-24T04:13:52 | 2016-08-24T04:13:52 | 65,730,896 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,256 | h | /******************************************************************************
** opcuacnc_cncaxistypebase.h
**
** **************************** auto-generated ****************************
** This code was generated by a tool: UaModeler
** Runtime Version: 1.5.0, using C++ OPC UA SDK 1.5.0 template (version 4... | [
"daniel.b.mierswa@student.hs-rm.de"
] | daniel.b.mierswa@student.hs-rm.de |
f0d864dec0604091e2ea47ed56c4079da5e7c982 | faee03fb630344384e670290fd84b5594a009e1c | /C++ Tutorial Hackerrank/6-Functions/Solution.h | a992f518b23fd432f7be38ee9a6f073e52d40138 | [] | no_license | Toxiedo/Hackerrank-Problems | 438c3bbedc745b8b789ac1c087a2dbcc8cfc9f9a | 6c6c9e59a5ef6f514fa67d440494a5316e68676f | refs/heads/master | 2020-03-18T05:06:43.973117 | 2018-07-27T23:39:08 | 2018-07-27T23:39:08 | 134,325,059 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 639 | h | #include <iostream>
#include <cstdio>
using namespace std;
int max_of_four(int a, int b, int c, int d);
/*
Add `int max_of_four(int a, int b, int c, int d)` here.
*/
int main() {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
int ans = max_of_four(a, b, c, d);
printf("%d", ans);
return ... | [
"eng.islam.hamdy1992@gmail.com"
] | eng.islam.hamdy1992@gmail.com |
0535c5c8b1e1d80cf0c59d2c393f118250c4b566 | e0bbb262b4b07df2a2da7a71fd5ee1627d826d8b | /LanChat/LanChat.h | 9b16c5dc1641c99bd8727ba745d7bfce3c962411 | [
"MIT"
] | permissive | songbaoming/LanChat | 1b32553c5f8ffbdf7609dcf8729ebf89735e75e2 | 8a064039bdc2168c47bf53e48efb004d6f19ed92 | refs/heads/master | 2021-01-19T08:11:31.251540 | 2017-11-03T07:28:44 | 2017-11-03T07:28:44 | 32,850,729 | 9 | 3 | null | 2017-11-03T07:26:59 | 2015-03-25T08:05:00 | C++ | GB18030 | C++ | false | false | 489 | h |
// LanChat.h : PROJECT_NAME 应用程序的主头文件
//
#pragma once
#ifndef __AFXWIN_H__
#error "在包含此文件之前包含“stdafx.h”以生成 PCH 文件"
#endif
#include "resource.h" // 主符号
// CLanChatApp:
// 有关此类的实现，请参阅 LanChat.cpp
//
class CLanChatApp : public CWinApp
{
public:
CLanChatApp();
// 重写
public:
virtual BOOL InitInstance();
// 实现
... | [
"songbaoming@yeah.net"
] | songbaoming@yeah.net |
186baab335d193a038172c553f4e2d92067f541a | f336c286e1d0eed50a8f30ac34ac58c3311d6267 | /Apuntes/ListaSimplementeEnlazada/lista.h | 2b8aefef77cf606bd1df828f01a7268115da532e | [] | no_license | JoseMPaz87/AlgortmosProgramacion2 | 49fce0be30238b4649eadc92175cee3fb49a55c8 | 689c8f41dfe9165c9ffbec2e85efe34215e5efa0 | refs/heads/master | 2022-11-10T06:04:38.411005 | 2020-06-23T19:18:09 | 2020-06-23T19:18:09 | 256,578,548 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,515 | h | #ifndef _LISTA_H_
#define _LISTA_H_
#include "nodo.h"
class Lista
{
private :
// Primer elemento de la lista
Nodo * primero ;
// Tamaño de la lista
unsigned tam ;
public :
// Constructor
// PRE : ninguna
// POST : construye una lista vacia
// - primero apunta a nulo
// - tam = 0
Lista ();
// Destructor
/... | [
"jpaz885@gmail.com"
] | jpaz885@gmail.com |
44cb4a5e611cdef1845f6db0e605aabec01cb2e1 | 3a317ef962cece53f2e71d2ed5325f780b0e298e | /sketch_may09b/sketch_may09b.ino | 0c8ede444098cf8908740ebf51eee3bfa90d1ecd | [
"MIT"
] | permissive | GeneralMine/Arduino-Collection | c983d06b4d3521450854615ffc9642ec4f3e154c | 89677a8f156dc68f03edae846a4a84d669ca0d17 | refs/heads/master | 2020-04-14T04:09:58.981928 | 2019-11-24T00:12:58 | 2019-11-24T00:12:58 | 163,627,464 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 200 | ino | int ledpin = 7;
void setup() {
// put your setup code here, to run once:
pinMode(ledpin, OUTPUT);
}
void loop() {
// put your main code here, to run repeatedly:
digitalWrite(ledpin, HIGH);
}
| [
"marvin_raiser@web.de"
] | marvin_raiser@web.de |
defac77ebec196868302f6f268e60174e437717f | 711547b37343a20e123fffccf0a0f37c3ac14618 | /Homework/boilerplate/forwarding.cpp | 1f71ff81c36a6e2ec58d89f6a2790a51d2e02745 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | Tokubara/Router-Lab | e5f3a24e53bc4c1dbb6891324a6b07699b212b13 | 59385239ee27419cbf59d76d628692ed13aab113 | refs/heads/master | 2020-11-30T14:37:18.821944 | 2019-12-27T09:48:38 | 2019-12-27T09:48:38 | 230,416,799 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 39 | cpp | #include "../forwarding/forwarding.cpp" | [
"1270802817@qq.com"
] | 1270802817@qq.com |
55a94d3bd6c8a09af829871e0c1f4a42141b7e9f | 651bfa60017279d39939fa6eed2bb2ba3fc42b3e | /Repos/ProtocoloElGamalRSA/include/LSFR.h | 5d01cfbe71978a320c5fd4cf78bbac0fe019ba0e | [] | no_license | alvarez37/algebra | a711d2af3f6e5a263595374dce2564c1691805a3 | 6c370b21799e2f78fc5f02640b4ac65b178f030a | refs/heads/master | 2020-05-25T06:52:05.564774 | 2019-10-08T02:23:20 | 2019-10-08T02:23:20 | 187,673,184 | 0 | 0 | null | 2019-05-28T21:49:10 | 2019-05-20T16:03:59 | C++ | UTF-8 | C++ | false | false | 256 | h | #ifndef LSFR_H
#define LSFR_H
#include "RC4.h"
class LFSR
{
public:
LFSR(int,vector<int>,vector<int>);
void fill_seed();
private:
vector<int> our_seed;
int n_bits;
vector<int> tap;
};
#endif // LSFR_H
| [
"31245828+alvarez37@users.noreply.github.com"
] | 31245828+alvarez37@users.noreply.github.com |
d133174efde070e29aab65580cef078504507177 | 7df5fae6fc1ebd2c3896361a9eb2feea1f1a73df | /obs/src/cpp/Utilities/TestUtilities.cpp | 25ed7e8ab2acc5f2aa5c180cf3c06ec271820474 | [] | no_license | jentlestea1/obs_xslt | bd7c35a71698a17d4e89c4122fbd8bb450f56ce9 | d22394be1712f956fccf20e31204b8f961a8ee05 | refs/heads/master | 2021-05-11T06:50:25.310161 | 2018-01-18T15:13:28 | 2018-01-18T15:13:28 | 117,998,474 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,328 | cpp | //
// Copyright 2004 P&P Software GmbH - All Rights Reserved
//
// TestUtilities.cpp
//
// Version 1.0
// Date 13.09.02
// Author A. Pasetti (P&P Software)
#include <stdio.h>
#include <time.h>
#include "../GeneralInclude/TestCompilerSwitches.h"
#include "../GeneralInclude/TestConstants.h"
#include "../Ut... | [
"jentlestea@zju.edu.cn"
] | jentlestea@zju.edu.cn |
8fed2bba1cedf88fb5b179647187be642f57c393 | 988742a6fb3b45db6a0c0996c7b968a2268b9e52 | /ch16/exercises/ex5.cpp | 269e6dad866c06c5d73546478c5fdf5f6f8c3a49 | [] | no_license | briansorahan/cplusplus-primer-plus | e15e8510bdce5dc2cb4998a0a567d7fac5066fdb | 5693def87811b30bcc3480ffa3aa6c06bb874c1e | refs/heads/master | 2016-09-05T15:51:11.904042 | 2013-12-16T03:20:09 | 2013-12-16T03:20:09 | 13,820,738 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,428 | cpp | #include <iostream>
#include <vector>
#include <algorithm>
// sorts ar, removes duplicates, then returns the number of
// elements in the result
template <typename T>
int reduce(T ar[], int n);
// would be nice to templatize the show* functions
void showLong(const long l);
void showString(const std::string s);
int ma... | [
"bsorahan@gmail.com"
] | bsorahan@gmail.com |
df693b599ce518c2a48ea717994f5451185176b2 | 0c023df5d28b34b37f3f79ac0aec5a1262b8ac02 | /src/layer/convolutiondepthwisebnrelu.cpp | bd94f82b974517719da63cb1da7587c7fd7718bb | [
"BSD-3-Clause",
"Zlib",
"BSD-2-Clause"
] | permissive | ahcyd008/ncnn | a965424f6f57cc249bc0c412f563452766793110 | 7b67f3c614a7574f8764f2cc28e121a9b7c1a101 | refs/heads/master | 2020-04-01T22:52:50.131945 | 2019-05-03T18:34:54 | 2019-05-03T18:34:54 | 153,731,348 | 0 | 0 | NOASSERTION | 2018-10-19T05:34:01 | 2018-10-19T05:34:01 | null | UTF-8 | C++ | false | false | 8,408 | cpp | // Tencent is pleased to support the open source community by making ncnn available.
//
// Copyright (C) 2017 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in compliance with the License. You may obtain a copy ... | [
"ahcyd000@gmail.com"
] | ahcyd000@gmail.com |
221912188fa1d63d6ccceb7a9f7fc597d5013e37 | 1787588a5ebcaa184f2a067903a653a245d03e9d | /diverta2019/a/main.cpp | 2545a405ee69bdfa97fa88aacd573770fd37881c | [] | no_license | ebisenttt/atcoder | a3576658eac148372561a6838c081952744f4dee | edfb13c4eb240f5650651cd66fd925496f678257 | refs/heads/main | 2023-06-17T22:54:20.138588 | 2021-07-16T07:43:03 | 2021-07-16T07:43:03 | 313,921,901 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 413 | cpp | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define INF 1e9
typedef long long ll;
t... | [
"vamos.nippon.2010@gmail.com"
] | vamos.nippon.2010@gmail.com |
e068ad71a8e9d3699bf2871109efeea795bf421e | ca84d3203dfdd971332621b2e7a6b0e71f308ddf | /src/automaton.hpp | 4a82e66eb0dbe3eade423bb1a168cf788e83eb62 | [] | no_license | uicus/rbg2gdl | 7cb5da47ecf301c96079917ef909095426a2d255 | 11457a39b48ea216e6edc9063bc7ad49a6ae3a73 | refs/heads/master | 2020-12-30T23:22:26.322219 | 2018-01-22T21:43:01 | 2018-01-22T21:43:01 | 68,704,565 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,465 | hpp | #ifndef AUTOMATON
#define AUTOMATON
#include<vector>
#include"state.hpp"
#include"pure_game_move.hpp"
#include"types.hpp"
class automaton{
std::vector<state> local_register;
uint start_state;
uint accept_state;
std::pair<uint,uint> place_side_by_side(automaton&& rhs);
std::pai... | [
"jakubsutowicz@gmail.com"
] | jakubsutowicz@gmail.com |
ef30588b6e4ff08d56518de48d422eff8bc9748c | 03f037d0f6371856ede958f0c9d02771d5402baf | /graphics/VTK-7.0.0/Examples/Array/Cxx/ArrayBasics.cxx | dc0ebd5822b3d0f782abe66a81b7cc0f756b156f | [
"BSD-3-Clause"
] | permissive | hlzz/dotfiles | b22dc2dc5a9086353ed6dfeee884f7f0a9ddb1eb | 0591f71230c919c827ba569099eb3b75897e163e | refs/heads/master | 2021-01-10T10:06:31.018179 | 2016-09-27T08:13:18 | 2016-09-27T08:13:18 | 55,040,954 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,487 | cxx | #include <vtkArrayPrint.h>
#include <vtkDenseArray.h>
#include <vtkSparseArray.h>
int main(int vtkNotUsed(argc), char *vtkNotUsed(argv)[])
{
////////////////////////////////////////////////////////
// Creating N-Way Arrays
// Creating a dense array of 10 integers:
vtkDenseArray<vtkIdType>* array = v... | [
"shentianweipku@gmail.com"
] | shentianweipku@gmail.com |
a269be15ec50d2c7533c0a24a2d18159b63699f7 | a42ce2ebd1b659963f5f2e1cb44b852ed5ad8521 | /src/opengl-window.cc | 3fde99490a5a33c0070cf13a2466d7a6b08e4485 | [] | no_license | dev-tp/cs4550 | dfca46ca5d417bc5e3dfadbf992eda7ad3f50c0e | 15d6d6c31c1d4634edc6d125b1f3c8d1896ebf50 | refs/heads/master | 2021-01-20T09:13:29.754778 | 2017-12-01T07:06:26 | 2017-12-01T07:06:26 | 101,582,335 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 521 | cc | #include "opengl-window.h"
void CreateWindow(std::string title, void (*setup)()) {
glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB);
glutInitWindowSize(SCREEN_WIDTH, SCREEN_HEIGHT);
glutInitWindowPosition(POSITION_X, POSITION_Y);
glutCreateWindow(title.c_str());
setup();
glutMainLoop();
}
void DefaultSetup()... | [
"rcksorto@yahoo.com"
] | rcksorto@yahoo.com |
a9805a8027da7b12d7ca0aa643da3dd5e2fdad2f | bea0cf33c8d3d76ca692d390fad9bed6205af274 | /nowcoder/Fibonacci数列.cpp | d4a5b8393ba27a8063464e98c0dd68ac341946c1 | [] | no_license | rohdea0826/XATU_ACM | dd3b29ec141d2f0fd6aa1a17d9a1f28229f06d3b | adab6f727a4bcbabc155bcc241866beb4681e317 | refs/heads/master | 2021-07-08T10:27:03.931100 | 2019-02-19T09:07:36 | 2019-02-19T09:07:36 | 74,180,655 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,031 | cpp | //题目描述
//Fibonacci数列是这样定义的：
//F[0] = 0
//F[1] = 1
//for each i ≥ 2: F[i] = F[i - 1] + F[i - 2]
//因此，Fibonacci数列就形如：0, 1, 1, 2, 3, 5, 8, 13, ...，在Fibonacci数列中的数我们称为Fibonacci数。给你一个N，你想让其变为一个Fibonacci数，每一步你可以把当前数字X变为X - 1或者X + 1，现在给你一个数N求最少需要多少步可以变为Fibonacci数。
//输入描述 :
//输入为一个正整数N(1 ≤ N ≤ 1, 000, 000)
//输出描述 :
// 输出一个最小的步... | [
"sqg0826@foxmail.com"
] | sqg0826@foxmail.com |
609bc12b311797fd836ef236d0393cec8c78f621 | c792992a5bc2e25fa377c92257eee09d3bbeb65c | /Common/Flag_t.hpp | 44b1de33c186fbe17a7e253b6e911f31b9322fb8 | [] | no_license | mikemcqueen/CocoaVideoPoker | 5f4005cd97416f13001338ea1670bbd4d2187adf | 955845c4f7b24483c7cfac283af0fafb8970e7e0 | refs/heads/master | 2020-05-27T21:15:48.241597 | 2017-03-02T07:40:30 | 2017-03-02T07:40:30 | 83,646,841 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,222 | hpp | ////////////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2008 Mike McQueen. All rights reserved.
//
////////////////////////////////////////////////////////////////////////////////
#pragma once
template<class TFlag>
class FlagBase_t
{
private:
TFlag m_Fla... | [
"mike.mcqueen@yahoo.com"
] | mike.mcqueen@yahoo.com |
89aebd4fbee9d82d4dd24f95fcc2418d5377366c | b4660cc8fa3ce045508105fa52228a98fa19a87d | /src/win32/base/browser_info.cc | 27d5561acd7e7f729483993e98ca92cdc67579b3 | [
"BSD-3-Clause",
"LicenseRef-scancode-unicode",
"LicenseRef-scancode-public-domain"
] | permissive | hnakamur/mozc-deb | 81e9b561863e57da73aa9ba90d24ff5d0bca480b | a0d6db21786ae7fc54806714cbeca6c7c74cbd36 | refs/heads/master | 2021-04-15T09:32:03.635220 | 2018-05-04T10:09:23 | 2018-05-04T10:09:23 | 126,575,465 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 6,084 | cc | // Copyright 2010-2016, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of condit... | [
"hnakamur@gmail.com"
] | hnakamur@gmail.com |
8f15c803f1f2c6d5c57318b0bb3a06d85627ea40 | 1b966edc8337f9c69b4dc986034ea923dd891179 | /qt/other/canvas/button_canvas_car/mybutton.cpp | 0304705f4af76bee24adb4be56a1fb6c2a448897 | [] | no_license | hackerlank/renyang-learn | 7394f7d387001255e36337b9c30caecbfcc576a6 | aaf2e1c4ed302558d0e043e4be845c532f00c06b | refs/heads/master | 2020-06-09T09:39:33.744807 | 2009-09-20T16:07:57 | 2009-09-20T16:07:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 227 | cpp |
#include "mybutton.h"
MyPushButton::MyPushButton(QWidget *parent,const char *name, const char *text):QPushButton(parent,text){
setPixmap(QPixmap("cater2.png"));
setToggleType(Toggle); // 設定按壓後,不會彈起來
}
| [
"superporter2001@e6a1191f-3756-0410-b840-13f34102b90a"
] | superporter2001@e6a1191f-3756-0410-b840-13f34102b90a |
8618bead781a112c1986c05880b144c3427b098c | 60193311299ad70a697da3a65699fcd8b63bf264 | /Orge-Study/ogre_src_v1-8-0/OgreMain/src/OgreOverlayContainer.cpp | cd3ecf68674406451cc2e3fc969506d8dff0a277 | [] | no_license | DGHeroin/Mirror-GLSL-Study | cd6fac3967173f9bf77d8d32776508fa81a98d86 | 9df468c5d8cc77bd89f4185230fd0b34c3721cad | refs/heads/master | 2021-09-23T23:30:59.336825 | 2017-07-03T16:14:42 | 2017-07-03T16:14:42 | 96,129,238 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,784 | cpp | /*
-----------------------------------------------------------------------------
This source file is part of OGRE
(Object-oriented Graphics Rendering Engine)
For the latest info, see http://www.ogre3d.org/
Copyright (c) 2000-2012 Torus Knot Software Ltd
Permission is hereby granted, free of charge, to any per... | [
"ade.li.indie@gmail.com"
] | ade.li.indie@gmail.com |
b184f5fa2b22f0cf3796d7f56ac3a955022fed29 | 46d4712c82816290417d611a75b604d51b046ecc | /Samples/Win7Samples/begin/sdkdiff/list.cpp | 4b2c7a2a0fe449618d977749230af9552b4ff700 | [
"LicenseRef-scancode-warranty-disclaimer",
"MIT"
] | permissive | ennoherr/Windows-classic-samples | 00edd65e4808c21ca73def0a9bb2af9fa78b4f77 | a26f029a1385c7bea1c500b7f182d41fb6bcf571 | refs/heads/master | 2022-12-09T20:11:56.456977 | 2022-12-04T16:46:55 | 2022-12-04T16:46:55 | 156,835,248 | 1 | 0 | NOASSERTION | 2022-12-04T16:46:55 | 2018-11-09T08:50:41 | null | WINDOWS-1252 | C++ | false | false | 36,063 | cpp | // THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
// PARTICULAR PURPOSE.
//
// Copyright (c) Microsoft Corporation. All rights reserved.
/* Storage allocation sche... | [
"chrisg@microsoft.com"
] | chrisg@microsoft.com |
5dd7cc3a9b8b3cc7de1f435578e8a6f637eb7c38 | 20a4df8d7a9ccbdc8c2695d2837d179dad94e3ee | /demo/interactive_compounds.cpp | 8709e85033bc76303fb481cfd190c53a06980f70 | [] | no_license | poftwaresatent/kinematic_objectives | 6cfcc3f5894cf42436bd30a11e37e29ac28a55d1 | 64928016fdcc7db0475fcdb2b1c02e71d92695c2 | refs/heads/master | 2016-09-05T19:06:45.841098 | 2013-04-14T18:04:33 | 2013-04-14T18:04:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 19,537 | cpp | /*********************************************************************
* Software License Agreement (BSD License)
*
* Copyright (c) 2013, Willow Garage, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following... | [
"poftwaresatent@gmail.com"
] | poftwaresatent@gmail.com |
3c40b38ca651974ba98573879f4a2e0a87a08fb0 | 85e5e67b0ddb32701b6aad5c3d2a428c768bb41c | /Engine/PackTest.cpp | e92f8c58e7ee7d43e7ffa9c7e5008a51407b97cd | [] | no_license | lim-james/Allure | a6ebca6b2ca1c70bc2108f8ae710c2a88117657d | 6d837a49254d181babf546d829fc871e468d66db | refs/heads/master | 2021-07-18T04:31:08.130059 | 2020-08-21T03:30:54 | 2020-08-21T03:30:54 | 205,639,206 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,298 | cpp | #include "PackTest.h"
#include "Camera.h"
#include "Light2D.h"
#include "TilemapRender.h"
#include "SpriteRender.h"
#include "SpriteAnimationSystem.h"
#include "AnimationSystem.h"
// scripts
#include "CameraFollow.h"
#include "CrosshairController.h"
// utilities
#include "LoadTilemap.h"
#include "LoadTexture.h"
void ... | [
"jameslimbj@gmail.com"
] | jameslimbj@gmail.com |
a14650f078cd2a2f5f30b9f509988c413398bbac | 218297c214d543e25cd67e95a2e871f49acb797b | /src/service/WifiConnectionService.cpp | f817d34bb5459efefea35268b05f50880004cc7e | [] | no_license | ulvestuen/lunsjregistrering-iot | 45c3b791d679bd277606634f4d48d925b3bb2bf3 | 4414e1d325eff84d14700f183c7f6f84e779b4d8 | refs/heads/master | 2020-07-21T21:38:10.604097 | 2019-10-14T20:29:10 | 2019-10-14T20:29:10 | 206,979,691 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 608 | cpp | #include <service/WifiConnectionService.h>
WifiConnectionService::WifiConnectionService() {}
void WifiConnectionService::connect()
{
Serial.begin(115200);
WiFi.disconnect(true);
WiFi.persistent(false);
WiFi.mode(WIFI_STA);
WiFi.begin(ssid, password);
Serial.println("");
// Wa... | [
"idaruh@gmail.com"
] | idaruh@gmail.com |
21953e951cd8ffead8703c929309fdeb96635669 | 664534cb02d1b7fa43b2b84b27dd17d52f1b8b84 | /꼬인 전깃줄.cpp | 3d1cfac3b0e849c8f8c0f871b3efaabaa12a026a | [] | no_license | chaeyeonhan1225/BOJ | b3b6a50418da902c7e69b6018e93e3ee6fa8017d | 4c733b33fd58d2311ce768298b974f6473887838 | refs/heads/master | 2022-12-16T14:03:35.647699 | 2020-09-20T13:36:47 | 2020-09-20T13:36:47 | 270,011,093 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 597 | cpp | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
// LIS ±¸Çϱâ
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> a(N+1);
for (int i = 1; i <= N; ++i) {
int k;
cin >> k;
a[i] = k;
}
vector<int> s;
for (int i = ... | [
"gkscodus11@gmail.com"
] | gkscodus11@gmail.com |
aa6975e63a648eebd532d5b612866e023dba5622 | d0c44dd3da2ef8c0ff835982a437946cbf4d2940 | /cmake-build-debug/programs_tiling/function13927/function13927_schedule_4/function13927_schedule_4_wrapper.cpp | ef49abd3c9e452461d500e9c9547b81d260e741d | [] | no_license | IsraMekki/tiramisu_code_generator | 8b3f1d63cff62ba9f5242c019058d5a3119184a3 | 5a259d8e244af452e5301126683fa4320c2047a3 | refs/heads/master | 2020-04-29T17:27:57.987172 | 2019-04-23T16:50:32 | 2019-04-23T16:50:32 | 176,297,755 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,257 | cpp | #include "Halide.h"
#include "function13927_schedule_4_wrapper.h"
#include "tiramisu/utils.h"
#include <cstdlib>
#include <iostream>
#include <time.h>
#include <fstream>
#include <chrono>
#define MAX_RAND 200
int main(int, char **){
Halide::Buffer<int32_t> buf00(2048);
Halide::Buffer<int32_t> buf01(3276... | [
"ei_mekki@esi.dz"
] | ei_mekki@esi.dz |
a582923fb7afd48ef6fb39b335d4970c1c3ad989 | 45ba0b455464fe8db168865e2e95d171bba1a3c6 | /website/domain/manager.cpp | 5619b7ec3c3a83186575c491e3cfa9e03651b3df | [] | no_license | sepiosky/Jom-e-Bazar | 45c29608863ea496dbdc4bc7c4824cb096c75708 | 004460b039d12de187178d7bbd532c3812e06025 | refs/heads/master | 2023-01-13T13:26:31.103846 | 2020-11-22T16:52:18 | 2020-11-22T16:52:18 | 315,084,586 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,331 | cpp | #include"manager.h"
using namespace std;
Manager* Manager::signup_manager(string username, string mail, unsigned long password)
{
if(site_manager!=0)
return site_manager;
site_manager=new Manager(username,mail,password);
return site_manager;
}
void Manager::add_car_csv(vector<Product*>& products,... | [
"sepehr1377.sg@gmail.com"
] | sepehr1377.sg@gmail.com |
3e21b0fae404bc65ae13f9a6b985c3f72ee2c7c3 | 1c925e0bc4bd0967f77e4c1c60b9130b6bd8edd0 | /Src/Utility/MessagedException.h | a9da7c05e997e7e15289c12fb3ba9c95b0e7e77d | [] | no_license | d909b/CGE-Piano | ed7ff2184fc6ccb9626e9599ff273667293c1605 | 3d9525cdd8493c26e168badc2363b7aecd635297 | refs/heads/master | 2020-04-05T22:59:32.686324 | 2013-01-10T09:42:49 | 2013-01-10T09:42:49 | 4,771,550 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 418 | h | /*
* MessagedException.h
*
* @date: Jun 24, 2012
* @author: patrick
*/
#pragma once
#include <exception>
#include <string>
class MessagedException: public std::exception
{
public:
MessagedException(std::string message) throw() :
message_(message)
{;}
virtual ~MessagedException() throw() {;}
virtual cons... | [
"patrick.schwab@technikum-wien.at"
] | patrick.schwab@technikum-wien.at |
92b6b6fb357a64b785434d4accf4ec010bff1c83 | 5f1b3d3e8d9e38b5db3d490487556e2858c3cace | /_Include/SerialSettings.h | c019572b95c0b545db68944721db1f0d2996e60c | [] | no_license | NicolaDemers/QtSerialCommands | ff7e986b81f3b13739194389111bd4e54330344f | 65717bfe4855c93f4f05376abdc6f339842d1e01 | refs/heads/master | 2021-08-19T03:24:29.417213 | 2018-08-23T17:33:40 | 2018-08-23T17:33:40 | 165,329,828 | 0 | 1 | null | null | null | null | ISO-8859-1 | C++ | false | false | 1,072 | h | #pragma once
#include "QAsyncSerialPort.h"
/*! \class QSerialSettings
*
* \brief Conteneur des paramètres d'un appareil de communication série. Permet la sauvegarde et le chargement de fichier ini.
*
* save() pour sauvegarder et load() pour charger.
*
*/
class SerialSettings
{
public:
SerialSettings(QAsyncSeria... | [
"nicola.demers93@gmail.com"
] | nicola.demers93@gmail.com |
377e09a09ae44dcd5b2673e607e8f236fb44d6c8 | 41823c261082cc74037f56be62996600422fe518 | / world-opponent-network/wonapi/WONInternal/ActivatePatchOp.cpp | ad5ed9a877f84b748a0eaa7230ec8a25587542a1 | [] | no_license | ECToo/world-opponent-network | 90adf14ca8b324898a1f0b2202c1cfb2b4bdeb03 | fbb35876ae26006606d07b6297d557bd53234066 | refs/heads/master | 2021-01-25T07:40:21.063935 | 2014-05-16T16:02:54 | 2014-05-16T16:02:54 | 32,217,407 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,216 | cpp | #include "ActivatePatchOp.h"
using namespace WONAPI;
///////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////
ActivatePatchOp::ActivatePatchOp(ServerContext* theContext)
: DBProxyOp(theContext),
mMsgType... | [
"shefben@gmail.com@248fbcc8-4fec-2078-69e5-adb693b6ed4e"
] | shefben@gmail.com@248fbcc8-4fec-2078-69e5-adb693b6ed4e |
8c0b7c62a47a7d6938019f4b215ee99dc95bed29 | 9a3b9d80afd88e1fa9a24303877d6e130ce22702 | /src/Providers/UNIXProviders/AuthorizedUse/UNIX_AuthorizedUse_ZOS.hxx | c814bed376c679fddf8db1b6c9534f2321261188 | [
"MIT"
] | permissive | brunolauze/openpegasus-providers | 3244b76d075bc66a77e4ed135893437a66dd769f | f24c56acab2c4c210a8d165bb499cd1b3a12f222 | refs/heads/master | 2020-04-17T04:27:14.970917 | 2015-01-04T22:08:09 | 2015-01-04T22:08:09 | 19,707,296 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,809 | hxx | //%LICENSE////////////////////////////////////////////////////////////////
//
// Licensed to The Open Group (TOG) under one or more contributor license
// agreements. Refer to the OpenPegasusNOTICE.txt file distributed with
// this work for additional information regarding copyright ownership.
// Each contributor lice... | [
"brunolauze@msn.com"
] | brunolauze@msn.com |
e7a6b76deb29f7cf0ce1d69ffd3002b644712d6b | 3a35b302ac0355dd5911bdd5f93546fd22766ed2 | /Class/Object/Bullet/BulletFactory.cpp | 6cdaf76b0863275ee657a0b8af9c1045cd67bcdb | [] | no_license | kyoichi001/sarashina-yako | 86ec8e66e6a8d1b0751baf52bcdc29b9785b7419 | bcf25a24bc21bff1b450d69e94376e3e2d7170ab | refs/heads/master | 2023-02-01T21:08:27.135547 | 2020-12-16T02:36:52 | 2020-12-16T02:36:52 | 321,843,299 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,918 | cpp |
#include "BulletFactory.h"
#include "IBullet.h"
#include "../../../Library/Func.h"
#include "../../../Library/Renderer.h"
#include "../../../Library/Math/Constant.h"
#include "../../../Library/Easing/InterpolationMethod.h"
#include "../../MediatorClass/ObjectAdaptor.h"
#include "RenewManager.h"
#include <cmath>
inli... | [
"40378788+kyoichi001@users.noreply.github.com"
] | 40378788+kyoichi001@users.noreply.github.com |
a26227ca9023716758309002271073b85130bb67 | d64737d31ae9caba2820ea1048be3f9bce708b42 | /cpp/number-of-rectangles-that-can-form-the-largest-square.cpp | 3c50f388e293259f6fa044c8c0d9e85cd2352fc2 | [] | no_license | ldcduc/leetcode-training | 2453ec13e69160bc29e8e516e19544c2b25bf945 | 40db37375372f14dd45d0a069c8b86fe36221f09 | refs/heads/master | 2023-08-05T01:46:52.993542 | 2021-09-18T16:47:54 | 2021-09-18T16:47:54 | 271,736,046 | 9 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 685 | cpp | /* Problem url: https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square
* Code by: ldcduc
* */
/* Begin of Solution */
class Solution {
public:
int countGoodRectangles(vector<vector<int>>& rectangles) {
int side = 0, result = 0;
for (int i = 0; i < rectangles.size(); ++... | [
"ldcduc@apcs.vn"
] | ldcduc@apcs.vn |
056fcab0b22abd311cd88f6eb8eca707d8df6251 | f6408fa4d36915390024275dc69cb8a4427074f9 | /sprout/algorithm/fixed/transform.hpp | e120f0d909df762ccee461b0e9760261d327ed26 | [
"BSL-1.0"
] | permissive | nekko1119/Sprout | 72dcc643536e595832be7d05151a1444e072980c | 3e33de25ebbf4043f86a56f58459e3e45fcbe746 | refs/heads/master | 2021-01-15T18:04:36.229085 | 2013-09-20T07:38:27 | 2013-09-20T07:38:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,918 | hpp | /*=============================================================================
Copyright (c) 2011-2013 Bolero MURAKAMI
https://github.com/bolero-MURAKAMI/Sprout
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.tx... | [
"bolero.murakami@gmail.com"
] | bolero.murakami@gmail.com |
396bf6e3f152e4b4dc03ac9de9d32961d3c6ac15 | 5de7df0be411b4bad61f927cae845bdb8223308f | /src/tests/ascent/t_ascent_mpi_derived.cpp | 6ebae0c6c0bcd52b62e777b24a70fe851948f0ef | [
"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 | 3,809 | 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.
//~~~~... | [
"noreply@github.com"
] | Alpine-DAV.noreply@github.com |
bafe56a854e97d6245cc37c0a18de8c4a0b97280 | b7e97047616d9343be5b9bbe03fc0d79ba5a6143 | /src/core/chemical/ResConnID.hh | 05ac578fc198057eb8d65030dc6ea6f3712573ac | [] | no_license | achitturi/ROSETTA-main-source | 2772623a78e33e7883a453f051d53ea6cc53ffa5 | fe11c7e7cb68644f404f4c0629b64da4bb73b8f9 | refs/heads/master | 2021-05-09T15:04:34.006421 | 2018-01-26T17:10:33 | 2018-01-26T17:10:33 | 119,081,547 | 1 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 2,253 | hh | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... | [
"achitturi17059@gmail.com"
] | achitturi17059@gmail.com |
0e4f44160e0437bef76dbd813086e2b691d8b771 | 12ea44ea5a8fc9a7451d52dccb1689ebd2c5e71d | /main.cpp | 9e739eece1234e82f637d5264721762cc4a78514 | [] | no_license | aadebuger/jsonlr | 4ce38cb110de4e9c0afcce055a78b798b9f9afee | f67f06b807ac606616637470e16469b21f743a1b | refs/heads/master | 2021-01-19T09:36:48.907137 | 2017-02-16T02:23:38 | 2017-02-16T02:23:38 | 82,129,487 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 455 | cpp | #include "json.hpp"
#include <iostream>
// for convenience
using json = nlohmann::json;
int main()
{
json j = "{ \"happy\": true, \"pi\": 3.141 }"_json;
for (json::iterator it = j.begin(); it != j.end(); ++it) {
std::cout << *it << '\n';
std::cout << it.key() << " : " << it.value() << "\n";... | [
"zh@zqf.com.cn"
] | zh@zqf.com.cn |
d298282c6a37cf1b1750ae490e29871d442e095b | fa29e2bce27a561808c8540842ea65339c8cf8f1 | /tests/octree/src/ModelTests.cpp | b91963726f29d1b769cbdd3c194fb7e3a3e91bb5 | [
"Apache-2.0"
] | permissive | tachyonbrush/hifi | 3f75973e5fcc782b800b49bb31663eab90902dc7 | 8428b1a4ba355c4593a7ebff58ee1686b0069a9c | refs/heads/master | 2021-01-16T18:02:10.823015 | 2014-09-12T00:53:55 | 2014-09-12T00:53:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,758 | cpp | //
// EntityTests.h
// tests/octree/src
//
// Created by Brad Hefta-Gaub on 06/04/2014.
// Copyright 2014 High Fidelity, Inc.
//
// Distributed under the Apache License, Version 2.0.
// See the accompanying file LICENSE or http://www.apache.org/licenses/LICENSE-2.0.html
//
// TODO:
// * need to add expected r... | [
"bradh@konamoxt.com"
] | bradh@konamoxt.com |
beb1a69135066d939f53007ef668df869eb44a77 | 0d773b5491e0b2a5c02c1ff633b0b27c141e6481 | /Native/ScannerDriver.h | e211b2b44e552b7e6642d91d59a18d8f7e7663b2 | [
"Apache-2.0"
] | permissive | pravets/AndroidScannerDriverFor1C | 3528487bac407f80a3ed76e916c0d1b244b27bb5 | 5be1b714ed91ec7ef616ea4336e1a750c234a12f | refs/heads/master | 2023-08-30T12:05:57.763427 | 2021-05-25T14:54:36 | 2021-05-25T14:54:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 120 | h | #pragma once
class ScannerDriver
{
public:
const char * getPlatformABI();
ScannerDriver();
~ScannerDriver();
};
| [
"p.tolkachev@hotmail.com"
] | p.tolkachev@hotmail.com |
b827d445176b7f82187eef7b310a94e45539c629 | 1373eaa72803b4425ca91cfd54d0708dafcb62e7 | /LinkedBinaryTree/LinkedBinaryTree.cpp | 7f31b8daf03cfa2772a31e47e9f67328c83697b2 | [] | no_license | aadeaina2014/BinaryTrees | 0e35aaa83911f4fc3f904c3cd84a325600f564d8 | 87888f76702d1e5e078004c111bc3c7fc5efe8e4 | refs/heads/master | 2021-01-18T21:22:46.057883 | 2016-10-19T20:50:32 | 2016-10-19T20:50:32 | 55,170,071 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,296 | cpp | /********************************************************************
Florida Institute of Technology
College of Engineering
Electrical and Computer Engineering Department
ECE 2552: Software Hardware Integration
FileName : LinkedBinaryTree.cpp
Code Author : Ayokunle Ade-Aina [aadeaina2014@my.fit.edu] (c)2016
*********... | [
"aadeaina2014@my.fit.edu"
] | aadeaina2014@my.fit.edu |
f2a0d6b25b117ae8281d61bbeb67efafb3e07c9c | 45f7454de8cc4e5428ea16e77745ef32e0e4c8d8 | /elements/standard/firewalltable.cc | fb16aeb0b783f4203e42d8c2d8181a94f9793197 | [
"LicenseRef-scancode-click-license",
"W3C",
"MIT"
] | permissive | hongdal/vNIDS_Ramcloud | 376c80c899613091fe13d97570c83f2132ebdc45 | 583b55f84ab1ae9ff8c12b2d815d8b1b2afd6516 | refs/heads/master | 2020-04-11T05:03:35.863203 | 2018-12-11T04:49:03 | 2018-12-11T04:49:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 53,245 | cc | #include <click/config.h>
#include <stdio.h>
#include <stdlib.h>
#include "firewalltable.hh"
CLICK_DECLS
#define UNUSED(expr) \
do \
{ \
(void)(expr); \
} while (0)
// comment this out when release.
#define FIREWALLTABLE_EVAL 1
//#define FIREWALLSTATE_EVAL 1
extern class firewa... | [
"guozetang@gmail.com"
] | guozetang@gmail.com |
2b077b41ac734acc8bc5d394a5d17dca00b5c54a | 200613ed3a6e1328bb40f77759fa656c0a874c77 | /src/App/Classes/Game/TongBiNiuNiu/GameSceneUI/GameRoleNode.cpp | b9b041402eecc38a4f02fb73ef9c00f605e50d43 | [] | no_license | iuvei/ChessGameApp | eb57164a8a8e41490a5ee70dda8fc323028a8db6 | a8765f4f90954cc6281a98b7f243be0afc50689c | refs/heads/master | 2020-04-19T19:30:38.562729 | 2018-01-06T16:52:49 | 2018-01-06T16:52:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,609 | cpp | #include "GameRoleNode.h"
#include "../../CustomUtilsSrc/AnimationMgr/AnimationMgr.h"
USING_NS_CC;
using namespace ui;
USING_TBNN_NAMESPACE;
GameRoleNode::GameRoleNode():
m_pHead(nullptr),
m_notify(nullptr),
m_clipNickName(nullptr)
{
auto scaleTo = ScaleTo::create(0.1f,1.0f);
auto show = Show::create();
... | [
"liuyeying1103@163.com"
] | liuyeying1103@163.com |
2ba287e53b5ad6bb04d96d41e541fa19327ee10a | ff5d91e9eee4dd41e85d418120f11daec71cf93b | /2018/nazionali/caduta/sol/ottima_buggata3.cpp | bc45e5d1cdac46c44014e9a0867de504add1c508 | [] | no_license | olimpiadi-informatica/oii | d0023c5fa00100cadc6a13b1e153fca0017177ca | ce6bc7e8b40a32c01611f4b20ee72f8a9318eafd | refs/heads/master | 2021-05-16T02:35:15.742339 | 2020-03-14T21:56:18 | 2020-03-14T21:56:18 | 28,759,072 | 31 | 6 | null | 2019-12-15T12:37:53 | 2015-01-04T00:55:52 | C++ | UTF-8 | C++ | false | false | 9,461 | cpp | #include <algorithm>
#include <vector>
#include <assert.h>
#include <stdio.h>
typedef enum {
OK,
RISOLTO,
IMPOSSIBILE
} stato_t;
typedef struct {
int domino1;
int domino2;
} coppia_t;
stato_t correggi(int N, int altezze[], coppia_t* scambio) {
for (int i=0; i<N; i++) {
altezze[i] = altezze[i]-1;
... | [
"williamdiluigi@gmail.com"
] | williamdiluigi@gmail.com |
555e6e114618b00fe3e8c3ff63ed9de770e8bc5a | b98f6ff030075bfcd185a3908f440342849c3195 | /Path_Sum_II.cpp | 58de68fbcea7a1e5411263b67a359a9d79662b43 | [] | no_license | youlingman/leetcode | 1b72d1d824fa077d13efda631f7080888ec5df65 | 05d192332d41485ea00f833c3f7fe214f1f18cd7 | refs/heads/master | 2021-01-01T18:11:23.420713 | 2014-08-22T14:18:47 | 2014-08-22T14:18:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,281 | cpp | /* Path Sum II
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
For example:
Given the below binary tree and sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
return
... | [
"chenyoucyl@gmail.com"
] | chenyoucyl@gmail.com |
9f3ac646b5e6848ce028a9f2cfb93f1d5d6bebbd | d34f94a4740256901edfb2ee2325505ca834ba30 | /C++/skola/rabbit.cpp | f33f9a4e1e609041b8f4dfea0722160bc6b7b177 | [] | no_license | dimitarkole/CPlusPlusTasks | 706a15e533e657a91fe5c7d0ccee2cc129a2ac5f | 8b3adf02ab359babdc36b73085a83fb9055b0716 | refs/heads/master | 2020-12-04T23:07:48.601834 | 2020-01-05T14:25:05 | 2020-01-05T14:25:05 | 231,928,854 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 294 | cpp | #include<iostream>
using namespace std;
int main()
{
int a;
for(int i=1;i<=3;i++)
{
cin>>a;
if(a==1)cout<<"("<<(char)92<<"_"<<"/"<<")"<<endl;
else if(a==2)cout<<"("<<"o"<<"."<<"o"<<")"<<endl;
else if(a==3)cout<<"("<<"_"<<"."<<"_"<<")"<<endl;
}
}
| [
"dim_kolev2002@abv.bg"
] | dim_kolev2002@abv.bg |
fcf08d456dee4e6c03fe586fa653758a29cc3ea3 | 465bc0b9904bd8ba029444c699f33aa55e0f4192 | /Übung_7_1/Übung_7_1.cpp | d9297a39de30f9c1c2ba8dd7063765fe57ddec77 | [] | no_license | xJasminxu/-bungen-Programmieren-1 | da0f4cfe26c745aefb6534da62aed24386a6fee3 | 1aa308a0c7b062357bfec265d56ce6c057eea1a8 | refs/heads/master | 2023-02-01T03:52:36.873795 | 2020-12-17T23:27:07 | 2020-12-17T23:27:07 | 322,436,611 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 468 | cpp | // Übung_7_1.cpp : Diese Datei enthält die Funktion "main". Hier beginnt und endet die Ausführung des Programms.
//
#include <iostream>
#include "Rechner.h"
using namespace statistik;
int main()
{
int einarray[10] = { 1, 1, 3, 3, 3, 5, 5, 7, 8, 9};
Rechner rechne = Rechner();
rechne.setarray(10, einarray);
std::... | [
"xujasmin@gmx.de"
] | xujasmin@gmx.de |
78aca62aa4b0b7a2e915b94b25017f6b1e068ec2 | d7ff1908ab98cd2fe1fe1c80bb47c841d82abd1e | /TestCarDatabase/CvvImage.cpp | 3aa75c91ff0d68b05f46c4f14872e8b654694038 | [] | no_license | Aliang-SEU/Face-Recognition-with-Single-Training-Sample | af8bf86277be63ee32068fe6e2fef7e0884a840f | b8deea3fac93fe784936afe3bdb2d84c74e75135 | refs/heads/master | 2020-03-11T12:19:30.681111 | 2018-08-22T01:42:30 | 2018-08-22T01:42:30 | 129,994,239 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,281 | cpp | #include "StdAfx.h"
#include "CvvImage.h"
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////
CV_INLINE RECT NormalizeRect( RECT r );
CV_INLINE RECT NormalizeRect( RECT r )
{
int t;
if( r.left > r.rig... | [
"huangzhiliang555@vip.qq.com"
] | huangzhiliang555@vip.qq.com |
7d9cd2668f54322794db5128079c842ef5091b84 | 5cb8c619a56bd0e021f27dc5936d56ea96a2d2d4 | /includes/Map/ClassicBomb.hpp | e59913ffb75838117a0d7404b93ffba3062e2a4e | [] | no_license | Eygle/BombRaider | 4120b3fd823311fffb4f9ff8df7d096110384bd6 | 5722b2c9995f553bd17f7a6a53982a7712f9362d | refs/heads/master | 2021-01-10T17:14:41.307718 | 2015-12-06T13:32:49 | 2015-12-06T13:32:49 | 47,490,896 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 446 | hpp | #ifndef __CLASSIC_BOMB_HPP__
# define __CLASSIC_BOMB_HPP__
# include "Map/ABomb.hpp"
namespace Map
{
class ClassicBomb : public ABomb
{
ClassicBomb(ClassicBomb const &);
ClassicBomb& operator=(ClassicBomb const &);
void explode();
public:
ClassicBomb(Character::Character *);
ClassicBomb(in... | [
"cavalec.johan@gmail.com"
] | cavalec.johan@gmail.com |
58e92b55d57d2451482eea09dcf042dc66cb9742 | 1d04a44976a0d0effd12b9f1bc18db7bc4c8f96d | /be/src/kudu/util/async_util.h | 1e2830c69d741eba9d4ea265ffadc4f16a558466 | [
"OpenSSL",
"Apache-2.0",
"BSD-3-Clause",
"dtoa",
"MIT",
"PSF-2.0",
"LicenseRef-scancode-mit-modification-obligations",
"bzip2-1.0.6",
"LicenseRef-scancode-unknown-license-reference",
"Minpack",
"BSL-1.0",
"LicenseRef-scancode-public-domain",
"BSD-2-Clause",
"LicenseRef-scancode-openssl",
... | permissive | Pandinosaurus/Impala | d2d189e9efd93196d4fac36f91e926cca041f023 | 7dd2c8100f6d810bde13a0c9f8fb8449344cdcef | refs/heads/cdh5-trunk | 2023-03-13T00:09:43.104849 | 2019-07-25T00:12:06 | 2019-08-14T21:51:53 | 149,855,108 | 1 | 0 | Apache-2.0 | 2019-08-15T22:47:12 | 2018-09-22T07:24:05 | C++ | UTF-8 | C++ | false | false | 2,229 | h | // Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... | [
"jenkins@cloudera.com"
] | jenkins@cloudera.com |
f54acce07d41b5f55d5db7fbe63b4a5e7c1249d5 | 008a5f9ea2cf528186de5506a9841e99b5806896 | /KinFitter/src/TFitParticleEtThetaPhiEMomFix.cc | 8fcaf06951d8465333cd4fe5a754c40b95a17518 | [] | no_license | TopBrussels/TopTreeAnalysisBase | 86ac6f9f4fbad008068612d076d165acc7dcb9f1 | 557647cc6693783a0d315a5806fa83ea6a3e29f4 | refs/heads/CMSSW_80X | 2021-01-17T03:53:26.988093 | 2017-09-13T14:43:50 | 2017-09-13T14:43:50 | 11,848,181 | 1 | 5 | null | 2019-12-03T09:37:10 | 2013-08-02T16:56:43 | C++ | UTF-8 | C++ | false | false | 6,184 | cc | // Classname: TFitParticleEtThetaPhiEMomFix
//
//________________________________________________________________
//
// TFitParticleEtThetaPhiEMomFix::
// --------------------
//
// Particle with a special parametrization useful in hadron
// colliders (3 free parameters (Et, Eta, Phi). The parametrization is
// chos... | [
""
] | |
d45671aa2f0350368e9fec72593a5c023a9c9101 | 5386865e2ea964397b8127aba4b2592d939cd9f2 | /grupa C/olimpiada/oblasten/2011/raboti/Varna/C/PPL/robot.cpp | 8d41c0f2492935a3801edb87f28052ac1c98b168 | [] | no_license | HekpoMaH/Olimpiads | e380538b3de39ada60b3572451ae53e6edbde1be | d358333e606e60ea83e0f4b47b61f649bd27890b | refs/heads/master | 2021-07-07T14:51:03.193642 | 2017-10-04T16:38:11 | 2017-10-04T16:38:11 | 105,790,126 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 686 | cpp | #include<iostream>
using namespace std;
int k=0,h,c[105][105],ch[1005]={0},m,n,a2,b2;
void rek(int a, int b){
if(k==h && ch[c[a][b]]==0){ch[c[a][b]]=1; k=0; rek(a2,b2);}
else if(a-1>=0 && ch[c[a-1][b]]==0) { k++; rek(a-1,b); }
else if(b-1>=0 && ch[c[a][b-1]]==0) {k++; rek(a,b-1);}
else if(a+1<m && ch[c... | [
"dgg30"
] | dgg30 |
27b7d7bd36d26c59f38f0f64e9f49c87b168884c | 4ca447904892cf433b31250ddf10a760429d51ac | /Level 1 Foundation/5. Basic Data Structures/1. Stacks and Queues/12. Merge Overlapping Interval.cpp | 302dbd693ceae0e7d959c2834df4f3790ec56dd8 | [] | no_license | Sounak-Dey/Coding | cf771d4268a7071631aa99bc20e5280b5decc146 | b0a01e5b5b05c9290f39c81ae7df054330e52800 | refs/heads/master | 2023-07-16T05:04:18.126147 | 2021-09-03T11:14:07 | 2021-09-03T11:14:07 | 369,949,860 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,260 | cpp | #include<iostream>
#include<vector>
#include<stack>
#include<algorithm>
using namespace std;
void solve(vector<pair<int, int>> &intervals)
{
int n = intervals.size();
sort(intervals.begin(), intervals.end()); // sort on the basis of start time
stack<pair<int, int>> st, rv;
st.push(intervals[0]); //... | [
"sounak.dey@iiitb.ac.in"
] | sounak.dey@iiitb.ac.in |
d606e64ef652c3e406f7976b32b4744bb256ede9 | 4978fc75df9363597b86ea34d3f728b174465717 | /SalesSystemConsoleServer/include/SalesServer/QPlugins/QStatisticsGetter/statisticshandlers.cpp | 5e4302486c0462c3286020dd984de3944baa384e | [] | no_license | karpinochkin/sales-system | 620d32aad51c602e5d394a2eccd349b3e59a27d7 | 30b86d9923c75acec8c87eafbc868203a3063009 | refs/heads/master | 2022-11-23T16:02:16.003061 | 2020-07-16T08:44:27 | 2020-07-16T08:44:27 | 280,083,197 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,360 | cpp | #include "statisticshandlers.h"
using namespace Statistics;
QMoney::QMoney(QDatabaseConrol *db)
: db(db)
{
}
QVector<QVariant> QMoney::getFirstVector()
{
QVector<QPointSale> pointSales = db->pointSale->getPointSales();
QVector<QVariant> output;
for(auto pointSale : pointSales) {
output.push... | [
"karpmoney@mail.ru"
] | karpmoney@mail.ru |
600f75301497051a01f68706f6d7821e3306df2b | b6c25fe3ea803e478b880eba549e873f6e71b099 | /Win32/VitalUtils/VitalUtilsDlg.h | 82097b256f4a324c16da7b62b8756c1837e9624f | [
"BSD-3-Clause"
] | permissive | safetynet1950s/vitalutils | ac88baa8c44481f96ada0607c9b2550c826daa88 | 0816cfa40eead8114bd739e2dfc60bfd9af2e07f | refs/heads/master | 2020-07-30T01:47:22.192678 | 2019-05-11T00:16:45 | 2019-05-11T00:16:45 | null | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 3,747 | h | #pragma once
#include "afxwin.h"
#include "EditEx.h"
#include "afxcmn.h"
#include "OptRunScript.h"
#include "OptRecsDlg.h"
#include "OptRenameDlg.h"
#include "OptDelTrksDlg.h"
#include "OptCopyFilesDlg.h"
#include <map>
#include <set>
#include "Canvas.h"
using namespace std;
class CVitalUtilsDlg : public CDialogEx {
... | [
"lucid80@gmail.com"
] | lucid80@gmail.com |
124a80388cd7527b50909e114927c132cef2550d | d975a6e48c0df5fa4dbbda9d93d99822bccdad6b | /inhertiance.cpp | ef5a6e3d614956a9351e1eaee3dff7e5856cf161 | [] | no_license | prashant2-4-4/Prashant-Pathak | bab4b94640e7545002d030b509c987e3658c5c12 | 8ca7d700f43046355857571fcc5b5a9e37dcd3b9 | refs/heads/master | 2021-07-10T13:21:20.100937 | 2020-10-28T07:33:46 | 2020-10-28T07:33:46 | 211,568,068 | 2 | 6 | null | 2020-10-28T07:33:48 | 2019-09-28T22:18:03 | Python | UTF-8 | C++ | false | false | 390 | cpp | #include <iostream>
#include <string>
using namespace std;
class Human{
protected:
string name;
int age;
public:
void setage(string iname , int iage)
{
name = iname;
age = iage;
}
};
class student : public Human{
public:
void display()
{
cout << name << endl ;
}
};
int main()
{
stu... | [
"deepdarshan21@gmail.com"
] | deepdarshan21@gmail.com |
74abd1313429e9aa5b5d12579f459b8963be2c89 | 375c9bd8a820e512bd25110e094b8546a31898fc | /100/006.cpp | 939b3e8ac160368f21f8716621dea6815f103260 | [] | no_license | quid9998/kyopro | a21256c9b12b4a6b3ff61d6ec48c93fe5aba78d7 | 2b279b9fe6eb399bac7e7d834ace9230ff408eae | refs/heads/master | 2023-04-02T08:43:05.923958 | 2021-04-01T13:12:51 | 2021-04-01T13:12:51 | 349,601,820 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 916 | cpp | //自力AC，復習不要
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
//数値を0埋めしたstringに変換
string ume(ll n)
{
... | [
"polypterus666@gmail.com"
] | polypterus666@gmail.com |
dbf1b7b44e1355df142446ad84634f94c08eadbc | 03c4096d19255a6e72b40949ff2e77ba79fa74f7 | /HF-Jet/HFMLTrigger_LANL/HFMLTriggerOccupancy.h | 736ba07d85e98736c9b559eb3c14240181c8de91 | [] | no_license | sPHENIX-Collaboration/analysis | c0687cd1b4ea9ec426e71303d2a8b4c34d19c11c | dc932e3355d09898bba525ac1e6292ade5c48d02 | refs/heads/master | 2023-08-31T22:22:52.275236 | 2023-08-29T22:53:04 | 2023-08-29T22:53:04 | 37,741,543 | 4 | 58 | null | 2023-09-13T19:37:21 | 2015-06-19T19:25:00 | C | UTF-8 | C++ | false | false | 2,813 | h | #ifndef __HFMLTriggerOccupancy_H__
#define __HFMLTriggerOccupancy_H__
// --- need to check all these includes...
#include <fun4all/SubsysReco.h>
#include <limits.h>
#include <cmath>
#include <fstream> // std::fstream
#include <string>
#include <vector>
class TTree;
class TFile;
class TH1F;
class TH2F;
class TH3F;
c... | [
"yasser.corrales.morales@cern.ch"
] | yasser.corrales.morales@cern.ch |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.