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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
76ad0ebf28f9ed0af1e16a25e9f10302e6d8277a | 15ae3c07d969f1e75bc2af9555cf3e952be9bfff | /analysis/pragma_before/pragma_554.hpp | 503daf25082180027bae8495876c557727ca076e | [] | no_license | marroko/generators | d2d1855d9183cbc32f9cd67bdae8232aba2d1131 | 9e80511155444f42f11f25063c0176cb3b6f0a66 | refs/heads/master | 2023-02-01T16:55:03.955738 | 2020-12-12T14:11:17 | 2020-12-12T14:11:17 | 316,802,086 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 140 | hpp | pragma_554.hpp | #ifndef TWIGXLYVUJQ_VJLCVYJQSEX_FXUYEGLBW_HPP
#define TWIGXLYVUJQ_VJLCVYJQSEX_FXUYEGLBW_HPP
#endif // TWIGXLYVUJQ_VJLCVYJQSEX_FXUYEGLBW_HPP |
4363d46c2a835b97cc7ecc1ec74ca0ed209c66e6 | dd3cf7414ede3f652971e6be71407122d4326974 | /ADS/bit.cpp | 86560e83b102b3f43ac6a01e49d69a93591d1f76 | [] | no_license | AmanKathait15/Data-Structure-and-Algorithm | a3c82f086e8a376c9bfd1e0d87a538337322ebe6 | d2c04d37ef7492bf2b4e24b5b7a2756043030899 | refs/heads/master | 2023-02-01T17:54:06.438376 | 2020-11-29T13:47:35 | 2020-11-29T13:47:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 742 | cpp | bit.cpp | #include<bits/stdc++.h>
using namespace std;
#define num int
num query(num bit[],num i,num res)
{
for(; i>0; i = i & (i-1)) res+= bit[i]; return res;
}
void update(num bit[],num i,num val,num n)
{
for(; i<=n; i+= i & (-i)) bit[i] += val;
}
void display(num a[],num n)
{
for(num i=0; i<=n; i++)
{
... |
8c91ce3e7a18ec8d2f456dccc1f2eaf49927482c | affec18a9b771fba9cc089e3d587983276d3d261 | /A/1064.cpp | 7ce783f2fd197b902cc7aec75bd367c56330289a | [] | no_license | sh4062/PAT | 62a6400ad9ba2d1e23b1075916640a27a2c4a21f | e8a907c660b62bb45ceba10c30fe35c3546aed1e | refs/heads/master | 2020-04-23T09:28:25.958675 | 2019-04-03T10:21:00 | 2019-04-03T10:21:00 | 171,069,408 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 609 | cpp | 1064.cpp | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> in;
void inorder(int r)
{
if (r > N)
return;
inorder(2 * r);
in.push_back(r);
inorder(2 * r + 1);
}
int main()
{
cin >> N;
vector<int> v;
v.push_back(-1);
in.push_back(-1);
for (int i = 0; i < N; i++)
{
... |
d51d7d1c4f6ddae945fcfb050158715f9c536800 | 8f50c262f89d3dc4f15f2f67eb76e686b8f808f5 | /MuonSpectrometer/MuonGMdbObjects/src/DblQ00Alin.cxx | c4361ead96779045e2f62686db1ed283a040a0b6 | [
"Apache-2.0"
] | permissive | strigazi/athena | 2d099e6aab4a94ab8b636ae681736da4e13ac5c9 | 354f92551294f7be678aebcd7b9d67d2c4448176 | refs/heads/master | 2022-12-09T02:05:30.632208 | 2020-09-03T14:03:18 | 2020-09-03T14:03:18 | 292,587,480 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,794 | cxx | DblQ00Alin.cxx | /*
Copyright (C) 2002-2020 CERN for the benefit of the ATLAS collaboration
*/
/***************************************************************************
DB data - Muon Station components
-----------------------------------------
***************************************************************************/
#incl... |
c79ce5c119f12feec1a3e1938ca9157384fae340 | d77775087bcc0c0ea68bf02550486b7c807a95f1 | /ObjExpCore/ProcessInfo.cpp | 401ae9073729b89f171d774e09d2c5f795d6f94a | [
"MIT"
] | permissive | zodiacon/SystemExplorer | 7dcbd08e95a1f64c81b9fc7faadc2866b271dd73 | f5d51f63581807dbd2a8957bc4bc9dae4aa001cc | refs/heads/master | 2023-06-21T20:03:41.393103 | 2023-06-10T20:44:16 | 2023-06-10T20:44:16 | 204,397,104 | 593 | 113 | MIT | 2021-08-28T09:48:59 | 2019-08-26T04:41:32 | C | UTF-8 | C++ | false | false | 780 | cpp | ProcessInfo.cpp | #include "pch.h"
#include "ProcessInfo.h"
using namespace WinSys;
ProcessInfo::ProcessInfo() {
}
const std::vector<std::shared_ptr<ThreadInfo>>& ProcessInfo::GetThreads() const {
return _threads;
}
const std::wstring& WinSys::ProcessInfo::GetUserName() const {
if (!_userName.empty())
return _userName;
if (Use... |
23f4c79485a35008a4e092bf46e367323c188d9e | 7f85be85e41a07dd9e4587f589ed1f95885027c5 | /exec/analyze_pfc.cc | 45bd2cd53b48ff2c15294dfc8e6f7d2388dd3852 | [] | no_license | thomas-davenport-op/MODAnalyzer-PC | e1210855ef066c32b954445c6ba445b78b30c72e | 8da41e51d668812dc5db933822c4506d89e0017a | refs/heads/master | 2020-05-17T10:22:24.753524 | 2020-04-21T13:13:30 | 2020-04-21T13:13:30 | 183,653,165 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,901 | cc | analyze_pfc.cc | #include <iostream>
#include <unordered_map>
#include <sstream>
#include <fstream>
#include <vector>
#include <string>
#include <stdexcept>
#include <iterator>
#include <iomanip>
#include <limits>
#include <chrono>
#include <boost/unordered_map.hpp>
#include <boost/unordered_map.hpp>
#include <boost/filesystem.hpp>
... |
f65479beecd91581e106bc44e73d7e17fdc4d1ae | fd911fe124408f4f6e300b084b6f1d30f5da30ba | /libs/base/include/mrpt/utils/CTicTac.h | 665b933a22ae8c5a118277c76ea678524ad099ad | [
"BSD-3-Clause"
] | permissive | tg1716/SLAM | 5710024e34f83687c6524cfb947479951d67941e | b8583fb98a4241d87ae08ac78b0420c154f5e1a5 | refs/heads/master | 2021-01-02T09:11:41.110755 | 2017-07-30T16:04:31 | 2017-07-30T16:04:31 | 99,160,224 | 5 | 2 | null | 2017-08-02T21:13:21 | 2017-08-02T20:57:07 | null | UTF-8 | C++ | false | false | 1,550 | h | CTicTac.h | /* +------------------------------------------------------------------------+
| Mobile Robot Programming Toolkit (MRPT) |
| http://www.mrpt.org/ |
| |
| Cop... |
5ecc2981b944ed21b31e3144894e05de28c2cc42 | 4e6ee280d0635e9b747e19cf61447c67a2609e77 | /Engine/Command.h | 1cf059489640dc18f3526d67a8e2179df04c94c5 | [] | no_license | NicolasCAZIN/TRN | 89442af85c1b15795e752c4c77911fb853e508cc | b236d94b2b9e200398f5d56f752c53bc8fbc1fb8 | refs/heads/master | 2021-01-02T09:36:07.057149 | 2019-06-11T11:55:41 | 2019-06-11T11:55:41 | 99,256,071 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 388 | h | Command.h | #pragma once
#include "engine_global.h"
namespace TRN
{
namespace Engine
{
class ENGINE_EXPORT Executor
{
protected :
class Handle;
std::unique_ptr<Handle> handle;
public:
Executor();
~Executor();
public :
void post(const std::function<void(void)> &functor);
public:
public :
void... |
da38dd9d9bf2d254311aaceed73bbb1ade280196 | 52531543ffc69b4ddb83332d7596d9bec6dea63b | /src/Chapter15/queuetp.h | d6c5636f4944ee3c8b5bc3fce864a3575e307b2d | [] | no_license | linxiaoyi0724/Cpp_CourseUbuntu | 6daf5913eada48c8b57c9047939a59fc25affe53 | a4894898ac1a5a231cabc430a6f33c565cd219df | refs/heads/master | 2021-07-13T08:15:31.999533 | 2020-09-07T06:00:40 | 2020-09-07T06:00:40 | 195,845,505 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,345 | h | queuetp.h | #ifndef QUEUETP_H_
#define QUEUETP_H_
template<typename T>
class QueueTp
{
private:
enum { Q_SIZE = 10 };
class Node
{
public:
T item;
Node* next;
Node(const T& i):item(i),next(0){}
};
Node* front;
Node* rear;
int items;
const int qsize;
QueueTp(const QueueTp& q):qsize(0){}
//QueueTp& operator=(const... |
f9efbf42a29ce668fbe39db537730d09c873e887 | f954d4becae0ef07d253dec5ebe9eb7238919f4d | /editor/cn/[剑指 Offer 05]替换空格.cpp | a316aaa034729eae4a1dbe9be52e2c43923da69c | [] | no_license | iznilul/leetcode- | ec2c4f3d6ea487daa0791810c45971abeca87952 | c4ee1510701601e6d0851e68753ba0768099cbfb | refs/heads/main | 2023-03-30T14:46:19.387944 | 2021-04-09T05:02:21 | 2021-04-09T05:02:21 | 315,317,344 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 956 | cpp | [剑指 Offer 05]替换空格.cpp | //请实现一个函数，把字符串 s 中的每个空格替换成"%20"。
//
//
//
// 示例 1：
//
// 输入：s = "We are happy."
//输出："We%20are%20happy."
//
//
//
// 限制：
//
// 0 <= s 的长度 <= 10000
// 👍 66 👎 0
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
public:
string replaceSpace(string s) {
int length = ... |
7986f4c8fe2aba05786af64f355686f27bd98be3 | 4efddc6f368533090c68bd806d6327154cfa57a0 | /day7/intcode.hpp | eb073b15bf9223f1cf5ba67b8493e42dcdfdffcd | [] | no_license | Shensd/AdventOfCode2019 | e6edcfae513b4fdda9ab58bdd6ed44778726d666 | 3712f9e23229b001edf4d7d80cb9c834ee649262 | refs/heads/master | 2022-12-10T01:38:51.353812 | 2019-12-17T02:22:25 | 2019-12-17T02:22:25 | 225,270,494 | 0 | 0 | null | 2022-11-22T04:54:12 | 2019-12-02T02:44:41 | C++ | UTF-8 | C++ | false | false | 3,139 | hpp | intcode.hpp | #ifndef INTCODE_HPP
#define INTCODE_HPP
#include <iostream>
#include <fstream>
#include <vector>
#include <sstream>
#include <algorithm>
namespace intcode {
/**
* Contains information about a given instruction
*/
class Instruction {
public:
// max argument amount is 3
bool flags... |
46e9e3fb74c7df4068d1c380b22bcd769748ac40 | 04f15913aca8a702efe47962bf82b60eedad73d9 | /World/LibZ/MapParameters.h | 49e277e0b09b858cc9d5c849287b61b3dc34d91a | [] | no_license | DevilCCCP/Code | eae9b7f5a2fede346deefe603a817027a87ef753 | 9cc1a06e5010bb585876056a727abad48bca3915 | refs/heads/master | 2021-10-07T17:04:27.728918 | 2021-09-28T06:49:50 | 2021-09-28T06:49:50 | 166,522,458 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,521 | h | MapParameters.h | #pragma once
#include <Lib/Include/Common.h>
DefineClassS(MapParameters);
class MapParameters
{
PROPERTY_GET (int, GlobeRadius)
PROPERTY_GET (int, GlobeSector)
PROPERTY_GET (int, WorldSector)
PROPERTY_GET (int, GroundPercent)
PROPERTY_GET (int, GlobePlateCount)
PROPERTY_GET (int, ... |
709b1ced0dbee7ae7830ee42d8633130a1ce06e3 | c9cd834598d05d75668b6774bb46b592ed37c0d6 | /source/main.cpp | 4f97cab1a9005a7f2299834c4d6f4729c42dc678 | [] | no_license | pmcalabrese/web-bluetooth-mbed | e994b89bdb86ef5b1e104a21bd3e8ae8d8dc503a | a8c6929c6d00e2f7c307aee657b5350eca58b959 | refs/heads/master | 2021-01-23T00:44:30.157433 | 2018-02-16T11:13:32 | 2018-02-16T11:13:32 | 92,835,668 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,897 | cpp | main.cpp | /* mbed Microcontroller Library
* Copyright (c) 2006-2013 ARM Limited
*
* 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 re... |
3ce9820df60f6f562f88c5e97ae32b4453408c80 | 830bef33457d814d0168e5a9557987a049c0083c | /src/docker/v2/HTTPRequest.h | 4c2ad53486e79de8666bd7467de9cc31681075dc | [] | no_license | przemkovv/sphinx-cpp | c005f1f11904c72c3f1561319c9fb867bde5ebdd | 5950f1e331fd968303b8d8756758c57686c92cfb | refs/heads/master | 2020-05-21T19:09:32.066325 | 2016-11-24T02:46:28 | 2016-11-24T02:46:28 | 62,318,132 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 652 | h | HTTPRequest.h | #pragma once
#include "HTTPCommon.h"
#include "HTTPHeaders.h"
#include <fmt/format.h>
#include <map>
#include <string>
namespace Sphinx {
namespace Docker {
namespace v2 {
class HTTPRequest {
HTTPMethod method_;
std::string uri_;
HTTPHeaders headers_;
std::string data_;
void addDefaultHeaders();
public... |
36831e42c1cb8497bede654b2d33398d18f63d54 | d91a183cd3f4c4909c5603825568c47e97de559a | /C++/Fibonacci.cpp | 7a3c99f5f043063d0c7e0c2fb19fe057e66b8145 | [] | no_license | Eliale/CandCplusplus | b4c5236c80e06f17dacbe2ee307be8abbeda0356 | 4a578cdd7eb6e3220d2caef6e2b22c49e4620e3d | refs/heads/master | 2021-01-01T04:26:30.026096 | 2016-05-10T04:10:45 | 2016-05-10T04:10:45 | 58,429,000 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 324 | cpp | Fibonacci.cpp | #include <iostream>
#include<conio.h>
using namespace std;
int f(int o){
int s,a=0,b=1,c=1;
while(c<=o){
s=a+b;
a=b;
b=s;
c++;
}
return s;
}
int main(){
int s,o;
cout<<"Posicion: ";cin>>o;
s=f(o);
cout<<"La serie va en :"<<s<<endl;
cout<<" Presione una tecla para salir";
getch();... |
45df26106f2eaf8086be75eff545f187fb8575d7 | acb84fb8d54724fac008a75711f926126e9a7dcd | /codeforces/705/D[ Ant Man ].cpp | 021fa7710dd57afd58a4e879f37bf6e9b47d46b1 | [] | no_license | zrt/algorithm | ceb48825094642d9704c98a7817aa60c2f3ccdeb | dd56a1ba86270060791deb91532ab12f5028c7c2 | refs/heads/master | 2020-05-04T23:44:25.347482 | 2019-04-04T19:48:58 | 2019-04-04T19:48:58 | 179,553,878 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,712 | cpp | D[ Ant Man ].cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long LL;
#define int long long
int n,s,e;
int x[5005],a[5005],b[5005],c[5005],d[5005];
LL dp[5005][5005];
LL inf;
signed main(){
scanf("%I64d%I64d%I64d",&n,&s,&e);
for(int i=1;i<=n;i++) scanf("%I64d",&x... |
4af4aad0a0b5d51535f2d3a898f289868dec2274 | bd95293502da63e754234efebab66569f127f9e6 | /Tree/Easy/538. Convert BST to Greater Tree.cpp | 1c45653557cfa314bbb10aee6fc51c6cbb2686dc | [] | no_license | TCODeva/Algorithms | 2444cfe5a1158303ffa1c6e37eee14c3b9a924de | 41183e9849df676d04177b2f4659143392ccd06f | refs/heads/master | 2021-06-17T15:37:39.812306 | 2019-08-23T02:22:53 | 2019-08-23T02:22:53 | 138,134,788 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,742 | cpp | 538. Convert BST to Greater Tree.cpp | /* LeetCode 538. Convert BST to Greater Tree
* Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
*
* Example:
*
* Input: The root of a Binary Search Tree like this:
* ... |
7b290685ae4cd46ad1c1c64a4291129c7f55cb57 | 385cfbb27ee3bcc219ec2ac60fa22c2aa92ed8a0 | /ThirdParty/fbxsdk/2009.3/include/fbxfilesdk/kfbxmodules/kfbxplugin.h | d21ba031e99e46cc73d19232afbb382c6c6e403f | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | palestar/medusa | edbddf368979be774e99f74124b9c3bc7bebb2a8 | 7f8dc717425b5cac2315e304982993354f7cb27e | refs/heads/develop | 2023-05-09T19:12:42.957288 | 2023-05-05T12:43:35 | 2023-05-05T12:43:35 | 59,434,337 | 35 | 18 | MIT | 2018-01-21T01:34:01 | 2016-05-22T21:05:17 | C++ | UTF-8 | C++ | false | false | 8,272 | h | kfbxplugin.h | #ifndef FBXFILESDK_KFBXMODULES_KFBXPLUGIN_H
#define FBXFILESDK_KFBXMODULES_KFBXPLUGIN_H
/**************************************************************************************
Copyright (C) 2001 - 2006 Autodesk, Inc. and/or its licensors.
All Rights Reserved.
The coded instructions, statements, computer programs,... |
d4965f49f8f77fc55381cbdd52632cffcc3b127c | e8bd2e42949f26afc319d6573ce84dcc1703ba5d | /src/Buff.cpp | c1a7cd0b50218d9513e9e70016745a77b91a7c17 | [] | no_license | mxmanseven/YoYoDaq | c1c47df879b6b79878b9567e724e09f9f5042c14 | fc4d33de9c771e1682da1f42a3a38ba6c29ac905 | refs/heads/master | 2023-04-19T04:42:13.868578 | 2021-04-30T23:00:35 | 2021-04-30T23:00:35 | 253,975,193 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,568 | cpp | Buff.cpp | #include "Buff.h"
String SampleToString(Sample sample) {
return String(sample.mills)
+ "\t" + String(sample.sample)
+ "\r\n";
}
Buff::Buff() {
aHead = 0;
aTail = 0;
aIsFull = false;
bHead = 0;
bTail = 0;
bIsFull = false;
}
int Buff::Push(Sample value, bool& is... |
6fbfc34fc4cdecceb0e5628d5ad16aa709171bc8 | 651c85f8d1b2fe0d19caccfa1446bc0bc8766a93 | /src/app_thread.cpp | b9ed0901af87650e13c2e555c88ddaa2837271cc | [] | no_license | AlexMax/lyirc | 7a4bba18beeacabbd26a9f9890558a26074b5d8c | 68da2d1406523e6717b4ee87ab504e86223b20fb | refs/heads/master | 2021-05-07T06:26:19.042447 | 2017-11-23T03:41:01 | 2017-11-23T03:41:01 | 111,758,665 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 517 | cpp | app_thread.cpp | #include "app_thread.h"
#include <asio.hpp>
AppThread::ExitCode AppThread::Entry() {
asio::io_service service;
// Resolve an IRC server
asio::ip::tcp::resolver resolver(service);
asio::ip::tcp::resolver::query query("irc.zandronum.com", "6667");
resolver.async_resolve(query, [](auto error, auto i... |
911972af03a968f3f0abc46de3872769a70869be | 8b4de051ad8c265d36433f795fb98b388495e9d4 | /Stratum/StSerialization/JsonSpaceItem2dSerializer.cpp | c82ecfcd9d8113999638e5a4c07d6dc16b37ad12 | [] | no_license | RamizJ/Stratum | 138494d1915873b606ebf1f50bdb34715f64f12b | e392ba9455efe8d1624d2a14a9a89038113433c1 | refs/heads/master | 2022-12-10T05:21:13.967757 | 2020-08-21T20:57:37 | 2020-08-21T20:57:37 | 289,362,616 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,192 | cpp | JsonSpaceItem2dSerializer.cpp | #include "JsonSpaceItem2dSerializer.h"
#include <SpaceItem.h>
using namespace StData;
namespace StSerialization {
JsonSpaceItem2dSerializer::JsonSpaceItem2dSerializer() :
JsonSpaceItemSerializer()
{}
QJsonObject JsonSpaceItem2dSerializer::serialize(SpaceItem2d* spaceItem2d)
{
QJsonObject result = JsonSpace... |
3d1ad0be00ed7bcead12eec4687a1db15cdaabb0 | 7e48d392300fbc123396c6a517dfe8ed1ea7179f | /RodentVR/Intermediate/Build/Win64/RodentVR/Inc/Engine/CurveLinearColorAtlas.gen.cpp | 2ac0e9a5bad4e5d9ad035a076fc54068eac157ec | [] | no_license | WestRyanK/Rodent-VR | f4920071b716df6a006b15c132bc72d3b0cba002 | 2033946f197a07b8c851b9a5075f0cb276033af6 | refs/heads/master | 2021-06-14T18:33:22.141793 | 2020-10-27T03:25:33 | 2020-10-27T03:25:33 | 154,956,842 | 1 | 1 | null | 2018-11-29T09:56:21 | 2018-10-27T11:23:11 | C++ | UTF-8 | C++ | false | false | 13,742 | cpp | CurveLinearColorAtlas.gen.cpp | // Copyright Epic Games, Inc. All Rights Reserved.
/*===========================================================================
Generated code exported from UnrealHeaderTool.
DO NOT modify this manually! Edit the corresponding .h files instead!
========================================================================... |
dbcdc83d19d3cf942c0ae7e66dc9a4fd5bcbd1be | f84a306a523cce262c5e6a8347046dc9c71cd9bb | /com/mainwindow.h | b07bfca1a26ad15ed356055c173b68c4cb8afc79 | [] | no_license | zhangjingbo123/Qt_Uart | bd9ffd80402ed6348495834447194f8913808760 | 60b3b158d09db8943851ef8c9aa29731f0440ef3 | refs/heads/master | 2023-02-24T22:53:08.301836 | 2021-01-31T03:32:54 | 2021-01-31T03:32:54 | 334,559,246 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,346 | h | mainwindow.h | #ifndef MAINWINDOW_H
#define MAINWINDOW_H
#include <QMainWindow>
#include <QTimer> //定时器相关库
#include <QMovie>
#include <QSerialPort> //提供访问串口的功能
#include <QSerialPortInfo> //提供系统中存在的串口的信息
#include <advanced.h>
#include "database.h"
namespace Ui {
class MainWindow;
}
class MainWindow : public Q... |
309767d10331ca6be8722f7b7ac346ebfb72ef56 | 6b550d3d0b182bcddda1f0a175d6b6cd07b60fb3 | /logdevice/server/admincommands/InfoGossip.h | 617014a8e22336180614c2f8681195cc3b03dc20 | [
"BSD-3-Clause"
] | permissive | Rachelmorrell/LogDevice | 5bd04f7ab0bdf9cc6e5b2da4a4b51210cdc9a4c8 | 3a8d800033fada47d878b64533afdf41dc79e057 | refs/heads/master | 2021-06-24T09:10:20.240011 | 2020-04-21T14:10:52 | 2020-04-21T14:13:09 | 157,563,026 | 1 | 0 | NOASSERTION | 2020-04-21T19:20:55 | 2018-11-14T14:43:33 | C++ | UTF-8 | C++ | false | false | 4,812 | h | InfoGossip.h | /**
* Copyright (c) 2017-present, Facebook, Inc. and its affiliates.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#pragma once
#include <folly/json.h>
#include "logdevice/common/NodeID.h"
#include "l... |
56fd5317ffc87912c66b36a58849591ba9d5e25a | d328d1aea80afd6599020542a97d5291dd40405d | /include/Core/Bindings/obe/Audio/Exceptions/Exceptions.hpp | 3b765608a6d1c1125e52988a6d9f34801afabafe | [
"MIT",
"BSD-2-Clause",
"Zlib"
] | permissive | PierrickLP/ObEngine | 69a73cca18f66c724744d8303eaf0020574a88c3 | 337ad3c62e66e9cf71876c277692216edfe58493 | refs/heads/master | 2022-12-24T09:55:40.074207 | 2020-10-07T15:03:34 | 2020-10-07T15:03:34 | 106,604,958 | 1 | 0 | MIT | 2019-10-02T16:04:53 | 2017-10-11T20:19:50 | C++ | UTF-8 | C++ | false | false | 171 | hpp | Exceptions.hpp | #pragma once
namespace sol
{
class state_view;
};
namespace obe::Audio::Exceptions::Bindings
{
void LoadClassAudioFileNotFound(sol::state_view state);
}; |
5e0b43532bdb6b3fce2b304acaf096c8f08431cc | 3be55f50f2fafe702f862d194cf6399db42d6e5e | /Program 3/Tree.cpp | ab40ccf42bbc9c9db6dccdc9da02676dd861f6bd | [] | no_license | xcaracal/CS14 | 46cb5857543ff25c08d3d08343eb24ce53caf2d6 | 502c23218e5597a2dafac3049873864107c6d466 | refs/heads/master | 2021-03-13T18:54:45.598276 | 2020-04-08T06:28:49 | 2020-04-08T06:28:49 | 246,701,919 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 21,590 | cpp | Tree.cpp | //
// Created by hoang on 2/23/2020.
//
#include <string>
#include <iostream>
#include "Tree.h"
//public:
Tree::Tree()
{
root = nullptr;
}
Tree::~Tree()
{
destruct(root);
}
void Tree::insert(const string& data)
{
if (root == nullptr)
{
root = new Node(data);
retur... |
dae7c523f81db36ec53cf9294752e2cd212225ea | a0e5492c89cc242548ef4ecbb66cb2d276e16d8c | /raytracing/camera.h | 5d4fe1aca6411bdc5f4f22a2e6212b3b816d632d | [] | no_license | john27328/raytracing | 7c1e581211eda2b85b154fd81ec07ebffefc9526 | 37575255b5ebd804ffdd2540fc181b7b3453eaeb | refs/heads/master | 2020-08-27T07:51:14.489465 | 2019-11-07T08:28:47 | 2019-11-07T08:28:47 | 217,289,593 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 373 | h | camera.h | #ifndef CAMERA_H
#define CAMERA_H
#include "vector.h"
#include "screen.h"
#include "edge.h"
template <typename T, int N>
class Camera: public Edge<T, N>
{
public:
Camera(Vector<T> p0, Vector<T> direction, ScreenSPtr &screen);
private:
Vector<T> _p0;
Vector<T> _direction;
T _fullAbgle;
... |
8f32bb241f8a5b8e15a6b6d41bfe5e00eea1047d | cf0bf9a7ea2eeb77ef732562f71741b31f53185f | /Exercicios/bissexto.cpp | 1609ea97e77e1307d59f856cc5ccccb68a003e60 | [] | no_license | MarcosF19/Linguagem-C-plus-plus | ee95c5bf0d0eac9fa394fb4103ac2e3812119df7 | bef69bf4315a79eb571bd599822674e76abed8d9 | refs/heads/main | 2023-05-23T13:53:08.152803 | 2021-06-18T00:07:20 | 2021-06-18T00:07:20 | 349,216,318 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 754 | cpp | bissexto.cpp | #include <iostream>
#include <cstdlib>
#include <math.h>
#include <string>
using namespace std;
int ano, tecla, MR;
string status = "";
int main()
{
setlocale(LC_ALL, "Portuguese");
Menu:
cout << "\n1 Executar...";
cout << "\n2 Finalizar...";
cout << "\n3 Item ";
cin >> tecla;
switch (tecla... |
48e6bf0cba0855b4103a4312529a4fddc5cb0a8c | 3a7186b7b54e4434d2cadaa9593ead85817961c2 | /functionBeforeMain.cpp | ca7bc1dda208f18c2d8633195a54c74046b07636 | [] | no_license | kumar0908/Object-Oriented-Programming-using-C- | 9f5b19e46acced5e48a46692db4aaf2aefb6c36e | ccde7a975eb6003ca287f552ddbf599eb997c107 | refs/heads/main | 2023-02-04T09:52:48.816851 | 2020-12-29T09:27:55 | 2020-12-29T09:27:55 | 321,666,988 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 323 | cpp | functionBeforeMain.cpp | #include<iostream>
int function()
{
std::cout<<"We are calling it before main!!"<<std::endl;
return 5;
}
class Base{
public:
static int variable;
};
int Base::variable = function(); // function will get called
int main()
{
std::cout<<"Inside main!!!"<<std::endl; // it will get printed at the end.
return 0... |
ac4d78a14649594bafc3a1c7fda9e3d455c51b0d | a3a98a214adf107f593ad40622178e9934a2fde0 | /src/bovil/algorithms/machine_learning/Regression.h | 67d6858523c41b14515a4541a8b88e373d48e759 | [] | no_license | Bardo91/BOVIL | 3af0217d758e7aa68608319dd912ec0ddbbaf677 | 968d618d403a080f68d99cacfee7d9a8da452b1a | refs/heads/master | 2019-07-13T04:31:05.478486 | 2016-02-17T00:33:32 | 2016-02-17T00:33:32 | 16,981,627 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,046 | h | Regression.h | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// BOViL: Bardo Open Vision Libraries
//
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
#ifndef _BOVIL_ALGORITHMS_MACH... |
493bd5171cc68e9b4a60fb0dfc8f83643dfbf452 | 0b08351f1ec3c84a5a21b0cecb5d00afdb0ff798 | /listas/exercicio 7/include/Jogador.h | a761214294a4700a47e9b10bdb28a4261757189a | [] | no_license | linguagemprogramacao/exercicios | a0170b61280c199dbf276362dcc8d0243076e21a | dd8c350ed312afeeece5d0c9e01f7e77f267ea0f | refs/heads/master | 2020-03-28T13:22:43.377793 | 2019-02-22T20:00:45 | 2019-02-22T20:00:45 | 148,389,933 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 435 | h | Jogador.h | #ifndef JOGADOR_H
#define JOGADOR_H
#include "Cartela.h"
#include <string>
#include <iostream>
using namespace std;
class Jogador {
private:
string nome;
Cartela cartelas[5];
int qntCartelas = 0;
public:
int getQntCartelas();
Jogador();
Jogador(string nome, int qntCartelas);
bool verificarCartel... |
7b4bce0e787f96557347cef9c75ed806bfb9e83c | 742d18f098742b1808f4dc7807c563369f1cef5c | /C++/BehaviorTree/Variable.h | 65be74266d60c91cfc6eae84e4a4f21acfba313f | [] | no_license | zh880517/BehaviorTree | fc577b91c32f8c484b05b80239c7e9e293aad40c | e2aa92ea82684d047256822fd8aefe4ab3b35175 | refs/heads/master | 2020-04-17T16:44:03.370452 | 2019-01-29T11:28:04 | 2019-01-29T11:28:04 | 166,752,950 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 282 | h | Variable.h | #pragma once
class IVariable
{
public:
IVariable() = default;
};
template<class T>
class TVariable : public IVariable
{
public:
TVariable() = default;
~TVariable() = default;
TVariable(TVariable&) = delete;
TVariable &operator=(const TVariable &) = delete;
T Value = {};
}; |
1971e3d74e129f4b44a3218393a989d8c232c2de | cd8c7913735a1e66ef3522aa8be9c28ae065f41a | /CanNotOpenLvlException.cpp | 48a96752eb77c81d1ba70dd14606aa3fc853b4f9 | [] | no_license | epikur90/towerdef | b4c61f593418101c8c5944c90e5e0417422d5bca | 3d2d7c8e6868ae7927b86a093987c1bf2fa74a59 | refs/heads/master | 2020-04-05T23:20:33.269623 | 2014-06-11T06:09:08 | 2014-06-11T06:09:08 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 526 | cpp | CanNotOpenLvlException.cpp | //------------------------------------------------------------------------------
/// Filename: CanNotOpenLvlException.cpp
/// Description: TODO
/// Authors: Tutors
/// Group: 00 Tutor all
/// Latest Change: 15.04.2011
//------------------------------------------------------------------------------
#include "CanNotOpe... |
98fd94e1d6cb935898288981bf08c533354ad672 | b5148313edb5d1de3ef8287812ed578d5b85d220 | /nodeMcu/nodeMcu.ino | 241fd2d3cf9acfa1fbe0dc9b39858efedb59bd4c | [] | no_license | Aakashko/Rover | 5a4d7449c5aa9c801b86e7968b3226a1c46f0fa9 | d48054ec9c775998e6bb1f9cd5a80a3977832ec3 | refs/heads/master | 2021-02-18T10:58:41.566425 | 2020-02-17T13:40:34 | 2020-02-17T13:40:34 | 245,188,537 | 1 | 0 | null | 2020-03-05T14:44:24 | 2020-03-05T14:44:23 | null | UTF-8 | C++ | false | false | 2,138 | ino | nodeMcu.ino | /*
This sketch demonstrates how to set up a simple HTTP-like server.
The server will set a GPIO pin depending on the request
http://server_ip/gpio/0 will set the GPIO2 low,
http://server_ip/gpio/1 will set the GPIO2 high
server_ip is the IP address of the ESP8266 module, will be
printed to S... |
5a3abaea5859d26c63986216eb63d83d61df68d0 | 59eafae3bc4d13b9844c47d2e12aaa2b04fb6da0 | /yukicoder/1308.cpp | 522fc3f5c923ac98aba60243dff716a055ab08cb | [] | no_license | pes-magic/procon | 004d7cd877e1cb56fea8d4b8b6cc8ba564a93a29 | 7afd1564b9228144d53920cc8e6a91012144b530 | refs/heads/master | 2023-08-31T17:29:06.829263 | 2023-08-25T12:32:27 | 2023-08-25T12:32:27 | 228,394,327 | 3 | 0 | null | 2023-08-24T11:48:04 | 2019-12-16T13:33:20 | Jupyter Notebook | UTF-8 | C++ | false | false | 1,987 | cpp | 1308.cpp | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N, Q;
long long C;
while(cin >> N >> Q >> C){
vector<vector<pair<int, long long>>> g(N);
for(int i=0;i<N-1;i++){
int u, v, l; cin >> u >> v >> l;
g[u-1].emplace_back(v-1, l);... |
7eb36464a053349e0a90615913a5fb97a274de71 | 5550fdaf7a228386ee07b9fd686259a68944ba90 | /PAT/advanced/A1009.cpp | a80baf0ab5a574bdc5ca167949888cd73ced014c | [
"MIT"
] | permissive | sptuan/LeetCode-Practice | bdc2e0189e010f7de18fe322aef089d7989d5fcf | 68e1ca329190264fdeeef1a2a1d4c2a56caa27f6 | refs/heads/master | 2023-02-25T02:03:11.030407 | 2021-01-31T06:29:37 | 2021-01-31T06:29:37 | 153,608,566 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,195 | cpp | A1009.cpp | #include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main(int argc, char** argv) {
int K1,K2;
int i,j;
double ans[2020];
for(i=0;i<2020;i++){
ans[i] = 0;
}
cin>>K1;
double a1[1010];
for(i=0;i<1010;i++){
a1[i] = 0;
}
for(i = 0; i < K1; i++){
int N;
double a;
... |
ea49466624ee0f66d78a95ebb93200bacf00c0ba | 772f27c0c7e3f2df230736d3259c1a831994a887 | /src/mdp/learning/reinforcementLearning/reinforcedLearning.cpp | bc32598a8446d4c837f5cfeebf1aa43bd1bce6c6 | [
"BSD-3-Clause"
] | permissive | Jacques-Florence/schedSim | 04008b2da3495a4f213d9e89fb03a85ccc8e16c1 | cd5f356ec1d177963d401b69996a19a68646d7af | refs/heads/master | 2021-05-07T17:48:43.879031 | 2017-11-27T01:02:08 | 2017-11-27T01:02:08 | 108,736,406 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,521 | cpp | reinforcedLearning.cpp | /**
* Copyright 2017 Jacques Florence
* All rights reserved.
* See License.txt file
*
*/
#include "reinforcedLearning.h"
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <fstream>
#include <memory>
#include <stdexcept>
#include <vector>
#include <utils/randomGenerator.h>
#in... |
8a59948e84fe6209ad14446b451806fb0d312c42 | 14dacc389911c4aba0bb42b3f01df75dbba2ad38 | /ch19/stack-assignment.cpp | 468479ac7fdf491b6d75c657e8c093e669b8082d | [] | no_license | RaymondSHANG/cpp_from_control_to_objects_8e | 9fe5142c6a7890743ffdc4a22f7ae4f8bb588c60 | ba537974d5d7b7012ae659368f1887f739e50c3b | refs/heads/master | 2023-04-17T06:20:55.635444 | 2021-04-16T01:22:13 | 2021-04-16T01:22:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,029 | cpp | stack-assignment.cpp | /*Write a function that takes a string parameter and determines whether the string
contains matching grouping symbols. Grouping symbols are parenthesis ( ) ,
brackets [] and curly braces { }. For example, the string {a(b+ac)d[xy]g}
and kab*cd contain matching grouping symbols. However, the
strings ac)cd(e(k, xy... |
65c7d33b1c7c3602dca060a897046dee098d8d81 | d839ef7211c25a5a447ddaafeade13677512fc48 | /301-400/395_Longest_Substring_with_At_Least_K_Repeating_Characters.h | 6a72dccaf378a07d89c68dd27256d91b04ef5cb2 | [] | no_license | RiceReallyGood/LeetCode_Revise | 3d1a5546df7abd234d3db652e1e4720812497d14 | db9133f40a579850abc94f74d0d7c10af1193c70 | refs/heads/master | 2023-03-01T03:59:31.700854 | 2021-02-10T13:12:29 | 2021-02-10T13:12:29 | 318,096,813 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,516 | h | 395_Longest_Substring_with_At_Least_K_Repeating_Characters.h | #include <string>
#include <unordered_map>
#include <vector>
using namespace std;
class Solution {
public:
int longestSubstring(string s, int k) {
int maxlen = 0;
for(int i = 0; i < s.length(); i++){
int count[26] = {0};
for(int j = i; j < s.length(); j++){
i... |
cb84a04349a5d1398df62ae33205bedc5406c3de | a5f717f4cab2664a4df521d5357f243a60a33452 | /random/random.cpp | 9a5c1d7abc60878508c17925723114ebcb76c913 | [] | no_license | dinulichess/fire | 9120438bd2a89b20051f229ea24f0b9d33e77f00 | 590a2b6d293f9fb44a6f2ea01047d215213f24a9 | refs/heads/main | 2023-04-21T06:47:45.323034 | 2021-04-27T22:16:53 | 2021-04-27T22:16:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,011 | cpp | random.cpp | #include <random>
#include "../position.h"
#include "../movepick.h"
#include "../pragma.h"
#include "../util/util.h"
// use uniform_real_distribution to generate all possible value and avoid statistical bias
void random(position& pos) {
int num_moves = 0;
// find & count legal moves
for (const auto& m : legal... |
e4f87be2bba475442ca310242a636147e5bba284 | b28cb3b39f60d0a5e34f796d5b2199bc9ff8efd2 | /Vectores_Guia_13/Vectores4.cpp | f65c4af22327160ed81a152b6fe77892a8924d6c | [] | no_license | otto-krause/Ascencios_Alexis_Guia_13 | 96aee8868be30540bb6d6b475ffb0415928f81b0 | c74f1deca0e115127603795e91bd59e651fa05f8 | refs/heads/main | 2023-02-07T08:54:54.319174 | 2020-12-11T17:16:05 | 2020-12-11T17:16:05 | 314,381,312 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 328 | cpp | Vectores4.cpp | #include <stdio.h>
#include <stdlib.h>
int main()
{
int a,promgen,alumnos[30];
int i=1;
for (a=0;a<30;a++)
{
printf("Ingrese las notas del %d alumno ", i);
scanf("%d",&alumnos[a]);
i++;
promgen=promgen+alumnos[a];
}
promgen=promgen/30;
printf("\n El promedio es %d",promgen);
return 0... |
bce0ca7134ce7a9fcb831626fc49996bd11c5d28 | 95b9d429360f115c3c4f85412ad524aaa0ecef91 | /Homework/Assignment2/Sem_V3/Variable.h | 1dce5ec602c35752e6ce807369df407e7a8b4e21 | [] | no_license | adaviloper/COSC3360 | a5a793ad07e06f4f6f880fd3d70d439fd4de784b | 7aa5984725310487773c93e2de1b29a542b22900 | refs/heads/master | 2021-09-01T12:21:20.492968 | 2017-12-27T00:33:15 | 2017-12-27T00:33:15 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 236 | h | Variable.h | //
// Created by hackeysack09 on 11/5/2016.
//
#ifndef SEM_V3_VARIABLE_H
#define SEM_V3_VARIABLE_H
#endif //SEM_V3_VARIABLE_H
#include <string>
#include <iostream>
using namespace std;
struct Variable {
int value;
string name;
}; |
bbdbd05c9d1989f7a1879c38d8dbf2bc7b848b5b | 78ce6ae9db3a8fa0ef765b011916e314287d891c | /lander.cpp | 5950363fc48512dbc101e72a756b529a1d6416af | [] | no_license | lucicd/moonLander | 488a473776d860627b6b03877cbfc54ebad64e72 | 7b649e2b428576bacee7238a3b4f07b0296007c3 | refs/heads/master | 2020-05-29T13:13:28.005811 | 2019-06-07T08:10:52 | 2019-06-07T08:10:52 | 189,152,771 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,264 | cpp | lander.cpp | /***********************************************************************
* Implementation File:
* LANDER : A class representing a lunar lander
* Author:
* Drazen Lucic
* Summary:
* Everything we need to know about a lunar lander including
* the location, velocity, fuel level, and status (landed, aliv... |
724a7893bebc6c901d9d14073ed91d2f629d6487 | 8758abed02380e64a6e5c49b8cb6d133455a384d | /search-step.cpp | 1f99a817de22a5ecd4e8329ecfa8403b964590ed | [
"MIT"
] | permissive | st34-satoshi/quixo-cpp | c413e8b943aac0f6beff596e08d3133a16e8c3bb | 9d71c506bea91d8a12253d527958ac0c04d0327e | refs/heads/master | 2023-08-03T18:03:27.849305 | 2021-09-17T16:24:53 | 2021-09-17T16:24:53 | 229,896,760 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,727 | cpp | search-step.cpp | /**
* after computing all states value, compute the step to win.
* the winner tries to win in minimum steps.
* the loser tries to lose in max steps.
*
*/
#include "state.cpp"
const int DEFAULT_STEP = 200; // TODO: select the good number
void init(){
createCombinations();
initState();
initMovingMask... |
5a9c627ab50020fdb6b1be336d32c2f38cd31322 | 0810b81ad0b59c59de1cd50c279ecf7d79c24ecb | /src/file/file.cpp | 722fecd6acbdb226b53c8ab0827f5c3ece3d243d | [] | no_license | fwindolf/cuda-image | be11fe59e6e476f46a3f3ec0167dafb1a5cae0d8 | c3cc2d1b815e45c56edbd7af8d42dc38fe42957f | refs/heads/master | 2020-05-19T01:31:40.252967 | 2020-01-05T15:57:45 | 2020-01-05T15:57:45 | 184,758,389 | 2 | 1 | null | 2019-06-19T14:08:15 | 2019-05-03T13:17:41 | C++ | UTF-8 | C++ | false | false | 3,624 | cpp | file.cpp |
#include "cuimage/file/file.h"
#define TINYEXR_IMPLEMENTATION
#include "tinyexr.h"
#include <iostream>
using namespace cuimage;
cv::Mat File::_readExr(const std::string& fileName)
{
EXRVersion exr_version;
std::vector<float> image;
int ret = ParseEXRVersionFromFile(&exr_version, fileName.c_str());
... |
5b24ed906d0df4e70234bfde8694606408e15a6e | 0d1398465317a035399215f7bd67f7257da983ff | /SNAP/Logic/LevelSet/SNAPAdvectionFieldImageFilter.h | cbe55348fa9f21d146c3a8e6ef20f5eb9d0de17d | [] | no_license | mxgbs/ITKApps | 9d0ef50fa3bfde2a4980e10dc9a11717b2158be6 | 568518371f0822abebfca763ebee2ba3ff97251d | refs/heads/master | 2021-01-18T04:37:28.750169 | 2014-10-28T13:17:05 | 2014-10-28T13:17:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,028 | h | SNAPAdvectionFieldImageFilter.h | /*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: SNAPAdvectionFieldImageFilter.h
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) 2003 Insight Consortium. All rights reserved.
See ITKCopyright... |
6393f107ac0eef6964fd89f23808f86fe8490929 | 2d468433f1ecd2f0650bef8a5ee3b16460692097 | /src/lib/utils/plugin_manager.hpp | e1ce2bfc59f22ca8080eaa37273eb3f11bacb4f0 | [
"MIT"
] | permissive | hyrise-mp/hyrise | 6819d45fa68f167a9d32c3351e83b1dc33ee9537 | cefb5fb70dfc0a6e43f35d7dd098d7ac703d4602 | refs/heads/master | 2020-05-26T22:18:15.914031 | 2019-06-04T12:10:34 | 2019-06-04T12:10:34 | 188,396,488 | 2 | 0 | MIT | 2019-06-04T12:10:36 | 2019-05-24T09:46:14 | C++ | UTF-8 | C++ | false | false | 1,579 | hpp | plugin_manager.hpp | #pragma once
#include <filesystem>
#include <unordered_map>
#include "types.hpp"
#include "utils/abstract_plugin.hpp"
#include "utils/singleton.hpp"
#include "utils/string_utils.hpp"
namespace opossum {
using PluginHandle = void*;
using PluginName = std::string;
struct PluginHandleWrapper {
PluginHandle handle;
... |
b148a3862333d040618aa155f57aa18ef8ae4eb9 | 96ebe9f4ccba7c9fdd7acdecaa8216787598a93c | /EyerVideoWand/EyerWand/EyerWandVideoResource.cpp | db3e7f9f213e2ca696813f43de4fb8493ed12150 | [] | no_license | yinhuiyao11/EyerVideoWand | 51552599311cb57bae498bd27f7b6afcb1de597b | 6c9b177f5dd8afc46ead980ff4a648531df6ae59 | refs/heads/master | 2023-01-02T23:46:21.247705 | 2020-04-09T13:12:56 | 2020-04-09T13:12:56 | 238,478,033 | 0 | 0 | null | 2020-11-05T03:08:31 | 2020-02-05T15:06:10 | C++ | UTF-8 | C++ | false | false | 2,251 | cpp | EyerWandVideoResource.cpp | #include "EyerWand.hpp"
namespace Eyer
{
EyerWandVideoResource::EyerWandVideoResource()
{
}
EyerWandVideoResource::~EyerWandVideoResource()
{
for(int i=0;i<decoderLineList.getLength();i++){
EyerVideoDecoderLine * decoderLine = nullptr;
decoderLineList.find(i, decod... |
d51acd093d964281bc01f2479d7cc39593894adc | 675b48fea07692e7e4f709660af33261ba212711 | /代码1/IOCPserver/IOCPserver/TcpSrv.h | 427e76970ddafafc1be09beaa9eb3e3b579e4e83 | [] | no_license | six-beauty/six_beauty | b939f41d64a85c9de23540c9231c1247cb546181 | 756c832f8c74412705eac3f9ededdf46e83e2fad | refs/heads/master | 2021-01-21T02:28:10.832079 | 2015-08-27T05:59:26 | 2015-08-27T05:59:26 | 25,392,927 | 0 | 1 | null | null | null | null | GB18030 | C++ | false | false | 4,497 | h | TcpSrv.h | #ifndef _TCPSRV_H
#define _TCPSRV_H
#include "StdAfx.h"
#include<vector>
#include<list>
#include <winsock2.h>
#include <MSWSock.h>
#pragma comment(lib,"ws2_32.lib")
#define SOCK_BUF_SIZE 8192
#define SERVERPORT 65001
using namespace std;
typedef enum _operation_type
{
ACCEPT_TYPE,
SEND_TYPE,
RECV_TYPE,
NULL_TYP... |
e43fb0573ece3ecfa38426e2b9c9f7dbb9959983 | b9c61af231c6dd0278e72c36abab2ddda50a4389 | /test_static.cpp | a8ec4a795238690e097c0af09186c950817cfbf7 | [
"BSD-3-Clause",
"BSD-2-Clause",
"NCSA"
] | permissive | ContinuumIO/ispc | 21e0a10d96a9e131c9947c60eec97624b657863a | f3089df0866ce8e699a6436e51f3c5534be01d7d | refs/heads/master | 2023-03-23T00:32:22.671060 | 2012-02-07T19:11:40 | 2012-02-07T19:13:32 | 3,381,232 | 4 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 5,074 | cpp | test_static.cpp | /*
Copyright (c) 2010-2011, Intel Corporation
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 co... |
054d02c40a0ce00cadeee53f8eff6c457373f68d | 4a86cf652383946f94ebae58b6c61781dc7ab2d8 | /LeetCode/234回文链表.cpp | 2bdb3e86cb9e3bde833ede2cd1d6573bc2e6debe | [] | no_license | liuyoude/My-Road-to-Algorithm | 1149144b04938af246c29269e7c8a5c7d3b8eb04 | b9016484c78b6d1558ca58072f44b45b014937db | refs/heads/main | 2023-03-14T23:25:28.782635 | 2021-03-15T12:40:19 | 2021-03-15T12:40:19 | 315,302,263 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,160 | cpp | 234回文链表.cpp | /**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
/*
解法1：利用递归得到链表的逆序遍历
*/
class Solution {
public:... |
c4367da610f5f572be809be5cb666c7a024b2ab6 | 775cde13c2acbfbd6a8857ebe3ea3c1399aecee2 | /src/programmers/Balloon.cpp | 432ba409e3c52f384d551714c525022031be3e8a | [] | no_license | goaldae/Algorithm | 1e7d4328443e2ddc42015355a68e2bb167328c7f | 2ac8cb0336012cceff9c8e747b967da7194df7fa | refs/heads/master | 2023-04-20T07:13:54.214390 | 2023-04-06T10:47:02 | 2023-04-06T10:47:02 | 167,889,230 | 0 | 0 | null | 2019-03-24T05:35:23 | 2019-01-28T02:55:13 | Java | UTF-8 | C++ | false | false | 1,146 | cpp | Balloon.cpp | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b){
return a.second<b.second;
}
int solution(vector<int> a) {
int answer = 0;
if (a.size()<=2) return a.size(); //개수가 2이하면 다 살릴수있음
answer = 2; //숫자가 3개 이상이면 최소한 ... |
31e7a682eb65f40186e7cddce5f09c9007258d93 | e07c972e474ade8bd95444df97342a47e7dcca25 | /volt_gfx/include/volt/gfx/global_events/GFXEvents.hpp | e5d56604747c5477b01b53c254932f503b9b786e | [] | no_license | SirHall/volt_gfx | bbc1f82a538ac5767a586d88c681aaf65defb3cb | 7d6827894cfe09feeb17caea1ab2e5668ae0b1da | refs/heads/master | 2022-06-27T02:37:46.458293 | 2022-05-15T21:09:14 | 2022-05-15T21:09:14 | 217,846,126 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,187 | hpp | GFXEvents.hpp | #pragma once
#ifndef VOLT_GFX_GLOBAL_EVENTS_GFXEVENTS_HPP
#define VOLT_GFX_GLOBAL_EVENTS_GFXEVENTS_HPP
#include "volt/gfx/global_events/GFXEventChar.hpp"
#include "volt/gfx/global_events/GFXEventCursorEnter.hpp"
#include "volt/gfx/global_events/GFXEventCursorPos.hpp"
#include "volt/gfx/global_events/GFXEventDrop.hpp"
... |
b783059550b1f0a9751827f45827b7d0046ca02f | e3815d7ba7825e4e2e6bc81068d623c1cba53a40 | /src/util/Async.hh | 9b9f3e5578d1e39656fdb4a2bf43fbdc4f982126 | [
"Apache-2.0"
] | permissive | couchbaselabs/BLIP-Cpp | 22e4873a708b6b8b85c3b5d75d49b590d30d068a | a614b936d2e2561e430b3c9a22ba23c1d272722b | refs/heads/master | 2023-09-06T05:13:27.721744 | 2022-03-09T03:53:51 | 2022-03-09T03:53:51 | 81,492,638 | 17 | 5 | Apache-2.0 | 2020-03-03T02:46:29 | 2017-02-09T20:38:09 | C++ | UTF-8 | C++ | false | false | 13,109 | hh | Async.hh | //
// Async.hh
//
// Copyright © 2018 Couchbase. 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 require... |
3bbc178c51cabd05a68c0cab649c810f7e5437d1 | b69a21b62bcdab75ab24264b3354a1947acf5e6f | /client/clickedlineedit.cpp | 69a0152d6f9ba3bf66faea85c8beb83272dd815c | [
"CC-BY-4.0",
"MIT"
] | permissive | aernesto/moodbox_aka_risovaska | 97ee1127e1ed7a2ddcc85079cab15c70b575d05f | 5943452e4c7fc9e3c828f62f565cd2da9a040e92 | refs/heads/master | 2021-01-01T17:17:39.638815 | 2012-02-28T15:31:55 | 2012-02-28T15:31:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 308 | cpp | clickedlineedit.cpp | #include "clickedlineedit.h"
namespace MoodBox
{
ClickedLineEdit::ClickedLineEdit(QWidget *parent)
: QLineEdit(parent)
{
}
ClickedLineEdit::~ClickedLineEdit()
{
}
void ClickedLineEdit::mousePressEvent(QMouseEvent * event)
{
QLineEdit::mousePressEvent(event);
selectAll();
}
} |
ec65e6488abc1983f171cb89add63c103e048ca7 | 80c585608b7bb36ef5653aec866819e0eb919cfa | /src/MobileTest/src/TestScopedLock.cpp | bd1b2808e6a6fbff2d47768180a78349e20e2ac6 | [] | no_license | ARLM-Attic/peoples-note | 109bb9539c612054d6ff2a4db3bdce84bad189c4 | 1e7354c66a9e2b6ccb8b9ee9c31314bfa4af482d | refs/heads/master | 2020-12-30T16:14:51.727240 | 2013-07-07T09:56:03 | 2013-07-07T09:56:03 | 90,967,267 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 757 | cpp | TestScopedLock.cpp | #include "stdafx.h"
#include "ScopedLock.h"
#include "Test.h"
struct Context
{
int marker;
CRITICAL_SECTION section;
};
DWORD WINAPI ScopedLockThread(void * param)
{
Context * context(reinterpret_cast<Context*>(param));
ScopedLock lock(context->section);
context->marker = 1;
... |
e6314d80fcde98b8308e218efce711852ec1f272 | 46d056a4f9f2b0c0c642bc9f78a43e77ed46fb43 | /trail.cpp | b1a5fd052c845425e885c9c78aa421e4920b4089 | [] | no_license | jiselectric/leet-code-solutions | 036c30b6383312dd08031461ff8cd78340744b23 | 8936f9e37c57f065581daffe5af584d6320cbe35 | refs/heads/master | 2021-06-22T00:16:32.167519 | 2021-01-21T09:23:57 | 2021-01-21T09:23:57 | 177,428,908 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 326 | cpp | trail.cpp | #include <iostream>
#include <math.h>
using namespace std;
int N;
int fives = 5;
int division = 1;
int answer = 0;
int main()
{
cin >> N;
while(division > 0)
{
division = floor(N / fives);
answer = answer + division;
fives = fives * 5;
}
cout << answer;
return ans... |
58d7b694e0721cf18531e2f2d8fd7a773e0d7809 | 769b013ceceb3080af71d58a0e36c5ea846e3e95 | /payStub/main.cpp | 2066fef9d2e34eb504f98a64a85568ec0ccde793 | [] | no_license | gstrauch2/paystub | bede5abe6fb9e260403ae8929e2d1d7cb9f5866e | 9a1c1d1695c3fad956fab3c2d3b149446100ab41 | refs/heads/master | 2021-04-29T18:34:52.618587 | 2018-02-16T00:53:06 | 2018-02-16T00:53:06 | 121,695,494 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,481 | cpp | main.cpp | /* George Strauch
* formatted paystub
* formats a monthly paystub
* feb-14-2018
* */
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
string strName = "George Strauch";
double dblGross = 20000.00;
double dblFedTax = 0.0; // 15%
double dblStateTax = 0.0; // 0%
doubl... |
9c5f67cfdda8d44624834156864273138ec78798 | 1ec8fb145d9e0f228740ac78a3acd277ee2e0d2e | /1385D.cpp | 8146fdb0da2041f0b993c8996b1fb47f03e8c48b | [] | no_license | Sadik1603075/code_forces | 853aa8f827c3137c76fd4f43bba03b80544ba88f | a27e809eca383f702c48e29d9795d06d35e9b41b | refs/heads/master | 2022-11-29T05:47:03.885339 | 2020-08-09T06:47:26 | 2020-08-09T06:47:26 | 286,182,808 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 652 | cpp | 1385D.cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll arr[200003];
int main()
{
ll t,i,n,k,j;
cin>>t;
while(t--)
{
cin>>n;
for(i=1;i<=n;i++)
{
scanf("%lld",&arr[i]);
}
k = arr[n];
for(i=n-1;i>=1;i--)
{
if(... |
294c2b911a1f2110bf5be046f344471de380fb27 | 3ca6791f25d370ebfab30466e506f6d05d9ee16b | /src/RendererNotification.hpp | c711370d032a0cd0d348966fd8d1593846ff590c | [] | no_license | pderkowski/game | 2269ea31cf5455a97da99ef2f08676226f9007f2 | 995078057934b2f820d5d86a4b67a10b720efcda | refs/heads/master | 2021-05-27T18:11:23.040923 | 2014-09-13T15:57:27 | 2014-09-13T15:57:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 255 | hpp | RendererNotification.hpp | /* Copyright 2014 <Piotr Derkowski> */
#ifndef RENDERERNOTIFICATION_HPP_
#define RENDERERNOTIFICATION_HPP_
#include "SFML/Graphics/Rect.hpp"
struct RendererNotification {
sf::FloatRect displayedRectangle;
};
#endif // RENDERERNOTIFICATION_HPP_
|
e0576d059b382d78c51f38645f65fca836d7b5c5 | 6f9b4790db69ddabaf36c00b057222541463a14c | /Breakout/BoxCollider.cpp | 5a800abdc5c473bf19a4b48d3ac5390a1954c119 | [] | no_license | Glynn-Taylor/Breakout | 079e5e293f248fa049f4abb3e3c5955947a6f918 | c933af1246098c2eaad4179016efaf2834e906b1 | refs/heads/master | 2021-01-18T21:37:32.979938 | 2017-04-02T21:41:52 | 2017-04-02T21:41:52 | 87,017,949 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,993 | cpp | BoxCollider.cpp | #ifndef BOX_COLLIDER
#define BOX_COLLIDER
#include "Collider.hpp"
#include "BoxCollider.hpp"
#include "GameObject.hpp"
#include <cstdio>
//A rectangular collider that can resolve collisions with other rectangular colliders.
//Constructor
BoxCollider::BoxCollider(const float width, const float height, const float len... |
d2cacc3582a1f384036335cadb74d8c980b08f8c | ab06aa4ac12a8290b1246078f28ab540ceb9e660 | /s09e03_cpp/codigo.cpp | ef17dccc4f912155e863d99f3959e1059cd88389 | [] | no_license | flavio-barros/fup-2020.2-turma6 | add631538a60bce723099e0a1b18c8aafa7d2806 | 382c18444afe8e9727ba7d1e2543c5e3701c3fdb | refs/heads/master | 2023-03-08T11:36:27.382103 | 2021-02-23T18:37:33 | 2021-02-23T18:37:33 | 317,796,778 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 515 | cpp | codigo.cpp | #include <cstdio>
// #include <stdbool.h>
#include <iostream>
using namespace std;
string juntar(string one, string two){
return one + two;
}
int main(){
int x = 0;
float f = 0.0f;
int vet[5] = {5, 4, 3, 2, 1};
bool value = true;
(void) value;//ele nao dar warning de nao utilizada
(void) v... |
2f9c1449fbd38cb5af5fda302e88d6d51421c609 | 73266ea6be2de149a4700798b221bd4c79525604 | /CPP Modules/00/ex01/Phonebook.hpp | 73d9e0673f25c662e9d0b7e76bb76be8f790636f | [] | no_license | Caceresenzo/42 | de90b0262b573d4056102ad04ed0f6fbef169858 | df1e14c019994202da0abbe221455f1a6ee291e4 | refs/heads/master | 2023-08-15T06:14:08.625075 | 2023-08-13T17:19:00 | 2023-08-13T17:19:00 | 220,007,175 | 92 | 36 | null | null | null | null | UTF-8 | C++ | false | false | 1,356 | hpp | Phonebook.hpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Phonebook.hpp :+: :+: :+: ... |
57111357c3aac05259cbe9c1ecfc7fcd14b7e09d | 192fd8f3017356222af0b86682b64435a8e69e90 | /lab7/GroupedShapes/Picture.h | 158c8514208548d44679e749b1f989d50e553049 | [] | no_license | Tandyru/ood-labs | d5ecfe9a0169e8607f3cad8b4bea54a88c1b9ff8 | 7c9fc19599eb37014d997e5a9a0dd5439acaf4e6 | refs/heads/master | 2021-07-15T18:21:25.802606 | 2019-02-07T18:24:49 | 2019-02-07T18:24:49 | 147,715,235 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 113 | h | Picture.h | #pragma once
#include "../GroupedShapesLib/Picture.h"
#include <memory>
std::unique_ptr<CPicture> GetPicture();
|
4309cbdff8841e937f42faf4a3ea3762585c0a7e | 1dff02275f30fe1b0c5b4f15ddd8954cae917c1b | /ugene/src/plugins/biostruct3d_view/src/BioStruct3DViewPlugin.cpp | 0da77c95b19926656bbba33cf9611230c8a5458b | [
"MIT"
] | permissive | iganna/lspec | eaba0a5de9cf467370934c6235314bb2165a0cdb | c75cba3e4fa9a46abeecbf31b5d467827cf4fec0 | refs/heads/master | 2021-05-05T09:03:18.420097 | 2018-06-13T22:59:08 | 2018-06-13T22:59:08 | 118,641,727 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,522 | cpp | BioStruct3DViewPlugin.cpp | /**
* UGENE - Integrated Bioinformatics Tools.
* Copyright (C) 2008-2012 UniPro <ugene@unipro.ru>
* http://ugene.unipro.ru
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version... |
e47479e7cfa28f0dcc35193b06942878394535e3 | 1a4ca41081ec7889152912c66606747e5b03b822 | /Algorithms/SymbolicToCompare/SymbolicCode/gen3_Jc_dot.cc | ff51814d3e1d05093b4b35e6a30445efc53eebe5 | [] | no_license | yonchien/RobotDynamicsAndControl | 57df50e51f44c2124bca67141650b5c40f910843 | 4dc61cea42dabe570808b76ea20c43c4a21b7287 | refs/heads/main | 2023-07-24T09:34:29.364118 | 2021-05-04T12:27:36 | 2021-05-04T12:27:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,474 | cc | gen3_Jc_dot.cc | /*
* Automatically Generated from Mathematica.
* Fri 30 Apr 2021 09:00:25 GMT-04:00
*/
#ifdef MATLAB_MEX_FILE
#include <stdexcept>
#include <cmath>
#include<math.h>
/**
* Copied from Wolfram Mathematica C Definitions file mdefs.hpp
* Changed marcos to inline functions (Eric Cousineau)
*/
inline double Power(doub... |
0bda8dade7f9aadb734fb96c3652c36b1657e9f6 | d619fae80686082f47146413d9ef86fb2c1e322b | /Src/Modules/Perception/BallPerceptors/CNSBallPerceptor/BallPerceptor2017.h | 1bf07c4038379cbca8b0ed32f96b72c7f96dd91c | [] | no_license | Handsome-Computer-Organization/walkingEngine | ab7d4382a76d2eeb11858bab8dd063abe47c1be3 | 9fa39c9a75d7a7ea8b3b9f2526ddd2ce346b8ac5 | refs/heads/master | 2021-06-18T14:41:45.470558 | 2017-05-11T06:19:47 | 2017-05-11T06:35:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,170 | h | BallPerceptor2017.h | /**
* @file BallPerceptor.cpp
* This file declares a module that provides a ball percept of the new oficial Robocup SPL ball.
* @author Gabriel Azocar
* @author Pablo Cano
* UChile Robotics Team
*
* Partially based on B-Human's ball perceptor of the coderelease 2014
* whose authors are:
* @author Colin Graf
*... |
311bba9c79bb52e25428f099aacee0746c2f6a4c | 6b2a8dd202fdce77c971c412717e305e1caaac51 | /solutions_2453486_1/C++/Junkbot/tic.cpp | dd10a984de93abb0c8d949c58f66da84fbff377e | [] | no_license | alexandraback/datacollection | 0bc67a9ace00abbc843f4912562f3a064992e0e9 | 076a7bc7693f3abf07bfdbdac838cb4ef65ccfcf | refs/heads/master | 2021-01-24T18:27:24.417992 | 2017-05-23T09:23:38 | 2017-05-23T09:23:38 | 84,313,442 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 1,819 | cpp | tic.cpp | #include <cstdio>
const int MAX_N = 5;
int T;
int N = 4;
char board[MAX_N][MAX_N];
bool check(char target) {
// go down
for(int j=0;j<N;j++) {
bool win = true;
for(int i=0;i<N;i++) {
if(board[i][j] != target && board[i][j] != 'T') {
win = false;
br... |
7c4309de9dd0ed0f52d60cb9ded7b25888447247 | c1e10ac7a355a39067954918d62dc5f28df3f8f8 | /tutorial/ruud_van_der_pass_openmp/04_omp_methods/11_omp_get_wtick.cpp | fb06621093cd9b0502243bebaf19f110f52e6087 | [] | no_license | grayasm/git-main | be46c568c3b9edcfe9d583bac8aba1302932b0d1 | 88ef1393b241383a75ade3e8677238536fe95afa | refs/heads/master | 2023-08-05T03:49:36.674748 | 2023-08-03T14:57:55 | 2023-08-03T14:57:55 | 32,255,990 | 12 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 831 | cpp | 11_omp_get_wtick.cpp | /* double omp_get_wtick(void);
Gets the timer precision, i.e., the number of seconds between two successive
clock ticks.
*/
#include <stdio.h>
#include <omp.h>
#ifdef WIN32
#include <windows.h>
#define sleep(a) Sleep(a*1000)
#else //linux
#include <unistd.h>
#endif //WIN32
int main(int argc, char** argv)
{... |
3acb6fbc70a210cc96a6aa65c084920015ba8f9f | 4134a01c4befc9cfa56d42ee81147f861ddf3565 | /zoompangraphicsview.h | 3a333a06d452a784ebd656834d29200cc6b2abbf | [] | no_license | grefab/msa | b1119aa80c926083630a5aa6c41387fd93d83e6e | cf9793e8cdccb9d7e19ea14a147279cddcf07de3 | refs/heads/master | 2021-01-10T18:31:17.122238 | 2014-07-31T03:40:31 | 2014-07-31T03:40:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,224 | h | zoompangraphicsview.h | #ifndef ZOOMPANGRAPHICSVIEW_H
#define ZOOMPANGRAPHICSVIEW_H
#include <QGraphicsView>
class ZoomPanGraphicsView : public QGraphicsView
{
Q_OBJECT
public:
explicit ZoomPanGraphicsView(QWidget *parent = 0);
signals:
void loadFileRequest(QString filename);
void enlargeCircle();
void shrinkCircle();
... |
37869fc99b546a92e43f9a424c21b894e90cbee6 | ec728f4ddc541bba92ed1ca3cd7b091fe6f4d582 | /binarySearch.cpp | a206950ca1beb7bd71bba439adf788ecf5acd78e | [] | no_license | Ash-jo121/coding-blocks | 8488e2f1d42916626d4f3ad3eb0d9139e2e23dc4 | ad3c6600fba2dd1f54a798bbbf6499ed75a07ad7 | refs/heads/master | 2023-01-30T12:43:40.633663 | 2020-12-01T13:21:40 | 2020-12-01T13:21:40 | 262,059,033 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 749 | cpp | binarySearch.cpp | #include<bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define N 1000001
#define vi vector<int>
#define pb push_back
using namespace std;
int binarySearch(int a[], int n, int key) {
int s = 0;
int e = n - 1;
while (s <= e) {
int mid = (s + e) / 2;
if (a[mid] == key) {
return mid;
}
else if (... |
d059a9a7af962ce77ae95d0636b7c18c312dc5d8 | 010279e2ba272d09e9d2c4e903722e5faba2cf7a | /catboost/cuda/cuda_lib/fwd.h | 9e05b9f5c8a9ab0433a4abdf01147b66ba01fe46 | [
"Apache-2.0"
] | permissive | catboost/catboost | 854c1a1f439a96f1ae6b48e16644be20aa04dba2 | f5042e35b945aded77b23470ead62d7eacefde92 | refs/heads/master | 2023-09-01T12:14:14.174108 | 2023-09-01T10:01:01 | 2023-09-01T10:22:12 | 97,556,265 | 8,012 | 1,425 | Apache-2.0 | 2023-09-11T03:32:32 | 2017-07-18T05:29:04 | Python | UTF-8 | C++ | false | false | 461 | h | fwd.h | #pragma once
#include <util/generic/fwd.h>
namespace NCudaLib {
enum class EPtrType : int {
CudaDevice,
CudaHost, // pinned cuda memory
Host // CPU, non-pinned
};
}
namespace NCudaLib {
template <class T, class TMapping, EPtrType Type = EPtrType::CudaDevice>
class TCudaBu... |
2fc9da68826f48d90e52af3605be86628a6deca5 | 0f09b036d90e5a85da1856516893422c476bce46 | /Samples/DirectXA4/RenderMesh.cpp | 24bcb9610b74268466353467cfc414e3f675b66a | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | longde123/simdrast | 034aac5aca5b13c7ad332ba865f9f6bc036a992e | 9f2cbdd039fb3c7779adcc8a320d492e5db69e92 | refs/heads/master | 2016-09-05T09:09:57.641242 | 2015-05-17T11:03:08 | 2015-05-17T11:03:08 | 35,762,669 | 5 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 3,816 | cpp | RenderMesh.cpp | //
// RenderMesh.cpp
// DirectXA4
//
// Created by Rasmus Barringer on 2013-06-07.
// Copyright (c) 2013 Rasmus Barringer. All rights reserved.
//
#include "RenderMesh.h"
RenderMesh::RenderMesh(fx::Mesh* mesh) : mesh(mesh) {
for (size_t i = 0; i < mesh->textures.size(); ++i)
textures.push_back(new Texture(... |
62addd4d87ac31709e6f5681147e96e627a28555 | 4dedede14d78cc6e54c443e3f065f7d7a706f943 | /src/gui/glrand.h | d059ce41e0632ef17305ae1f687abba233084d38 | [] | no_license | se4u/manifold | 2bf01787a5c76cfee7f8c7512126e9dde8d0aa33 | dd32a9a0354eb9c90649c23cbed38e2afcc178f8 | refs/heads/master | 2020-04-12T07:06:59.869705 | 2017-04-22T02:18:09 | 2017-04-22T02:18:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 28,407 | h | glrand.h | /*
* @Author: kmrocki@us.ibm.com
* @Date: 2017-03-20 10:09:39
* @Last Modified by: kmrocki@us.ibm.com
* @Last Modified time: 2017-03-31 14:17:10
*/
#ifndef __GLPLOT_H__
#define __GLPLOT_H__
#include <nanogui/window.h>
#include <nanogui/layout.h>
#include <nanogui/glcanvas.h>
#include <nanogui/label.h>
#include <n... |
c6a0258dd46efe9c4ae167bad85bc002d1f4c558 | b1f7a2309825dbe6d5953f6582d7f442d1d40422 | /lc-cn/求众数2.cpp | 67967874bcbbba99fb9d27cde849b2ff12621367 | [] | no_license | helloMickey/Algorithm | cbb8aea2a4279b2d76002592a658c54475977ff0 | d0923a9e14e288def11b0a8191097b5fd7a85f46 | refs/heads/master | 2023-07-03T00:58:05.754471 | 2021-08-09T14:42:49 | 2021-08-09T14:42:49 | 201,753,017 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,205 | cpp | 求众数2.cpp | // https://leetcode-cn.com/problems/majority-element-ii/
/*
给定一个大小为 n 的整数数组，找出其中所有出现超过 ⌊ n/3 ⌋ 次的元素。
【笔记】摩尔投票法。
该算法用于1/2情况，它说：“在任何数组中，出现次数大于该数组长度一半的值只能有一个。”
那么，改进一下用于1/3。可以着么说：“在任何数组中，出现次数大于该数组长度1/3的值最多只有两个。”
于是，需要定义两个变量。空间复杂度为O(1)。
*/
class Solution {
public:
vector<int> majorityElement(vector<int>& nums) {
... |
7156f92cd64dfbcc6d4af8204c381b31f8581d78 | 2517065805d99cd36b5ca26d74b6691f868ad591 | /src/Ramp.cpp | 032c1c941b26cb64acce840e6a3bd9681b442a49 | [] | no_license | jsm174/vpxpp | ff8cf176ac1cf82aa81f5d2d68af9e93e62eed73 | b34eafbd58d65e8cdc8a6894a561c8d199b8fae2 | refs/heads/main | 2023-08-28T02:55:14.055079 | 2021-10-08T21:22:56 | 2021-10-08T21:22:56 | 398,131,825 | 1 | 0 | null | 2021-09-23T01:50:05 | 2021-08-20T02:27:21 | C++ | UTF-8 | C++ | false | false | 17,822 | cpp | Ramp.cpp | #include "Ramp.h"
#include "DragPoint.h"
#include "RegUtil.h"
#include "Inlines.h"
const ItemTypeEnum Ramp::ItemType = eItemRamp;
const int Ramp::TypeNameID = 145;
const int Ramp::ToolID = 146;
const int Ramp::CursorID = 150;
const unsigned Ramp::AllowedViews = 1;
Ramp* Ramp::COMCreate()
{
/*CComObject<Ramp>* obj =... |
eadc7b7c78d4b546a68a2a4b3f39d4f7a5440691 | 618a14dd17be3c4eb3b0757e8e272d6d979d898e | /PaintShooting/GamePadXInput.cpp | 1453ed0be3268b8b5a1efa00c98cb52dd4385064 | [] | no_license | koutcha/PaintShooting | 562c30e14ee4edc64923345b9f2e5c64b8b33075 | 95910929043e8d73107a92ada6e49cf605490566 | refs/heads/master | 2020-04-16T22:10:46.766583 | 2019-01-16T02:07:45 | 2019-01-16T02:07:45 | 165,956,384 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,654 | cpp | GamePadXInput.cpp | #include "GamePadXInput.h"
GamePadXInput::GamePadXInput()
{
updateState();
}
GamePadXInput::~GamePadXInput()
{
}
void GamePadXInput::updateState()
{
DWORD dwResult;
for (DWORD i = 0; i < MAX_PAD_NUMBER; i++)
{
// Simply get the state of the controller from XInput.
dwResult = XInputGetState(i, &padData[i... |
f06a12570e196fd82d5cd18ec2f030df1f39622d | 4e35423872fe989ccb1f876486b451326d89ba9a | /third_party/splinelibpy/third_party/SplineLib/Tests/ParameterSpaces/b_spline_basis_function_test.cpp | f3aac6d06e5b94555b2a051b26aebd75171e7935 | [
"MIT"
] | permissive | j042/gustav-alpha | 54efba1c60f2aed674285580c28f5ae0d4d500ec | f738dcd66fb70df376b8a954a75a9024155a5c7a | refs/heads/main | 2023-07-21T01:25:08.725352 | 2021-08-31T09:26:10 | 2021-08-31T09:26:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,727 | cpp | b_spline_basis_function_test.cpp | /* Copyright (c) 2018–2021 SplineLib
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, distribute, ... |
94128cf6abd4eec82e29374873b8e0705e6ec7cd | 7a12fbf4a4c5e6017dac3eeb829f7272848ba672 | /WhoAmI_source/src/Physics.cpp | 63f76ae6c6a83219ff2c0b6360a0a7bc32c30a30 | [] | no_license | CH-Kwon/Who_Am_I | 5336f00996b683453828792f8f294cc10fb4bb12 | c21f01b502de36724e3965658575d25ce4740463 | refs/heads/master | 2023-04-11T17:05:46.088709 | 2021-05-04T08:01:19 | 2021-05-04T08:01:19 | 364,178,338 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,228 | cpp | Physics.cpp | /**
\file Physics.cpp
\author jungdae.chur
\par email: wmdhwmdh@gmail.com
\par course: GAM200
\date 12/13/2017
\brief
All content (c) 2017 DigiPen (USA) Corporation, all rights reserved.
*/
#include "Physics.h"
//include RigidBody, Transform, BoxCollision and so on...
#include "Head... |
16e7423086cf710fb0254d1edf4ce960264ab297 | 2e0a6fd5767ee4551d370f682910702be9095d73 | /SlicerModules/SpatialObjectsModule/Widgets/qSlicerSpatialObjectsGlyphWidget.cxx | 30139523b25e245a2e094a984bb56d52ce90db59 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | LucasGandel/TubeTK | ee0ce6a378aab732a3ee051ecd2ea36332d4943a | 50682d4d8b30b0392575685e11e16a1086790bc8 | refs/heads/master | 2021-01-18T09:29:06.802793 | 2016-01-30T04:11:39 | 2016-01-30T04:11:39 | 40,605,754 | 1 | 1 | null | 2015-08-12T14:39:59 | 2015-08-12T14:39:59 | null | UTF-8 | C++ | false | false | 9,690 | cxx | qSlicerSpatialObjectsGlyphWidget.cxx | /*=========================================================================
Library: TubeTK
Copyright 2010 Kitware Inc. 28 Corporate Drive,
Clifton Park, NY, 12065, USA.
All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the Lic... |
411b8a767dec1d6c27b867247a169a5666bf2192 | f2574b2f053b6faa4b6d4fc75bef389e83132c33 | /ntl/stlx/cstd/wctype.h | 75af8985b58f03401831b3f2733595ea46c4a3db | [
"Zlib",
"LicenseRef-scancode-stlport-4.5"
] | permissive | icestudent/ontl | a0a391b06b55ef45f496021614cf0b9df318e7a6 | 6ed48916bbc8323776c710f393c853ee94cb97de | refs/heads/master | 2022-05-15T21:45:29.063446 | 2022-05-04T03:51:02 | 2022-05-04T11:18:20 | 15,104,848 | 46 | 13 | null | 2022-05-04T11:18:20 | 2013-12-11T10:45:04 | C++ | UTF-8 | C++ | false | false | 310 | h | wctype.h | #pragma once
#include "../cwctype.hxx"
using std::iswalnum;
using std::iswalpha;
using std::iswblank;
using std::iswcntrl;
using std::iswdigit;
using std::iswgraph;
using std::iswlower;
using std::iswprint;
using std::iswpunct;
using std::iswspace;
using std::iswupper;
using std::iswxdigit;
|
a12d75c2893ed24fc1a86426cbaba97a556fdaf9 | 080941f107281f93618c30a7aa8bec9e8e2d8587 | /src/conditioners/kmzcleanup_core.cpp | f3f7520b0e3e092b2fb16a3daaa21c653a48c167 | [
"MIT"
] | permissive | scoopr/COLLADA_Refinery | 6d40ee1497b9f33818ec1e71677c3d0a0bf8ced4 | 3a5ad1a81e0359f9025953e38e425bc10b5bf6c5 | refs/heads/master | 2021-01-22T01:55:14.642769 | 2009-03-10T21:31:04 | 2009-03-10T21:31:04 | 194,828 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 30,161 | cpp | kmzcleanup_core.cpp | /*
The MIT License
Copyright 2006 Sony Computer Entertainment Inc.
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... |
b8fe6611b60524ce0b207b59d81ea2ed68c21cdf | 4c6f379972a5aba051681f90a6727c4b9c3c5fff | /src/ProxyClient/ProxyClient.cpp | f41c83d7917bc05250660e1a79c740f9e0dd928f | [] | no_license | metahashorg/metagate | 8aa6db7c9ad99b3ce9735c00123783030a59c2a3 | ae03640e64a0db148b4f937626a1a8ae9a0137e0 | refs/heads/master | 2022-02-24T21:13:22.343544 | 2022-02-02T11:03:20 | 2022-02-02T11:03:20 | 134,271,725 | 37 | 17 | null | 2019-04-15T13:02:41 | 2018-05-21T13:17:51 | C++ | UTF-8 | C++ | false | false | 6,126 | cpp | ProxyClient.cpp | #include "ProxyClient.h"
#include "ProxyClientMessage.h"
#include "MetaGate/MetaGate.h"
#include "qt_utilites/SlotWrapper.h"
#include "qt_utilites/QRegister.h"
#include "qt_utilites/ManagerWrapperImpl.h"
#include "utilites/machine_uid.h"
#include "Paths.h"
#include <QSettings>
SET_LOG_NAMESPACE("PXC");
namespac... |
172e237686a9e1c8a30567f4d3e67c96bd553a48 | f4c7f7a66e5506e0622101a34624aec434d2bc31 | /data_server/src/server_conf.pb.cc | 49a7bf5c37739101473a5ced55318c6b6db199bb | [] | no_license | machaelliu/modbus_dev | 02a56bbfa7723536afa81aa88bb10e7330fe1a69 | 2dd415b2ecddd06aa6b913978d5b26780bcab4da | refs/heads/master | 2020-03-19T04:19:50.090247 | 2018-06-24T08:09:59 | 2018-06-24T08:09:59 | 135,816,806 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 44,890 | cc | server_conf.pb.cc | // Generated by the protocol buffer compiler. DO NOT EDIT!
#define INTERNAL_SUPPRESS_PROTOBUF_FIELD_DEPRECATION
#include "server_conf.pb.h"
#include <algorithm>
#include <google/protobuf/stubs/once.h>
#include <google/protobuf/io/coded_stream.h>
#include <google/protobuf/wire_format_lite_inl.h>
#include <google/pro... |
983d7e066fec6843c49da62090a0bde563b26b58 | 610ec95887f70da95e1ab5eb9475f0977d3c4a8a | /SuperMarioBros/src/Level/Tiles/BigBushT.h | 93f66396a3a2c9b123edba3b84df079be21690eb | [] | no_license | Hypooxanthine/SuperMarioBros | 0632f912ee7338d4ec685a01c3571df4e68bb69c | 60d560ae0b57f86acd866300940f8a0de86975c2 | refs/heads/main | 2023-07-23T14:02:24.194266 | 2021-08-30T19:56:49 | 2021-08-30T19:56:49 | 395,396,712 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 93 | h | BigBushT.h | #pragma once
#include "Tile.h"
class BigBushT : public Tile
{
TILE_INIT_DEF(BigBushT)
};
|
7c80df0fc3b970d24462ff339921aaf2a07bedeb | 44ab57520bb1a9b48045cb1ee9baee8816b44a5b | /EngineTesting/Code/CoreTools/CoreToolsTesting/DataTypesSuite/MinHeapRecordTesting.cpp | dc8e9b88bec879f7e2b61076698cbe9336bb2ac5 | [
"BSD-3-Clause"
] | permissive | WuyangPeng/Engine | d5d81fd4ec18795679ce99552ab9809f3b205409 | 738fde5660449e87ccd4f4878f7bf2a443ae9f1f | refs/heads/master | 2023-08-17T17:01:41.765963 | 2023-08-16T07:27:05 | 2023-08-16T07:27:05 | 246,266,843 | 10 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,928 | cpp | MinHeapRecordTesting.cpp | /// Copyright (c) 2010-2023
/// Threading Core Render Engine
///
/// 作者：彭武阳，彭晔恩，彭晔泽
/// 联系作者：94458936@qq.com
///
/// 标准：std:c++20
/// 引擎测试版本：0.9.0.6 (2023/04/11 18:05)
#include "MinHeapRecordTesting.h"
#include "CoreTools/DataTypes/MinHeapRecordDetail.h"
#include "CoreTools/Helper/AssertMacro.h"
#include "CoreTools/He... |
7e8fb5e08f37656ef0585af3776ac525f4a48a2a | 8547aaa8ce45122e12ecf8862e52b331f6d54dcd | /cpp_programming/exam_question/parkinglot.h | cd9d3cd0cf50b5622ee4e03c7256a25a7a7b8d65 | [] | no_license | sjyn/LahTech | fad9f3356afa18678900a742c749a829a21dac9f | adb5130e210c76e9371d34c2a4cb2a255b429d39 | refs/heads/master | 2021-01-15T15:43:50.843145 | 2016-12-07T14:55:09 | 2016-12-07T14:55:09 | 43,650,418 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 359 | h | parkinglot.h | #ifndef PL_H
#define PL_H
#include <vector>
#include <mutex>
#include "car.h"
#include "truck.h"
#include "vehicle.h"
class ParkingLot {
private:
std::vector<Vehicle*> autos;
std::vector<Vehicle*>::iterator it;
std::mutex myTex;
public:
ParkingLot();
~ParkingLot();
void addVehicle(Vehicle* a... |
df061f55efb22360a4fc098778f84017533608d3 | cb0af0a65ae5ddc300d1b49e7dc6287faad02315 | /*101**.cpp | e88ad9067a6394b77505cdd62ebecbe9c7e2a943 | [] | no_license | Cloverii/LeetCode | 04d45a395727f51f986d14deac9dde26675fc606 | 78230b56bbe60cdcce6ff483b87ad3e1f962d64e | refs/heads/master | 2021-01-18T15:22:46.775775 | 2017-06-21T13:59:52 | 2017-06-21T13:59:52 | 84,344,778 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,132 | cpp | *101**.cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
private:
bool cmp(TreeNode *lft, TreeNode *rht) {
if(lft && rht) {
if(lft->val != r... |
699200bdf8e5fb4cf8e880a7d39c126fbfd1833a | c28b306dbb5a0a08e6341c709c56b50006cc144c | /Evento.cpp | ee6092c412024ee9c51acdde42ea6fd7c1963365 | [] | no_license | faidertms/Ridin | 5421d6200fedfd9a63d6a0a97127ed1399aa09a9 | 0ddd6325b273a0e1679c4a2bb4407328ef022eab | refs/heads/master | 2020-06-13T06:09:56.061911 | 2019-06-30T22:20:53 | 2019-06-30T22:20:53 | 194,565,982 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 1,536 | cpp | Evento.cpp | //Detecção de Evento
#include "estados.h"
void estados::OnEvent(){
while (SDL_PollEvent(&event))
{
if (tempoclass.calculartempo() >= 0){ // Verifica se o tempo de largada é maior ou igual a 0 para que possa movimentar o carro, por padrão começa como -3 o tempo
switch (event.type)
{
case SDL_QUIT: //Ca... |
7096e65e35a31cdd00a480aa4dfd3f0369e6b4f0 | 3962899b0350c4ccdec015a555603f5a705bc698 | /include/amino/ebstack.h | e9c1b560435ff11744a53ee10765fcecc2237740 | [
"Apache-2.0"
] | permissive | bapi/amino | 8fc7c82d68e5b3a960e84301d238cf7507e33adc | fb3453097793fdbf0b5b5f7c272b4c3625968d7e | refs/heads/master | 2020-12-30T17:44:39.548491 | 2010-04-15T22:00:11 | 2010-04-15T22:00:11 | 11,505,149 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 16,143 | h | ebstack.h | /*
* (c) Copyright 2008, IBM Corporation.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed ... |
16ab6faf56d40f8b56ebd75089b560c4f3537270 | e0bfa24bacce73eeb68673f26bd152b7963ef855 | /workspace1/ABC198/C.cpp | 0108053749f7bff2854d3f567e77056aa6a127e3 | [] | no_license | kenji132/Competitive-Programming | 52b1147d5e846000355cd7ee4805fad639e186d5 | 89c0336139dae002a3187fa372fda7652fd466cb | refs/heads/master | 2023-04-25T08:29:04.657607 | 2021-05-12T09:35:20 | 2021-05-12T09:35:20 | 314,996,525 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 323 | cpp | C.cpp | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll r,x,y;
cin >> r >> x >> y;
ll d2 = x*x+y*y;
bool ok = true;
ll ans = 1;
while(ok){
if(r*r*ans*ans >= d2) break;
ans++;
}
if(ans == 1){
if(r*r != d2){
ans = 2;
}
}
cout << ans << endl;
return 0... |
8670a321745ee2cd4202e423c6b118434c6a2c74 | 0ca40d4428b218d4fe74c0e9cb23aba9d2d0e278 | /426.convert-binary-search-tree-to-sorted-doubly-linked-list.249629289.ac.cpp | 0f6c092f5d9b5b615a402cfbcd52490e0ac5a253 | [] | no_license | rjoudrey/leetcode-solutions | 4c4b84cc331816c9d438e4b8e6fc9a85ab15b3eb | 368e20e194383187d3786f827cfcb066329dddc3 | refs/heads/master | 2020-09-11T19:41:13.355768 | 2019-11-17T03:28:47 | 2019-11-17T03:28:47 | 222,170,630 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,328 | cpp | 426.convert-binary-search-tree-to-sorted-doubly-linked-list.249629289.ac.cpp | /*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node() {}
Node(int _val, Node* _left, Node* _right) {
val = _val;
left = _left;
right = _right;
}
};
*/
struct ProcessState {
Node *first;
Node *last;
};
class Solution {
publi... |
3395cd344866c9e97ca43154beb973d72dea1032 | 56f58ef41d9c245da5fe871d8bc23d74b0a42290 | /leetcode/algorithms/474 - Ones and Zeroes.cpp | 2d2578a6a7bcc344d815a9606cb852c9df0850c0 | [] | no_license | zotvent/competitive-programming | 353dd906e87bc20090c6cbb75b1f68f8653ca489 | 32e9efc6b45e28b5c8d47d875de58305087ae5f1 | refs/heads/master | 2023-05-26T05:36:14.802939 | 2023-05-25T22:21:33 | 2023-05-25T22:21:33 | 93,071,555 | 29 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 828 | cpp | 474 - Ones and Zeroes.cpp | class Solution {
vector<int> countZerosOnes(string& s) {
vector<int> res(2, 0);
for (int i = 0; i < s.size(); i++) {
res[s[i] - '0']++;
}
return res;
}
public:
int findMaxForm(vector<string>& strs, int m, int n) {
int res = 0;
vector<vect... |
f5d0eb8a25df63d57fad832a8bc643105e21d79b | 4235ada3707f5ef565eee5518a4a562bba67094f | /src/tadiga_IGES_geometry.cc | 4f1cbf0688217ceba2daf8479b0c833fff7e29b6 | [
"Apache-2.0"
] | permissive | johntfoster/TaDIgA | 9d8fcc4c78d366d52909143d17ca9b03e4326c41 | 38b97b9e5018cd8d44624cf6b01d06b54fed488e | refs/heads/master | 2020-06-12T20:46:08.455776 | 2017-06-01T15:49:37 | 2017-06-01T15:49:37 | 75,751,963 | 0 | 2 | null | 2017-05-26T02:29:44 | 2016-12-06T16:52:36 | C++ | UTF-8 | C++ | false | false | 2,086 | cc | tadiga_IGES_geometry.cc | // Copyright 2016-2017 John T. Foster, Katy L. Hanson
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law... |
c98f9cca2602b218911154decff55504d72f7e74 | 6131fc9dc8dbbb6a5c6d40a6c947e678eebfdf2d | /project_template/Windows/NYUCodebase/HW5/Game.h | 1ec5c1a9b0f0db299c91da07b4299e9ef9b812a0 | [] | no_license | at2336/Trapped | 476e0aa03d9dae4182d761d8b660aea92b9a91fe | d00880b98fad3463ea742ca71dbaabedf8fa0eea | refs/heads/master | 2021-05-31T14:22:27.157742 | 2016-05-15T01:40:02 | 2016-05-15T01:40:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,138 | h | Game.h | #ifdef _WINDOWS
#include <GL/glew.h>
#endif
#include <SDL.h>
#include <SDL_opengl.h>
#include <SDL_image.h>
#include <string>
#include <vector>
#include "Entity.h"
#include <SDL_mixer.h>
using namespace std;
#ifdef _WINDOWS
#define RESOURCE_FOLDER ""
#else
#define RESOURCE_FOLDER "NYUCodebase.app/Contents/Resources/"
... |
cd77019d09f77401717aa093e0503bc2c6b269c8 | 6c651658d1c61b75b84a11fc0653bcf5756e84a1 | /vehicle.cpp | 7988083fbd54b8d8f301375080c8a889812746f8 | [] | no_license | morganwallin/TrainSimulation | 20b05725079bc8b90783dd9360a44267258857dc | a0a74324a40c363bf07f6aa2cf7eba104024eaf5 | refs/heads/main | 2022-12-24T22:48:10.300485 | 2020-10-08T13:45:16 | 2020-10-08T13:45:16 | 302,354,804 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,398 | cpp | vehicle.cpp | /*
Morgan Vallin, mova1701, mova1701@student.miun.se
2018-06-11, Projektarbete, Objektorienterad programmering i C++
vehicle.cpp
Definitions for the Vehicle Class. Manipulates vehicles.
"Vehicle" is a base class for 4 other "vehicles" and 2 "locomotives".
*/
#include "vehicle.h"
//Constructor
Vehi... |
863aa7914141daf0d6443951baf94c7e1436d033 | 1735261e845e96ec83e438999bb80d914444a666 | /practica_01/practica_01.ino | c6998e94d59b156559cdc53a6f88f67977371c73 | [
"MIT"
] | permissive | funcionlab/automatizacion-de-huertos | fdb283c350e4c2db3b6bfe69dd45ab5b2e28ca1b | 2d4647b1aaf959dbb3e52480d3ff2a40889c6ada | refs/heads/master | 2020-04-15T23:16:22.810488 | 2019-01-12T17:25:08 | 2019-01-12T17:25:08 | 165,100,558 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 299 | ino | practica_01.ino | void setup() {
pinMode( 9 , OUTPUT);
}
void loop() {
analogWrite(9, 10);
delay(1000);
analogWrite(9, 50);
delay(1000);
analogWrite(9, 100);
delay(1000);
analogWrite(9, 150);
delay(1000);
analogWrite(9, 200);
delay(1000);
analogWrite(9, 255);
delay(1000);
}
|
3d068c2b1304fb1ce3b52c8853471244f96053be | 4f1f1c8b906bebe10810525e58f9c1688eebc63b | /CodeForces/ECR1/B.cpp | 7e778bd5a22386670477db7d72459e886e7131c1 | [] | no_license | stone725/CompetitiveProgramming | 40ef3c6c9f9c8952366b1449805d21dc0c44d6dd | d6558c718e1dce384ca5accaf7253412849d590f | refs/heads/master | 2023-01-07T11:11:19.128446 | 2023-01-01T01:39:39 | 2023-01-01T01:39:39 | 194,200,546 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 511 | cpp | B.cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
cin >> str;
int t;
cin >> t;
while (t--)
{
cerr << str << "\n";
int l, r, k;
cin >> l >> r >> k;
if (l == r)
continue;
l--;
if (k >... |
951bc86f5757797b0b39d4ac1195a34b79e3fdae | f98c9dea0e212be5c7bc3161499e5633383bd4d7 | /cpp/gugudan_test.cpp | 4f9a2e27f84234b784fd0db6f49f2f73b2ed7d7c | [
"MIT"
] | permissive | ysoftman/test_code | dddb5bee3420977bfa335320a09d66e5984403f5 | 0bf6307073081eeb1d654a1eb5efde44a0bdfe1e | refs/heads/master | 2023-08-17T05:45:49.716829 | 2023-08-16T05:00:09 | 2023-08-16T05:00:09 | 108,200,568 | 4 | 0 | MIT | 2023-03-15T04:23:10 | 2017-10-25T00:49:26 | C++ | UTF-8 | C++ | false | false | 560 | cpp | gugudan_test.cpp | // ysoftman
// 구구단 입력 받아 출력(1 ~ 9 숫자만)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
int num1, num2;
char ch;
// 출력할 단 입력 받기
while (1)
{
printf("Input Number: ");
if ((ch = getchar()) != 0)
{
if (ch >= 49 && ch <= 57)
{
printf("Input number is %d\n", ch - 48);
num1 =... |
5ff2261652ebcf063969a2d8c05114c3d538dfe4 | fa2250779a2eb0b3155f8a9912b9b08caeba0cbe | /sample.Makefile/include/fn.hpp | f53e5bce4c14cd8a5c882727045d8e9c5d37e170 | [
"MIT"
] | permissive | on62/daft-lib | 33b3d00fe3520b9ce78ddcbd7a814ed78c1bf254 | 7890fdba0aab800022ab9afb958946bd06779f33 | refs/heads/master | 2022-11-14T23:08:13.978445 | 2020-07-08T13:33:09 | 2020-07-08T13:33:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 65 | hpp | fn.hpp | #ifndef _FN_HPP_
#define _FN_HPP_
extern void fn(void);
#endif
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.