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 905
values | visit_date timestamp[us]date 2015-08-09 11:21:18 2023-09-06 10:45:07 | revision_date timestamp[us]date 1997-09-14 05:04:47 2023-09-17 19:19:19 | committer_date timestamp[us]date 1997-09-14 05:04:47 2023-09-06 06:22:19 | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 22
values | gha_event_created_at timestamp[us]date 2012-06-07 00:51:45 2023-09-14 21:58:39 ⌀ | gha_created_at timestamp[us]date 2008-03-27 23:40:48 2023-08-21 23:17:38 ⌀ | gha_language stringclasses 141
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 115
values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
73195176f7fb275194b8f9e66033132175b2af7b | 9861baf0aff68fc9c4e13479b9accbb93dcb5428 | /src/effects/videoStreamEffect.h | d3ddd4ae8b58a743423207abdf4773fc0435f5a0 | [] | no_license | Daandelange/karmaMapper | 9b36c0bd7244e6f1cb2feee07968eb11feff0d23 | 274b694f61d1a09e2e58c219d4232344ffceb49e | refs/heads/master | 2022-12-27T11:36:29.204878 | 2020-10-10T11:51:19 | 2020-10-10T11:51:19 | 18,294,275 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 648 | h | //
// videoStreamEffect.h
// karmaMapper
//
// Created by Daan de Lange on 12/3/14.
//
//
// tmp disabled
#ifdef KM_PLEASESKIPME
#pragma once
#include "ofMain.h"
#include "basicEffect.h"
#include "ofxAbletonLiveSet.h"
class videoStreamEffect : public basicEffect {
public:
videoStreamEffect();
~videoStreamEff... | [
"idaany@gmail.com"
] | idaany@gmail.com |
dd913316575136a20d668a9992aa1ecaad053bb4 | 4b5a6c207886eb664889b8d28bef8724dd26fa63 | /ROOT/bin/OSLSMTMethodAllElectrons.cc | d462407fe95845b1a5e9da063117f9bff86e2c1b | [] | no_license | iross/UWAnalysis | 2b5d2ada9cfdc28e2c00f97a04767b4e283a04f1 | 5b3d21ddf2cb8557fd87b7e4f449496fb1f41479 | refs/heads/master | 2021-01-23T07:15:38.950859 | 2013-07-24T20:55:03 | 2013-07-24T20:55:03 | 4,274,658 | 1 | 0 | null | 2013-03-01T19:46:28 | 2012-05-09T17:51:09 | Python | UTF-8 | C++ | false | false | 18,001 | cc | #include "RooRealVar.h"
#include "RooGaussian.h"
#include "RooBifurGauss.h"
#include "RooExponential.h"
#include "RooAddPdf.h"
#include "RooHistPdf.h"
#include "RooDataSet.h"
#include "RooDataHist.h"
#include "RooGlobalFunc.h"
#include "RooChi2Var.h"
#include "RooRealVar.h"
#include "RooLandau.h"
#include "RooGaussian... | [
"iross@login06.hep.wisc.edu"
] | iross@login06.hep.wisc.edu |
adb88d635ef233694ed9c4260c49d8bf494071dd | 7598faccaa6a30f05d98590fc3874435e32f54a2 | /src/NNDepParser/model/ActionedNodes.h | 9c2bcc2913dba8a39c39de27615fb82eeb68690c | [] | no_license | XrosLiang/NNDepParser | 2ca875f6f622e0f687f4501901ef817300ff603b | af49a428e5ceb785358ef360993ed46cb100dc95 | refs/heads/master | 2021-08-16T21:26:26.123024 | 2017-11-20T10:35:07 | 2017-11-20T10:35:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,260 | h | #ifndef ACTIONED_NODES_H
#define ACTIONED_NODES_H
#include "ModelParams.h"
#include "AtomFeature.h"
// score the action one by one
class ActionedNodes {
public:
LookupNode pre_action_input;
LookupNode pre_pre_action_input;
ConcatNode action_concat;
IncLSTM1Builder action_lstm;
vector<LookupNode> current_action... | [
"yunan.hlju@gmail.com"
] | yunan.hlju@gmail.com |
a9c9d4adf8ae0e4f78a7c4a87c4f8420955ef691 | 8b1cedbca5f5a967e5c37c280f53dfdbff00ff19 | /cocos/170704/170704_Lesson_Swap_Refrence/170704_Lesson_Swap_Refrence/170704_Lesson_Swap_Refrence.cpp | ae034aa75534e5f7a7c7ac2fb8b90cbe09d0cd97 | [] | no_license | kcwzzz/KCW | ef552641c77d1971ad4536d37a70eb9a59f4d4e6 | 34973e5fae0a4095418ac0bd99637ffa24f525be | refs/heads/master | 2020-12-03T05:11:38.828978 | 2017-09-29T08:10:59 | 2017-09-29T08:10:59 | 95,736,720 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 621 | cpp | // 170704_Lesson_Swap_Refrence.cpp : 콘솔 응용 프로그램에 대한 진입점을 정의합니다.
//
#include "stdafx.h"
#include <iostream>
void Swap(int &tA, int &tB);
using namespace std;
int main()
{
int tAA = 777;
int &tBB = tAA; //tAA라는 변수에 tBB라는 이름을 새로 붙였다.
cout << "tAA [" << &tAA << "] : " << tAA << endl;
cout << "tBB [" << &tBB << ... | [
"kcwzzz@naver.com"
] | kcwzzz@naver.com |
4a5ae4116c80def4daccd40261d29159a14ec3fe | 3ffcc0bc7d59ba2fa5f7d7e721d0ed80fe203363 | /Medium/159_LongestSubstringWithAtMostTwoDistinctCharacters.cpp | fe2e3e50ad17e7c1f379642df9270876a9cc61f5 | [] | no_license | davidwang318/LeetCode | 325f69894c86da376c5799101246ce1d4deaac54 | efc04f32b334ffd2bfbd8e902ffe40ea6a7ed272 | refs/heads/master | 2021-07-09T15:30:02.491489 | 2021-04-01T01:01:16 | 2021-04-01T01:01:16 | 234,077,651 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 522 | cpp | class Solution {
public:
int lengthOfLongestSubstringTwoDistinct(string s) {
if (s.size() <= 2) return s.size();
int cnt = 0, l = 0, r = 0, res = 0;
unordered_map<char, int> m;
while (r != s.size()) {
if (cnt > 2) {
if (--m[s[l++]] == 0) --cnt;
... | [
"davidwang106@gmail.com"
] | davidwang106@gmail.com |
6ce6dd6923a3c0c397ea9a5a67a9303cf35a74ea | 5b30dc8638b31b4921ac1611950d48065319ad42 | /JNU/线段树+离散化求逆序对.cpp | 1ddc7e45b914ecb7a27968962b2f0190b7190195 | [
"Apache-2.0"
] | permissive | taisuishen/code | 041916ac14973d24f669efd0f6c2606ad9cb554b | b959ffcd9f401fa7c6362d6d7cf745e48acfca89 | refs/heads/main | 2023-02-02T21:31:27.448785 | 2020-12-21T16:25:16 | 2020-12-21T16:25:16 | 303,955,660 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,366 | cpp | #include<bits/stdc++.h>
#define lson l,m,rt*2
#define rson m+1,r,rt*2+1
#define maxn 100000+10
using namespace std;
int n,now[maxn],tree[4*maxn],sign=0,ans=0;
const int mod=99999997;
struct node{
int v,w;
}a[maxn],b[maxn];
bool cmp(node a,node b)
{
return a.v<b.v;
}
void pushup(int rt)
... | [
"1037381963@qq.com"
] | 1037381963@qq.com |
04d235b465c7cfe9bc363e5cd5b057c681d20b75 | 4b43a0b828cfa2ebe545e254cc04d4b203f87592 | /MP-SPDZ/MPC-ACC/Defines.h | 5a6739a10d1160113b1847727324590924eb5eaf | [
"MIT",
"BSD-2-Clause"
] | permissive | dmpingfan/MPC-Accumulator | 14c3b65ec26a83273bcb9db4b3ab833be9244f78 | c7b42ceb72ee9adcebf210619d8decaaacb6694d | refs/heads/master | 2023-08-15T18:34:44.198811 | 2021-05-17T11:06:49 | 2021-05-17T11:06:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,609 | h | // Defines.h
//
// The implementation in this file is a modification
// of the implementation in:
// https://github.com/ladnir/cryptoTools/blob/master/cryptoTools/Common/Defines.h
#pragma once
#include <cstdint>
#include <iostream>
#include <memory>
#include <emmintrin.h>
#include <smmintrin.h>
#d... | [
"roman.walch@iaik.tugraz.at"
] | roman.walch@iaik.tugraz.at |
6b36d46f06a0b0b8df2a4527e8cf13780f256f5a | 8dc84558f0058d90dfc4955e905dab1b22d12c08 | /net/proxy_resolution/proxy_resolver_v8_tracing.cc | 8b96c07fbb97d6cb8b402a57c2cbb23d5b27fb27 | [
"LicenseRef-scancode-unknown-license-reference",
"BSD-3-Clause"
] | permissive | meniossin/src | 42a95cc6c4a9c71d43d62bc4311224ca1fd61e03 | 44f73f7e76119e5ab415d4593ac66485e65d700a | refs/heads/master | 2022-12-16T20:17:03.747113 | 2020-09-03T10:43:12 | 2020-09-03T10:43:12 | 263,710,168 | 1 | 0 | BSD-3-Clause | 2020-05-13T18:20:09 | 2020-05-13T18:20:08 | null | UTF-8 | C++ | false | false | 35,964 | cc | // Copyright (c) 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/proxy_resolution/proxy_resolver_v8_tracing.h"
#include <map>
#include <string>
#include <utility>
#include <vector>
#include "base/bin... | [
"arnaud@geometry.ee"
] | arnaud@geometry.ee |
f6a84d402c1d149f4c742c5ba200fcc0fbefef76 | e06e5cec524d56e31fd2ab9ed1dc2ce5901132ab | /src/majority-element.cpp | 10af683cbec3d1ed606f5a650eb926bf04dad801 | [
"MIT"
] | permissive | amoudgl/leetcode-solutions | d08ccd2fb8c8df17946ef665b701473c37725d27 | dc6570bb06b82c2c70d6f387b3486897035cc995 | refs/heads/master | 2021-07-14T11:39:53.627346 | 2017-10-11T16:19:14 | 2017-10-11T16:19:14 | 90,723,556 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 368 | cpp | // Author: Abhinav Moudgil [ https://leetcode.com/amoudgl/ ]
class Solution {
public:
int majorityElement(vector<int>& nums) {
int count = 0, ans = 0;
for (int i = 0; i < nums.size(); i++)
{
if (count == 0) ans = nums[i];
if (ans != nums[i]) count--;
else ... | [
"abhinavmoudgil95@gmail.com"
] | abhinavmoudgil95@gmail.com |
62bd02362018f53efeb2a947f7e126ee56290a83 | 08d3ae56aac8bba5cf5c40db1cdbb2594ceb97d0 | /src/Breakout/Game.h | 54521e74002fd86f71c0d3a2b1d3808854e22b84 | [] | no_license | wyrover/sdl-examples | ec99c37b56a6fb2dfd56f4fbfdf912fb9f4e9f76 | da825457dcdf9b34f2ad7e59fc0ab9e8233633a7 | refs/heads/master | 2021-01-17T18:58:36.868667 | 2017-09-27T01:30:08 | 2017-09-27T01:30:08 | 84,137,392 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,204 | h | // ------------------------------------------------------------
// The Breakout Tutorial
// (c) 2015 Rembound.com
// http://rembound.com/articles/the-breakout-tutorial
// ------------------------------------------------------------
#ifndef GAME_H_
#define GAME_H_
#include "SDL.h"
#include "SDL_image.h"
#include <iost... | [
"wyrover@gmail.com"
] | wyrover@gmail.com |
945821b9be7a429b7bca8543d79ec053de149819 | 9546b2c00eaefbe9eb57f4f14711214b2009dc3b | /ChronoEngineWrapper/ChronoEngineWrapper/FunctionSine.cpp | 796ba71af7486631365b2645787338d93df2f939 | [] | no_license | globus000/cew | 671096366385805a8f4dbe2d2f8c185edb4163cb | 13d2a3c007239c8caccab2c5198ef5e8147369e1 | refs/heads/master | 2016-09-05T09:18:55.011986 | 2015-04-26T16:45:00 | 2015-04-26T16:45:00 | 34,566,328 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,486 | cpp |
#include "stdafx.h"
#include "Functionsine.h"
namespace cew
{
FunctionSine::FunctionSine() : Function( new chrono::ChFunction_Sine() )
{
}
FunctionSine::~FunctionSine()
{
}
double FunctionSine::Amp::get()
{
return SharedPtr->DynamicCastTo<chrono::ChFunction_Sine>()->Get_amp();
}
void FunctionSine::Amp:... | [
"zr_contact@mail.ru"
] | zr_contact@mail.ru |
a492ec4bd8e35a6789f025cde62937169339fb6a | b7f3edb5b7c62174bed808079c3b21fb9ea51d52 | /third_party/blink/renderer/bindings/tests/results/core/string_treat_null_as_empty_string_or_long.cc | 552e6c61822ec2b21687eda43d1aecd2eba8fde2 | [
"LGPL-2.0-or-later",
"GPL-1.0-or-later",
"MIT",
"Apache-2.0",
"LicenseRef-scancode-warranty-disclaimer",
"LGPL-2.1-only",
"GPL-2.0-only",
"LGPL-2.0-only",
"BSD-2-Clause",
"LicenseRef-scancode-other-copyleft",
"BSD-3-Clause"
] | permissive | otcshare/chromium-src | 26a7372773b53b236784c51677c566dc0ad839e4 | 64bee65c921db7e78e25d08f1e98da2668b57be5 | refs/heads/webml | 2023-03-21T03:20:15.377034 | 2020-11-16T01:40:14 | 2020-11-16T01:40:14 | 209,262,645 | 18 | 21 | BSD-3-Clause | 2023-03-23T06:20:07 | 2019-09-18T08:52:07 | null | UTF-8 | C++ | false | false | 4,069 | cc | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// This file has been auto-generated from the Jinja2 template
// third_party/blink/renderer/bindings/templates/union_container.cc.tmpl
// by the script co... | [
"commit-bot@chromium.org"
] | commit-bot@chromium.org |
a532d2dc04d716d783afd0b9206ced9d93391802 | 53052e0064bf42316e6f7f94fd0003096b010f78 | /week3_hash_tables/1_phone_book/phone_book.cpp | 42da106d7d9a614bf66ef51f9cd6891563f311cd | [] | no_license | muhammedSabbah/Data-Structures | 4b60f33e9fe48d31dbe0d88c3fc8512885c6709e | b80831b2dc32c2cb334c9931df7ff9405484dd67 | refs/heads/master | 2020-09-13T20:42:25.716658 | 2020-04-06T12:54:58 | 2020-04-06T12:54:58 | 222,897,064 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,013 | cpp | #include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
using namespace std;
struct Query {
string type, name;
int number;
};
vector<Query> read_queries() {
int n;
cin >> n;
vector<Query> queries(n);
for (int i = 0; i < n; ++i) {
cin >> queries[i].type;
if (queries[i].type == "add"... | [
"30741844+muhammedSabbah@users.noreply.github.com"
] | 30741844+muhammedSabbah@users.noreply.github.com |
99b1883178b40c601522ff91180a2e67e61d65cc | 395833de59e625da5a0c8c9c4f6ea3320cefabfb | /MikuMikuGameEngine/engine/core/ResourceManager.h | 3741239b983fb92e8fdb3e5b24694e4f02d91ec9 | [] | no_license | dugong001/MikuMikuGameEngine | e7214c62bf86aee72d3b14f63268cfab1bab08e1 | 3621580da9ee3dc2c244fc182de53d31dfbd7e80 | refs/heads/master | 2020-03-27T18:26:27.296118 | 2013-02-23T12:05:18 | 2013-02-23T12:05:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 856 | h | #pragma once
#include "util/Charset.h"
class IResource
{
public:
IResource(){};
virtual ~IResource(){};
};
typedef std::tr1::shared_ptr< IResource > ResourcePtr;
typedef std::tr1::weak_ptr< IResource > ResourceWeakPtr;
class ResourceManager
{
public:
static ResourceManager& GetInstance()
{
... | [
"miyabi@circle-chips.com"
] | miyabi@circle-chips.com |
52234e04ab3dc7c7002254635e506205be5f1d9e | 6e707dc66ddd5ad85f7d3e3d37ee8758644889ae | /GGP_Engine/Engine/DX11Starter/Entities.cpp | 2461b6ad09686ee530e61c6edb9d0669ae13e9e4 | [] | no_license | ArturoKuang/ClothSimulation | 61c82ca2fa012b3483cb26492dbaa5c491c7b424 | 3ea55d99ced224394912a30ce299620bb9e458e2 | refs/heads/master | 2022-02-24T16:16:51.664429 | 2019-09-20T18:57:19 | 2019-09-20T18:57:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,307 | cpp | #include "Entities.h"
Entities::Entities(Mesh * Mesh, Material* Material)
{
material = Material;
mesh = Mesh;
XMStoreFloat4x4(&worldMatrix, XMMatrixIdentity());
position = { 1, 1, 0 };
scale = { 1, 1, 1 };
rotation = { 0, 0, 0 };
}
void Entities::SetTranslation(float x, float y, float z)
{
position = { x, y, ... | [
"Arturo@DESKTOP-L6C1D74"
] | Arturo@DESKTOP-L6C1D74 |
11a7ae729a7e1f0b3c2771dbf9ea8394d083ec7c | ab116a11edb15f076480864c6d349c02e3434cf5 | /team.cpp | 55da46f66067e491fe0fd8fd30b7a838fe8e96de | [] | no_license | amengede/cpp-practice | ece5512e77d7c3220b15bc3f9d202502ea6af3be | 37fb7c1ecd5a36c2912a729f7b24a61dea570d3c | refs/heads/master | 2022-10-23T19:10:53.405119 | 2020-06-19T02:09:36 | 2020-06-19T02:09:36 | 272,578,003 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 853 | cpp | /*
How many problems to attempt?
A team has 3 members and is given n problems. For each problem, each team member knows whether they can solve it.
The team will only attempt a problem if 2 out of 3 of them can solve it. How many problems can they attempt?
input: standard, no. of problems and the data s... | [
"amengede27@outlook.com"
] | amengede27@outlook.com |
702780427e4c10ab4d552a875da97d10c06f1894 | 38cea84aad798112978e45e330792d50ec05bd3e | /game/client/c_vguiscreen.cpp | b27d2ea0f470e2d616dd1b4ff0dc861e10b56846 | [] | no_license | HL2-Ghosting-Team/src | 3822c5f7b621ef8e158fa7e2a74551c9cd81257f | 8c9e32e78a0f67591d6dd8a17cb77bc0ebf832b5 | refs/heads/master | 2022-06-25T01:15:20.989386 | 2022-06-16T19:58:43 | 2022-06-18T17:52:05 | 12,396,254 | 20 | 19 | null | 2022-06-18T17:52:06 | 2013-08-27T03:49:09 | C++ | WINDOWS-1252 | C++ | false | false | 26,018 | cpp | //========= Copyright © 1996-2005, Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
// $NoKeywords: $
//=============================================================================//
#include "cbase.h"
#include "networkstringtable_clientdll.h"
#include <KeyValues.h>
#include "PanelMetaClassMg... | [
"nkerns25@yahoo.com"
] | nkerns25@yahoo.com |
b9ef27592adb4cebed2b507e83eccb7b61d85d6e | 5816ebd0e1ae77a46ac9faf197e79ba50c06d5e8 | /src/object.hpp | 595d0396cf5cc196239e6b875abd272a5c77e789 | [] | no_license | isergeyam/mipt-comp-graph-hw2 | 9601fbfdb519f6e92e81d36a9ab8fa29d6769025 | 6d622144a9243a36a874f99793be49123c8054f2 | refs/heads/main | 2023-04-05T01:44:13.237367 | 2021-04-16T16:17:33 | 2021-04-16T16:17:33 | 358,652,358 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 739 | hpp | #pragma once
#include <GL/glew.h>
#include <glm/glm.hpp>
#include <random>
class Object {
public:
Object();
void draw();
glm::vec3 getObjectPosition();
public:
static bool init();
static void finalize();
public:
static constexpr float colliderRadius = 1.0f;
private:
glm::mat4 ModelMatrix;
glm::... | [
"isergey.am@gmail.com"
] | isergey.am@gmail.com |
71fccb19180890db4a57ae4c9b874038ee91ee80 | 9ac8b9942a7428c45f33e644005055ca6bf7897e | /Re audio/C_SDL.h | fdf15895c210f134a217433f2c324403d7528d62 | [] | no_license | Glitched-Manual/Downtime-1.0 | 26361b4d6eddc9489177cb87d98674250587d254 | 79c58f6b95fde4d864d431c0296da10c66807afe | refs/heads/master | 2020-04-02T05:13:05.601388 | 2018-10-22T01:50:18 | 2018-10-22T01:50:18 | 154,058,525 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,535 | h |
#pragma once
#ifndef _C_SDL_H
#define _C_SDL_H
#include <SDL.h>
#include <SDL_image.h>
#include <SDL_mixer.h>
#include <stdio.h>
#include <string>
#include <SDL_ttf.h>
#include <stdio.h>
#include <cstring>
#include <cmath>
#include <iostream>
#include <filesystem>
using std::cin;
using std::cout;
/*
*This source... | [
"popcorneater720@gmail.com"
] | popcorneater720@gmail.com |
98de1737f70ac6800ba95dcaeb23da257dee539e | 9b40f4863166327b0d51a83459ed8e271b4e8e57 | /Basic_Algorithm/kth.cpp | 0e5be390b72ab414ccc77105d608c7e79b1bb798 | [] | no_license | 3378950/Algorithm-Template | 20d576440eaca54d7497984112a1cc9174037ecb | 115254c9c1a325afdcaea76db031c646cbcc6783 | refs/heads/master | 2022-11-25T04:37:28.968518 | 2020-08-05T06:43:37 | 2020-08-05T06:43:37 | 261,932,020 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 577 | cpp | #include <iostream>
#include <algorithm>
const int N = 1e6 + 10;
int a[N];
int qs(int l, int r, int k) {
if(l >= r) return a[l];
int x = a[(l + r) >> 1], i = l - 1, j = r + 1;
while(i < j) {
do i++; while(a[i] < x);
do j--; while(a[j] > x);
if(i < j) std::swap(a[i], a[j]);
... | [
"374008063@qq.com"
] | 374008063@qq.com |
e6103434874e3f333c2383afe1c56c8198efbe41 | ba7f34c45b7bf65b9f38c1dd561d133fa645e540 | /include/Solver.h | b2fdb7f253ee732e524457970f30a4ae12009425 | [] | no_license | khbence/GSLMultiRoot | d363ea650e05b2c5d6ded571c4b79dcdbef9e806 | cb1ed0ec3df527c22756d23823c4902bd2195629 | refs/heads/master | 2021-05-16T21:28:38.344222 | 2020-03-27T09:19:44 | 2020-03-27T09:19:44 | 250,476,149 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,284 | h | #pragma once
#include <iostream>
#include "GSLVector.h"
#include <gsl/gsl_multiroots.h>
#include <memory>
//TODO make CRTP to reach F directly
class SimpleMethod {
protected:
using solverType = gsl_multiroot_fsolver;
static void deleteSolver(solverType* ptr) { gsl_multiroot_fsolver_free(ptr); }
solverType*... | [
"horvathb94@gmail.com"
] | horvathb94@gmail.com |
0c218f55cbc6b689c6ab1d5a8115aab99f73667e | 16bb1ca4f642a3d9132df34c1a7a9afbc69f1ac5 | /TommyGun/Plugins/CodeEditor/SevenuPImageParser/fSevenuPImageParserOptions.cpp | ad1cfd31d9e5ff8acb590629d972b2394565d979 | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | tonyt73/TommyGun | 6138b81b447da0b448bcecb893ed46cadcf56c80 | 19e704243bc02500193fe798bd3bee71f75de094 | refs/heads/master | 2023-03-17T10:19:08.971368 | 2023-03-11T23:39:37 | 2023-03-11T23:39:37 | 89,913,869 | 41 | 6 | NOASSERTION | 2023-03-11T22:41:39 | 2017-05-01T10:02:20 | C++ | UTF-8 | C++ | false | false | 10,269 | cpp | /*---------------------------------------------------------------------------
(c) 2004 Scorpio Software
19 Wittama Drive
Glenmore Park
Sydney NSW 2745
Australia
-----------------------------------------------------------------------------
$Workfile:: ... | [
"tonyt73@gmail.com"
] | tonyt73@gmail.com |
cba109b36f6963dc8e8298c4b76aaa24007486a3 | b91bf644e3ef5d78bda0fbf1c828386f343e1e36 | /LineParser.hh | fe698fc5a07b08671fdd5480de11cc6d994bd05d | [] | no_license | 1059444127/blobfs | 0db702ff9952091ae27ea35f7a4f1ecf6f4c8a53 | 53315a435f1778603f805ac7b2a8d21c0e5f7844 | refs/heads/master | 2021-01-01T18:40:13.344350 | 2009-01-28T15:35:03 | 2009-01-28T15:35:03 | 98,400,876 | 1 | 0 | null | 2017-07-26T08:47:34 | 2017-07-26T08:47:34 | null | UTF-8 | C++ | false | false | 3,620 | hh | #ifndef _LINEPARSER_HH_
#define _LINEPARSER_HH_
#include <stdarg.h>
#include <stdlib.h>
#include <exception>
#include <iostream>
#include <string>
using namespace std;
// TODO Move to util class?
static string buildMessage(const string msg, va_list ap)
throw()
{
size_t maxsize = 128;
char *buf = static_... | [
"arnaud.installe@pandora.be"
] | arnaud.installe@pandora.be |
93e138333d964ee625a02a4e24d029458863d65e | c6bea426cf51887127bfd39ab971ea950c94fe11 | /second-year/cpp/third-task/main.cpp | 49e2c665e4bc0d727e2f612198590b8d8ccbc85e | [] | no_license | nikiquark/nsu-tasks | 4abdc9db5a56570d283d10330f2c34683e71007b | 62c9f50917e23dcb3f0027f3b344b75c52f80ea1 | refs/heads/master | 2020-07-22T23:49:10.569237 | 2019-09-17T04:49:46 | 2019-09-17T04:49:46 | 207,373,268 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 42 | cpp | #include "ArrayStat.h"
int main() {
} | [
"nikiquark@gmail.com"
] | nikiquark@gmail.com |
9ee4fb4b534250186b7a7e09d9dc0246cbea7cc8 | 5dc4ea36514927efd678638e2095a4e8e32c0386 | /NPSVisor/SVisor/common/dlistchoose.cpp | 636f65c07f4a7c0c44ff7eaa88002fc2ebcb9aa3 | [
"Unlicense"
] | permissive | NPaolini/NPS_OpenSource | 732173afe958f9549af13bc39b15de79e5d6470c | 0c7da066b02b57ce282a1903a3901a563d04a28f | refs/heads/main | 2023-03-15T09:34:19.674662 | 2021-03-13T13:22:00 | 2021-03-13T13:22:00 | 342,852,203 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,329 | cpp | //------- dlistchoose.cpp ----------------------------------------------------
//----------------------------------------------------------------------------
#include "precHeader.h"
#include <stdio.h>
//----------------------------------------------------------------------------
#include "dlistChoose.h"
#include "1.h"
... | [
"npaolini@ennepisoft.it"
] | npaolini@ennepisoft.it |
ab61970b28dbaa12920b8cd77c570f3171ce3d1a | 50fd7caec8b1283e9753f012ef7767b626477545 | /BankAccount/BankAccount/BankAccunt.cpp | 05fe12583b8b96c09e7f9a14ea8b63121364b108 | [] | no_license | Rensy93/Repos | 611ea3bdb6275befe29d088c99e3bfbb81a95b31 | 18114f7e58624f1763146c220536ca0a9a3e5e93 | refs/heads/master | 2021-09-13T19:18:58.511880 | 2018-05-03T11:54:39 | 2018-05-03T11:54:39 | 111,279,329 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,213 | cpp | #include "BankAccunt.h"
#include <ctime>
#include <cstdlib>
BankAccunt::BankAccunt()
{
srand(time(0));
this->nameOfOwner = "?";
this->code = "0";
this->accountNr = rand() % 89999 + 10000;
this->balance = 0;
this->nrStatment = 0;
}
BankAccunt::BankAccunt(string nameOfOwner, string code)
{
srand(time(0));
t... | [
"rasmusflomen@live.se"
] | rasmusflomen@live.se |
68533218b82e229d5ec45dffdec6672d1130ed8f | c51febc209233a9160f41913d895415704d2391f | /library/ATF/_ATTACK_DELAY_CHECKERDetail.hpp | f54e1ed670971fed093b0aa8ff639d6c8af34504 | [
"MIT"
] | permissive | roussukke/Yorozuya | 81f81e5e759ecae02c793e65d6c3acc504091bc3 | d9a44592b0714da1aebf492b64fdcb3fa072afe5 | refs/heads/master | 2023-07-08T03:23:00.584855 | 2023-06-29T08:20:25 | 2023-06-29T08:20:25 | 463,330,454 | 0 | 0 | MIT | 2022-02-24T23:15:01 | 2022-02-24T23:15:00 | null | UTF-8 | C++ | false | false | 366 | hpp | // This file auto generated by plugin for ida pro. Generated code only for x64. Please, dont change manually
#pragma once
#include <common/common.h>
#include <_ATTACK_DELAY_CHECKERInfo.hpp>
START_ATF_NAMESPACE
namespace Detail
{
extern ::std::array<hook_record, 5> _ATTACK_DELAY_CHECKER_functions;
... | [
"b1ll.cipher@yandex.ru"
] | b1ll.cipher@yandex.ru |
5fd50bb635202758ce7f51d097d234ef2d9346fa | f89b03dd7ce186caf3f5e249cc0b63579ae22186 | /6.5.ExCriticalSection/Sample.cpp | cd1e27e4de79045ff69862efcab0523d58e6e541 | [] | no_license | yura0525/01_YuraHomework | cdf8c645c47c71f39bf7edf44093977b9c7d273c | 7f2a37ee19e1a00eb301ff676f7fbaf8f9954b22 | refs/heads/master | 2021-07-12T07:12:24.630819 | 2019-02-26T08:11:15 | 2019-02-26T08:11:15 | 146,382,373 | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 866 | cpp | #include <windows.h>
#include <stdio.h>
#define MAXCNT 100000000
CRITICAL_SECTION cs;
int g_count = 0;
DWORD WINAPI MyThread1(LPVOID arg)
{
for (int i = 0; i < MAXCNT; i++)
{
EnterCriticalSection(&cs);
g_count += 2;
LeaveCriticalSection(&cs);
}
return 0;
}
DWORD WINAPI MyThread2(LPVOID arg)
{
for (int i =... | [
"yura0525@naver.com"
] | yura0525@naver.com |
e5bcfd9847cae96d8882ded80b46e22c18aad7dd | 2a7e77565c33e6b5d92ce6702b4a5fd96f80d7d0 | /fuzzedpackages/jsonify/inst/include/jsonify/from_json/simplify/simplify.hpp | 7cf232e7d052d67c5c74af7ad14606033bb3f56b | [] | no_license | akhikolla/testpackages | 62ccaeed866e2194652b65e7360987b3b20df7e7 | 01259c3543febc89955ea5b79f3a08d3afe57e95 | refs/heads/master | 2023-02-18T03:50:28.288006 | 2021-01-18T13:23:32 | 2021-01-18T13:23:32 | 329,981,898 | 7 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 18,740 | hpp | #ifndef R_JSONIFY_FROM_JSON_SIMPLIFY_H
#define R_JSONIFY_FROM_JSON_SIMPLIFY_H
#include "rapidjson/document.h"
namespace jsonify {
namespace from_json {
// takes a list, where each element is the same TYPE and SIZE and simplifies to
// a vector
// requires each list element to be the same size
// param n is t... | [
"akhilakollasrinu424jf@gmail.com"
] | akhilakollasrinu424jf@gmail.com |
a318a117278ec3c61b0b9ef6ac6662667639a4a4 | 6631041fe2cd98c885cf004381a214c34bb62f0f | /App/DeckLinkDemo/StreamReceiverSrc/TMReceiverSrc.cpp | 175eb135341d8feececa969897afda6a0566a1e1 | [] | no_license | usher2007/Navigation | 05b5e227b9123f455deba3fb0a07392eb8f4d9ff | 1c18ee12ba23c33c3f34d06ac0fd50f89203e79f | refs/heads/develop | 2021-01-23T14:57:07.800809 | 2013-04-17T09:37:21 | 2013-04-17T09:37:21 | 2,854,394 | 4 | 13 | null | 2014-08-19T07:01:10 | 2011-11-26T06:15:08 | C++ | MacCentralEurope | C++ | false | false | 40,289 | cpp | #include "stdafx.h"
#include <streams.h>
#include "TMReceiverSrc.h"
static const LONGLONG ONESEC = 10000000;
static const int FPS = 25;
static const int DEFAULT_WIDTH = 720;
static const int DEFAULT_HEIGHT = 576;
static const CRefTime Offset = ONESEC/FPS;
DWORD ReaderProc(LPVOID pParam);
const AMOVIESETUP_MEDIATYPE s... | [
"usher2007@foxmail.com"
] | usher2007@foxmail.com |
ddbbd358a087b0068f9bbdb46e73d6e324d41906 | ece46d54db148fcd1717ae33e9c277e156067155 | /SDK/arxsdk2011/samples/database/tbliter_dg/tbliter.cpp | 5be96a58e6e9f2f50b3392df7f335bbb1fd44872 | [] | no_license | 15831944/ObjectArx | ffb3675875681b1478930aeac596cff6f4187ffd | 8c15611148264593730ff5b6213214cebd647d23 | refs/heads/main | 2023-06-16T07:36:01.588122 | 2021-07-09T10:17:27 | 2021-07-09T10:17:27 | 384,473,453 | 0 | 1 | null | 2021-07-09T15:08:56 | 2021-07-09T15:08:56 | null | UTF-8 | C++ | false | false | 3,458 | cpp | // (C) Copyright 1996-2006 by Autodesk, Inc.
//
// Permission to use, copy, modify, and distribute this software in
// object code form for any purpose and without fee is hereby granted,
// provided that the above copyright notice appears in all copies and
// that both that copyright notice and the limited warranty ... | [
"zhangsensen@zwcad.com"
] | zhangsensen@zwcad.com |
ad8ef040508d084a00ec2e566400d1aa8aa1f807 | 31475b58b676a174d89b3130f869656366dc3078 | /fm_model/oct_tree.cpp | fc390787b37b6e90a00788221856f9780fca1070 | [] | no_license | cooper-zhzhang/engine | ed694d15b5d065d990828e43e499de9fa141fc47 | b19b45316220fae2a1d00052297957268c415045 | refs/heads/master | 2021-06-21T07:09:37.355174 | 2017-07-18T14:51:45 | 2017-07-18T14:51:45 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 17,882 | cpp | //--------------------------------------------------------------------
// 文件名: oct_tree.cpp
// 内 容:
// 说 明:
// 创建日期: 2011年8月30日
// 创建人: 陆利民
// 版权所有: 苏州蜗牛电子有限公司
//--------------------------------------------------------------------
#include "oct_tree.h"
#include "math_3d.h"
#include "model_player.h"
#include ".... | [
"1542971595@qq.com"
] | 1542971595@qq.com |
03ecbe1c081066592dabb02bc51916ee09eb0384 | a0dbfb684fade8bd01b3729c561ebb382303be75 | /LIB/tubemodel_3.01_win/6C4.inc | 12d3a85863e8942c1ebc2d7446fcf3fb2fe0aef0 | [] | no_license | sa66ath/LTSpice | 4bfd129d7bb05e05f3c860d2f6208c0aecacb3be | fe5c38508f0498e6fd065c0fcd60bf5dd980c72e | refs/heads/master | 2021-06-26T10:09:26.590934 | 2017-09-13T08:36:24 | 2017-09-13T08:36:24 | 103,091,498 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 789 | inc | *
* Generic triode model: 6C4
* Copyright 2003--2006 by Ayumi Nakabayashi, All rights reserved.
* Version 3.01, Generated on Wed Mar 22 17:19:50 2006
.SUBCKT 6C4 A G K
BGG GG 0 V=V(G,K)+0.736372
BEP EP 0 V=URAMP(V(A,K))+1e-10
BEG EG 0 V=URAMP(V(G,K))+1e-10
BM1 M1 0 V=(0.038076967*(URAMP(V(EP)-1e-10)+1e-... | [
"sa66ath@yahoo.co.jp"
] | sa66ath@yahoo.co.jp |
a8e9337b4ab9b5567f720b5f675083691cfdad04 | 6acd44f44879352cf0dced0ce6735a47d76332b5 | /TestingGrounds/TestingGrounds.cpp | de164b2ba0f09c6bbc52a8eaac9365205e89f8d6 | [] | no_license | Timothy-Hagler/StoreDatabase | 3f7cf7341a932b0243ef58282ce6433831d42acc | 07ecafa485f038a12fc07b778ce89a3ee293605d | refs/heads/master | 2023-01-07T22:03:34.042021 | 2020-11-09T17:21:31 | 2020-11-09T17:21:31 | 289,564,415 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 820 | cpp | // TestingGrounds.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
/*#include <iostream>
int main()
{
std::cout << "Hello World!\n";
}
// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu
// Tips for Getti... | [
"tmhglr@gmail.com"
] | tmhglr@gmail.com |
1c5f03f4c027aebb3ceef77c66ebe91c9705f678 | 761c1ae19594e49d7047d059b25640c3e558f3d5 | /Facebook/238. Product of Array Except Self.cpp | 4436c043df57594990756fb089a37195dd9b6ce4 | [] | no_license | SunNEET/LeetCode | a09772c4f3c23788afebceb4f6c2150d3c127695 | 96b08c45f5241579aaf27625510570d718965ec2 | refs/heads/master | 2020-03-12T15:43:07.019708 | 2019-06-25T03:53:56 | 2019-06-25T03:53:56 | 130,697,627 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,707 | cpp | // O(n) time and O(n) space
class Solution {
// 假如我們有 nums = [a,b,c,d,e] 五個數，要讓他們乘上不同的數 x[i] 後的乘積都會一樣大。
// 直覺做法是，讓他乘起來會變成 a*b*c*d*e，因為這是個保證大家都可以乘出來的數字。
// 而要乘出這個數自然就是用 a[i]本身 乘上 剩下的部分。
// E.g. a[2] = c 要變成 a*b*c*d*e ，還需要乘 a*b 和 d*e，而在處理這個剩下的部分有個技巧
// 就是用兩個 array 紀錄從左乘到右 (a*b*....) 和 從右乘到左 (e*d*... | [
"sunnyinvadeher@gmail.com"
] | sunnyinvadeher@gmail.com |
2585fbe1f3144be098cc023825cf2e62ed851410 | 43c90833ed09d0358c78408663ebd8b231a2b055 | /Lib/CosmoBolognaLib/Headers/Lib/TwoPointCorrelation_multipoles.h | c6c31a4df4e60250f31267af7f62aae6f51156ca | [] | no_license | ready4euclid/pipeline | 7b45c9b41e4c701d3c5b85bfc1130960c3f484e0 | cdc51fbeb11869a1e006ae1bc24b50dfae6fc48a | refs/heads/master | 2021-01-15T15:52:04.866110 | 2016-11-30T10:30:55 | 2016-11-30T10:30:55 | 51,307,731 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 23,266 | h | /********************************************************************
* Copyright (C) 2010 by Federico Marulli and Alfonso Veropalumbo *
* federico.marulli3@unibo.it *
* *
* This program is free software; you c... | [
"federico.marulli3@unibo.it"
] | federico.marulli3@unibo.it |
a6c608634456a81fc320854aabc7dfe01a4827cc | 2b354b4180af895e1042a9e596b8d5abdc88d9c8 | /lib/assembler/include/assembler.h | 04010f7ac8f751eccc5ee8d5802fee2aefcc8e04 | [
"MIT"
] | permissive | lschiavini/Hypothetical-Language-Assembler | cd222ff9fdada2e6d83bc95f494e71fad2f6f064 | e47f01241bbb4ac0251e58d7e016c252a2d2d434 | refs/heads/main | 2023-08-15T01:05:43.056539 | 2021-09-16T03:25:13 | 2021-09-16T03:25:13 | 404,135,225 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,678 | h | #pragma once
#ifndef ASSEMBLER_H
#define ASSEMBLER_H
#include <fstream>
#include <iostream>
#include <map>
#include <symboltable.h>
#include <string>
#define ADDRESS_FILELINE 0
#define OPCODE_FILELINE 1
#define ARG1_FILELINE 2
#define ARG2_FILELINE 3
#define DESIRED_ADDRESS 0
#define ADDRESS_KEY 1
typedef std::vect... | [
"lucaschiavini@hotmail.com"
] | lucaschiavini@hotmail.com |
e8415b3bec7ab682ad47de1d21d1c02777c0f59c | b35b0e874c2d04e68fab4c6fd75023fb407c2965 | /pegasus/src/Pegasus/Compiler/cimmofMessages.cpp | ee2f15fc5f809790bf51b6ebaa7cd25af9d74b93 | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | xenserver/openpegasus | 38de7f2062adf1f039ef9ead222c40d75d8acaaa | 57e10a2ca29c17e5dca26a1c6c40a1a5fc4ba20d | refs/heads/master | 2020-05-17T16:22:40.019817 | 2013-11-19T00:42:25 | 2014-04-07T16:25:45 | 10,623,043 | 3 | 2 | null | 2013-12-04T14:44:02 | 2013-06-11T14:19:20 | C++ | UTF-8 | C++ | false | false | 9,191 | cpp | //%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... | [
"rob@rdobson.co.uk"
] | rob@rdobson.co.uk |
2a8571f9b486fc1c73f101939fabc120595c2a94 | 065ed4355f638371a545284bd91a973b6a42e0e9 | /test/edyn/parallel/test_registry_delta.cpp | 82447ce88e838d42f12f0e120562fc010b63f384 | [
"MIT"
] | permissive | brucelevis/edyn | 6825c8df07e5362ffe646e83ada61fddecee62f7 | 832eeb52eed0e0963fe93fcf741364f42e718b45 | refs/heads/master | 2023-02-10T09:03:00.302800 | 2021-01-12T05:02:07 | 2021-01-12T05:02:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,598 | cpp | #include "../common/common.hpp"
#include <tuple>
#include <memory>
struct custom_component {
edyn::scalar value;
entt::entity entity;
};
// `custom_component` needs a custom merge function to map its entity into the
// context of the other registry where it's being imported into.
namespace edyn {
template... | [
"xissburg@xissburg.com"
] | xissburg@xissburg.com |
6028c60cc6f57e3a21419cdb1b955159dfdc4101 | 3cc7601427169f882d05e65fd5a396d26e53fa04 | /Encodes/Base32/stdafx.cpp | d75e26b5754ebd7ae3e56cdf5cf9b79a51c3b866 | [] | no_license | kkfnui/Experiments | 9a4ff1e9bd9d6e7861328b75e88324ff7b1afab6 | 94c335d0962b0faeba14ef45e4a2932c0d4beab5 | refs/heads/master | 2021-01-20T04:32:41.184724 | 2015-11-01T14:48:40 | 2015-11-01T14:48:40 | 3,078,990 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 274 | cpp | // stdafx.cpp : source file that includes just the standard includes
// Base32.pch will be the pre-compiled header
// stdafx.obj will contain the pre-compiled type information
#include "stdafx.h"
#if (_ATL_VER < 0x0700)
#include <atlimpl.cpp>
#endif //(_ATL_VER < 0x0700)
| [
"kkfnui@gmail.com"
] | kkfnui@gmail.com |
6c7127d1dfeb09ad2d4fb14b50d4325c9e43ce13 | e4cba428476da6e6a1b08483cf7ab459fe5534d9 | /Source/RendererGL/Mesh/VertexBuffer.cpp | 04de7e1284ba8f7f4b9d4121f58b8066d34ac858 | [] | no_license | wolves3d/idea | c69fcf1e72da322b6bd150b73d55c14f854ae32f | 72c6b03996acb911b80e829a7821814b6ef77787 | refs/heads/master | 2020-05-18T17:51:10.076203 | 2015-08-14T20:30:20 | 2015-08-14T20:30:20 | 38,781,205 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 14,360 | cpp | ////////////////////////////////////////////////////////////////////////////////
#include "Common.h"
/**
*
*/
const byte * GetMemPointer( const IIndexBuffer * pBuffer );
/**
*
*/
class CVertexBuffer : public IVertexBuffer
{
friend CRenderer_GL;
//-----------------------------------------------... | [
"wolves3d@gmail.com"
] | wolves3d@gmail.com |
bdee3708d231d7383f293a0edfaf595e0b066915 | 51635684d03e47ebad12b8872ff469b83f36aa52 | /external/gcc-12.1.0/libstdc++-v3/testsuite/21_strings/basic_string_view/operations/starts_with/wchar_t/1.cc | 6ff55b787f60aac059c9c958e5db66c4a9524761 | [
"LGPL-2.1-only",
"GPL-3.0-only",
"GCC-exception-3.1",
"GPL-2.0-only",
"LGPL-3.0-only",
"LGPL-2.0-or-later",
"Zlib",
"LicenseRef-scancode-public-domain"
] | permissive | zhmu/ananas | 8fb48ddfe3582f85ff39184fc7a3c58725fe731a | 30850c1639f03bccbfb2f2b03361792cc8fae52e | refs/heads/master | 2022-06-25T10:44:46.256604 | 2022-06-12T17:04:40 | 2022-06-12T17:04:40 | 30,108,381 | 59 | 8 | Zlib | 2021-09-26T17:30:30 | 2015-01-31T09:44:33 | C | UTF-8 | C++ | false | false | 1,695 | cc | // { dg-options "-std=gnu++2a" }
// { dg-do compile { target c++2a } }
// Copyright (C) 2018-2022 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as publis... | [
"rink@rink.nu"
] | rink@rink.nu |
9a9e35f8d633c5524062673ec0e3eeb389284214 | ea19a24083f99895f1313a6a958037fa99ef08f0 | /HWPrograms/forHW4/x.cpp | c6982a795b98bcd7e189bdec4c7f1918064014d0 | [] | no_license | hanji117/dataStructuresCplusPlus | a908bbef72aace731736c5332b2b239239dcc122 | 206e9b3046146e6ca449af0206a9121e817990c4 | refs/heads/master | 2021-05-01T21:00:45.474968 | 2018-02-10T00:21:03 | 2018-02-10T00:21:03 | 120,969,825 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,435 | cpp | // delete
// insert
// in order
using namespace std;
#include <iostream>
#include "binstree.h"
// constructor initializes Root
BST::BST()
{
Root = NULL; // This is an empty tree
}
// destructor must completely destroy the tree
BST::~BST()
{
dtraverse(Root); // traverse to delete all vertices in post order
... | [
"cruz085@empress.csusm.edu"
] | cruz085@empress.csusm.edu |
6d47c1b2656d1edcc9b9a5a62b91f09f33865cdf | f3e4c254c214111fbefb8f54de3fd3bddcb13014 | /PolarPong/MovementEvent.hpp | e1e7c8891284864ca9ba891c8236126adb319a95 | [] | no_license | gozzle/polarPong | ca1e96b2d5bd14e3e4a0dfb86d108231876f551f | 38a99a7a4bae4106670198b1e8847b6bf572b22b | refs/heads/master | 2020-04-06T04:55:55.173353 | 2012-06-01T09:00:02 | 2012-06-01T09:00:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,257 | hpp | //
// MovementEvent.hpp
// PolarPong
//
// Created by Callum Chalk on 13/05/2012.
// Copyright (c) 2012 __MyCompanyName__. All rights reserved.
//
#ifndef PolarPong_MovementEvent_hpp
#define PolarPong_MovementEvent_hpp
#include "Event.hpp"
#include <tr1/unordered_map>
class MovementEvent : Event {
public:
en... | [
"callum.chalk@hotmail.com"
] | callum.chalk@hotmail.com |
c3cb8ed9c2210a92be7cf96da51afdfd3ccf779a | b87b99a79fa63668854ad3d831cbb968b86160a4 | /surface/material/SolidMaterial.cpp | df7d1ef3b85621163adc9c00496a605a03c601a9 | [] | no_license | erkansari/ray_tracer | 2a5dd79c94a28aec43806faa1b2b7941e27ca7a6 | a69281fc325c403379d3a6825844012d80afca9e | refs/heads/master | 2022-11-20T00:24:02.933199 | 2020-07-13T11:01:23 | 2020-07-13T11:01:23 | 278,351,860 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 297 | cpp | #include "SolidMaterial.h"
SolidMaterial::SolidMaterial(Phong phong, double reflectance, double transmittance, double refraction, Vec3<float> color):
Material(phong, reflectance, transmittance, refraction)
{
this->color = color;
}
Vec3<float> SolidMaterial::getColor()
{
return this->color;
} | [
"a11907632@unet.univie.ac.at"
] | a11907632@unet.univie.ac.at |
8c01b1e1b8752e3299df2fae8986e80f02e4876b | bf8fd2eb2530c98d24a30af1074afd1a58a165d9 | /Source/DemoScene/BaseVector3.h | 2e6a5b5273ed3e74e2019029a33ce8cdd4a9f0ec | [
"MIT"
] | permissive | ookumaneko/PC-Psp-Cross-Platform-Demoscene | 1b4a947c82b4efa381f3aba809d20a97e3d285b1 | 0c192f9ecf5a4fd9db3c9a2c9998b365bf480c1e | refs/heads/master | 2020-05-30T20:55:08.570718 | 2015-04-07T11:43:40 | 2015-04-07T11:43:40 | 33,538,146 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 581 | h | #ifndef _BASE_VECTOR_3
#define _BASE_VECTOR_3
#ifdef _PSP_VER
#include <libgum.h>
#else
#include <D3dx9math.h>
#endif
class BaseVector3
{
protected:
BaseVector3(void) {}
public:
virtual ~BaseVector3(void) {}
public:
#ifdef _PSP_VER
ScePspFVector3& GetVector(void) { return _vec; }
const ScePsp... | [
"shanageek@gmail.com"
] | shanageek@gmail.com |
2375fcddd06631ceb88639528279136ef2b808d2 | f0bd42c8ae869dee511f6d41b1bc255cb32887d5 | /Codeforces/909B. Segments.cpp | fd6b99cfa6fe24bc82292418474a8d17aa66e11d | [] | no_license | osamahatem/CompetitiveProgramming | 3c68218a181d4637c09f31a7097c62f20977ffcd | a5b54ae8cab47b2720a64c68832a9c07668c5ffb | refs/heads/master | 2021-06-10T10:21:13.879053 | 2020-07-07T14:59:44 | 2020-07-07T14:59:44 | 113,673,720 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 696 | cpp | /*
* 909B. Segments.cpp
*
* Created on: Dec 27, 2017
* Author: Osama Hatem
*/
/*
http://codeforces.com/blog/entry/56666
My solution is based on the same idea (overlapping segments must belong to
different layers), but I just count the maximum overlap in O(N^3) due to the
small constraints.
*/
#include <b... | [
"osama@elysian.team"
] | osama@elysian.team |
cff9b2d0870a02c9d769d1c5a11772d0198dd48e | 456551bbf0c752075d23e2dd348d9bf09533c40f | /ABC/156/e.cpp | b88cc587d441b33b4efa6d1f487e2e0d32fd1b57 | [] | no_license | skjmp/ProCon | 5bed08c6efdc202d5f7d6038cd7a99d9c59d58f0 | b9971b374d45499f22e6eb0107473ca37ca46591 | refs/heads/master | 2020-03-27T20:12:38.044762 | 2020-03-01T11:42:03 | 2020-03-01T13:49:31 | 147,048,755 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,484 | cpp | #include <bits/stdc++.h>
#define REP(i, a, n) for (long long i = (a); i < (long long)(n); ++i)
#define REPC(i, a, n) for (long long i = (a); i <= (long long)(n); ++i)
#define ALL(t) t.begin(), t.end()
#define RALL(t) t.rbegin(), t.rend()
#define MATINIT(type, row, col, init) \
vector<vector<type>>(row, vector<type>(c... | [
"2036oshmkufafg36@gmail.com"
] | 2036oshmkufafg36@gmail.com |
444c02cfcc2cf0429f2ced4fccb56df60093482a | a92eca8084a4100267555c9f0c11e0bb702675f9 | /cplusplus/class/friend.cpp | 38990f6af2a70d1d212cd006c6821026f54594c2 | [] | no_license | victorygogogo/LearnAndTry | ceabddd02b9feb751c6c3f0e0713b1c9683b4869 | 8d2f651ca8b14986f920c5c6fbbc42e1be8eb7fb | refs/heads/main | 2023-06-28T22:03:20.295098 | 2021-07-21T08:58:11 | 2021-07-21T08:58:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,383 | cpp | #include <iostream>
using namespace std;
//友元的作用是为了让一个类的私有属性可以在类外被访问
// 三种实现方式
// 1.全局函数作友元
// 2.类作友元
// 3.成员函数作友元
class goodgay2;
class Person {
friend void g_fun(
Person& p); //在类里设置该全局函数的声明为友元,可访问该类的私有属性
friend class goodgay; //在类里设置另一个类的声明为友元,可访问该类的私有属性
friend void goodgay2::visit(
Person& p);... | [
"hsqyc@163.com"
] | hsqyc@163.com |
eabdfb4af6ff5b44a04ad149d16c746d63a03aa3 | 2274aa4ef2e0069aa770d7f5f28aa3dd0c6e275b | /3SumClosest.cpp | 33ef457d28638de835f93cc0059ea69629be558b | [] | no_license | zhaoxiaohui/LeetCode | 0b68349aac6431df5f06baea9202c520cab5a01f | 13a2be605070f7d4e7f8798b8d312e91de78fd45 | refs/heads/master | 2021-01-10T01:45:55.062641 | 2016-01-25T03:51:11 | 2016-01-25T03:51:11 | 45,035,293 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 868 | cpp | /**
* Description:
* Author: zhaoxiaohui
* Site: zhaoxiaohui.sinaapp.com
* Date: 2014
*/
class Solution {
public:
int threeSumClosest(vector<int> &num, int target) {
sort(num.begin(), num.end());
int n = num.size();
int left = 0, right, middle, dis, sum, ret_sum=INT_MAX, ret;
w... | [
"fire.guy@163.com"
] | fire.guy@163.com |
f9f875b5245dbba9ec15f084cff67eaffed0450e | 814bb0707527fed31cbacbb8048ec4f7859b96f3 | /src/main.cc | f9d89a020347200e72df1aabfc35277668c381c6 | [
"MIT"
] | permissive | thomas-joubert/Sokoban | a38a0400988a85216b858b95e8f0c7870f40b39e | b3b92bdb02dbce466bf6c47067f99af8dcf7e687 | refs/heads/master | 2023-08-18T20:14:34.132191 | 2023-08-03T20:41:49 | 2023-08-03T20:41:49 | 272,073,337 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,300 | cc | #include <SFML/Graphics/Texture.hpp>
#include <SFML/Window.hpp>
#include <SFML/Graphics/Sprite.hpp>
#include <SFML/Graphics/RenderWindow.hpp>
#include <SFML/System/Vector2.hpp>
#include <SFML/Window/Keyboard.hpp>
#include <SFML/Graphics/Vertex.hpp>
#include <SFML/Graphics/VertexArray.hpp>
#include <SFML/Graphics/Shape.... | [
"thomas.joubert@epita.fr"
] | thomas.joubert@epita.fr |
d9cb2882f382d79555bd2f4bd79d56e9cccafd46 | bebe0ece30df465bdab906aaed600e357ae89233 | /TCPIP/MainTCP.cpp | f7e858ca5502d738adc75a5ad294f38de7a63eb2 | [
"MIT"
] | permissive | Patrick-Gourdet/BasicVulnerabilityChecker | 2b7cf2fcbf7f330131484b775e23084b8773813d | 27eb07df8a913b0ec12bacd95782b6946ab0012e | refs/heads/master | 2022-04-28T01:08:15.636548 | 2020-04-26T14:51:16 | 2020-04-26T14:51:16 | 258,628,983 | 0 | 0 | null | 2020-04-25T16:47:49 | 2020-04-24T21:31:42 | C# | UTF-8 | C++ | false | false | 1,647 | cpp | //---cat rawtcp.c---
// Run as root or suid 0, just datagram no data/payload
#include <Winsock2.h>
//#include <unistd.h>
//#include <netinet/ip.h>
//#include <netinet/tcp.h>
//#include <sys/socket.h>
// Packet length
#define PCKT_LEN 8192
// May create separate header file (.h) for all
// headers' structures
// IP head... | [
"admin@irondigital.com"
] | admin@irondigital.com |
66dd42cb33b1a2410da464bb90cade370335fd8f | 809bbbddf5f4abdf8f85a6591df61fcf11f52ce0 | /05_05_pool/src/libs/libserver/connect_obj.cpp | a0566ea86c50ac99c9ead36deadcbee29e23a840 | [
"MIT"
] | permissive | KMUS1997/GameBookServer | 542df52ac3f7cb1443584394e3d8033dbb2d29e3 | 6f32333cf464088a155f0637f188acd452b631b7 | refs/heads/master | 2023-03-15T18:52:23.253198 | 2020-06-09T01:58:36 | 2020-06-09T01:58:36 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,922 | cpp | #include "connect_obj.h"
#include "network.h"
#include "network_buffer.h"
#include "packet.h"
#include "thread_mgr.h"
#include "object_pool_interface.h"
ConnectObj::ConnectObj(IDynamicObjectPool* pPool) :ObjectBlock(pPool)
{
_pNetWork = nullptr;
_socket = INVALID_SOCKET;
_recvBuffer = new RecvNetworkBuf... | [
"setup_pf@hotmail.com"
] | setup_pf@hotmail.com |
114ee26a9a472f759229f9ca6f96f75c22f0e041 | 4508de1150e176b51a20dedc9e4f9a25b14b7239 | /src/ReportR.h | 475077a444942bc86bb054d05800e592aae4a084 | [] | no_license | rscharpf/XDE | cb5a5b8bae6a937f02266cfa5a532732c5eb8a9c | 0459396ef32086488527c2b9fe8909fb3d3ebc0f | refs/heads/master | 2021-05-15T02:05:36.722648 | 2017-09-28T23:56:24 | 2017-09-28T23:56:24 | 2,355,265 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 969 | h | #ifndef REPORTR_H
#define REPORTR_H
#include "Report.h"
class ReportR : public Report
{
public:
ReportR(const string &filename);
ReportR(double *value);
~ReportR(void);
void report(const Structure *str);
private:
int writeToFile;
double *value;
int nr;
};
inline ReportR::ReportR(const string &... | [
"p.aboyoun@bc3139a8-67e5-0310-9ffc-ced21a209358"
] | p.aboyoun@bc3139a8-67e5-0310-9ffc-ced21a209358 |
1415c74a4edc386720c997f6f9d8a80792922774 | 3da0b0276bc8c3d7d1bcdbabfb0e763a38d3a24c | /zju.finished/1601.cpp | 475cf6e91f28f099361a4684932be65d6a0f3afe | [] | no_license | usherfu/zoj | 4af6de9798bcb0ffa9dbb7f773b903f630e06617 | 8bb41d209b54292d6f596c5be55babd781610a52 | refs/heads/master | 2021-05-28T11:21:55.965737 | 2009-12-15T07:58:33 | 2009-12-15T07:58:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 754 | cpp | #include<cstdio>
#include<cmath>
/*看了别人的代码，设置了A*L<=1 和 A>=L的情况*/
using namespace std;
double A;
int L;
void fun(){
if(A * L <= 1){
printf("%d %d\n",1,L);
return;
}
if(A >= L){
printf("%d %d\n",L,1);
return;
}
int a,b;
int sa=0,sb=1;
double eps = A,t;
for... | [
"zhouweikuan@gmail.com"
] | zhouweikuan@gmail.com |
c36b3a7ae2ad70d511571a414c182e206f6b7d78 | 30bdd8ab897e056f0fb2f9937dcf2f608c1fd06a | /scrape/data/Tokitsukaze and Discard Items/haomie_TLE.cpp | 0e9d73c490cc5f27e8b0176cf2150ff3698a3775 | [] | no_license | thegamer1907/Code_Analysis | 0a2bb97a9fb5faf01d983c223d9715eb419b7519 | 48079e399321b585efc8a2c6a84c25e2e7a22a61 | refs/heads/master | 2020-05-27T01:20:55.921937 | 2019-11-20T11:15:11 | 2019-11-20T11:15:11 | 188,403,594 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 687 | cpp | #include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<deque>
#include<string>
using namespace std;
int main()
{
#ifdef local
freopen("1.txt","r",stdin);
#endif
long long n,m,k,num;
cin>>n>>m>... | [
"harshitagar1907@gmail.com"
] | harshitagar1907@gmail.com |
c9396978274982c96ff8a02daa546bea94ac9044 | 7e686824108f22f095a89860b235cc1267e6d32f | /src/consensus/merkle.cpp | f246a8cf3e89e15fbe3d5c7c8811699580956324 | [
"MIT"
] | permissive | alleck/Splendid | 2aace2cf675233c3c435c4eab4aedf8b32f23347 | 8ea29bda381628f954d1699a38a70c3ae3506ed9 | refs/heads/main | 2023-03-20T11:20:13.567687 | 2021-02-22T21:56:34 | 2021-02-22T21:56:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,796 | cpp | // Copyright (c) 2015-2016 The Bitcoin Core developers
// Copyright (c) 2017-2019 The Splendid Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "merkle.h"
#include "hash.h"
#include "utilstrencodings.h"
... | [
"79376856+SplendidProject@users.noreply.github.com"
] | 79376856+SplendidProject@users.noreply.github.com |
465373fe284d301226dd36ae09427d90ffe99f7c | 775acebaa6559bb12365c930330a62365afb0d98 | /source/sdksamples/basicshape/BscShpID.cpp | fb3341a6cd1b8ca7feea4757bfb0dae762f6ed12 | [] | no_license | Al-ain-Developers/indesing_plugin | 3d22c32d3d547fa3a4b1fc469498de57643e9ee3 | 36a09796b390e28afea25456b5d61597b20de850 | refs/heads/main | 2023-08-14T13:34:47.867890 | 2021-10-05T07:57:35 | 2021-10-05T07:57:35 | 339,970,603 | 1 | 1 | null | 2021-10-05T07:57:36 | 2021-02-18T07:33:40 | C++ | UTF-8 | C++ | false | false | 1,177 | cpp | //========================================================================================
//
// $File: //depot/devtech/16.0.x/plugin/source/sdksamples/basicshape/BscShpID.cpp $
//
// Owner: Adobe Developer Technologies
//
// $Author: pmbuilder $
//
// $DateTime: 2020/11/06 13:08:29 $
//
// $Revision: #2... | [
"75730278+Tarekhesham10@users.noreply.github.com"
] | 75730278+Tarekhesham10@users.noreply.github.com |
87500661294c71adb45d587c92f9d8a2a7bf07cf | 46f53e9a564192eed2f40dc927af6448f8608d13 | /chrome/browser/safe_browsing/database_manager_unittest.cc | a3e2e710e486dc0fb05389102b165a6f79d46e0b | [
"BSD-3-Clause"
] | permissive | sgraham/nope | deb2d106a090d71ae882ac1e32e7c371f42eaca9 | f974e0c234388a330aab71a3e5bbf33c4dcfc33c | refs/heads/master | 2022-12-21T01:44:15.776329 | 2015-03-23T17:25:47 | 2015-03-23T17:25:47 | 32,344,868 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 9,360 | cc | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <string>
#include <vector>
#include "base/memory/ref_counted.h"
#include "base/memory/scoped_ptr.h"
#include "base/run_loop.h"
#include "chrome/... | [
"scottmg@chromium.org"
] | scottmg@chromium.org |
9ca91dc64c88db274659b853e98f7c1ca766e01b | 44a09c05c678705b39d12bc3de282a0e800b1779 | /Coin Change (II).cpp | 2bcfd8c6b49fc1e4a50f7aeb8de8f886f276b56b | [] | no_license | sohelarman1100/Dynamic-Programming | 70af7edee1df78f326193f6375781e62a958cc27 | cc56e25c1b2d4c33ce1f7f4e77ff83b65ffe0c94 | refs/heads/master | 2023-03-22T05:29:21.964627 | 2021-03-18T09:39:30 | 2021-03-18T09:39:30 | 343,735,436 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 662 | cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define mod 100000007
int main()
{
ll t,c;
ll tot[10005];
cin>>t;
for(c=1; c<=t; c++)
{
ll i,j,k,l,m,n;
cin>>n>>k;
ll val[n+1];
for(i=1; i<=n; i++)
... | [
"armanhossain54546@gmail.com"
] | armanhossain54546@gmail.com |
70989128366a49ebbea45c69fb85d68d05b95451 | 003fb5094021351eb82c49c8eadbb6dd5b139004 | /006_BAEKJOON/09461.cpp | c9e3593e1d39f3b3f15672e801231af3d69418be | [] | no_license | woongbinni/algorithm | ebdb700195ccc158f7be1ebf7af06e9913d4e8fd | a1d5c0bc8b727d4feea670ea35218e701e0ffdb4 | refs/heads/master | 2022-11-16T23:40:44.628307 | 2022-11-11T15:21:26 | 2022-11-11T15:21:26 | 32,263,313 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 291 | cpp | #include <stdio.h>
unsigned long long P[101];
int main(){
int T;
int N;
P[1] = 1;
P[2] = 1;
P[3] = 1;
for(int i=4; i<=100; ++i){
P[i] = P[i-2] + P[i-3];
}
scanf("%d", &T);
for(int i=0; i<T; ++i){
scanf("%d", &N);
printf("%llu\n", P[N]);
}
return 0;
} | [
"woongbinni@gmail.com"
] | woongbinni@gmail.com |
783838f34e16f8a7bc48da95cfc4839e9d267a4d | 8c8820fb84dea70d31c1e31dd57d295bd08dd644 | /Core/Private/Misc/Crc.cpp | 6f6da69421451642ddd79710eda91fd98994e73b | [] | no_license | redisread/UE-Runtime | e1a56df95a4591e12c0fd0e884ac6e54f69d0a57 | 48b9e72b1ad04458039c6ddeb7578e4fc68a7bac | refs/heads/master | 2022-11-15T08:30:24.570998 | 2020-06-20T06:37:55 | 2020-06-20T06:37:55 | 274,085,558 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 57,988 | cpp | // Copyright Epic Games, Inc. All Rights Reserved.
#include "Misc/Crc.h"
#include "Templates/AlignmentTemplates.h"
#include "Templates/UnrealTemplate.h"
#include "Misc/ByteSwap.h"
/** CRC 32 polynomial */
enum { Crc32Poly = 0x04c11db7 };
uint32 FCrc::CRCTable_DEPRECATED[256] =
{
0x00000000, 0x04C11DB7, 0x09823B6E,... | [
"wujiahong19981022@outlook.com"
] | wujiahong19981022@outlook.com |
f320e1a084b5417e61e3a6f3bdc6b92cba1eb366 | 7c8f97296914cc3cb0a0eb9872ec96c77c107aee | /CartesianTree2/MyVector.cpp | 28328d7fccf61cfb1303b888520dee4d0a3a71b3 | [] | no_license | Boialex/Algorithms | 17d406ebc0a8b0ffe1d44fdbe2cd06ecbf90e253 | 9b0e77189e30682b3597547051a08f97896bbafc | refs/heads/master | 2020-12-31T00:29:49.346091 | 2017-03-19T15:36:48 | 2017-03-19T15:36:48 | 85,487,695 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,081 | cpp | #include "stdafx.h"
#include "MyVector.h"
void MyVector::Insert(int key, size_t position) {
array.push_back(key);
for (int i = position; i < array.size(); ++i)
std::swap(array[i], array[array.size() - 1]);
}
void MyVector::Output() {
for (std::vector<int>::iterator i = array.begin(); i < array.end(); ++i)
std:... | [
"xdr007@gmail.com"
] | xdr007@gmail.com |
61633cfb06809a666fecaeb7f710ed22f6cefa04 | b1ca290baa255e9939882e3711093a8ca0509687 | /278/Untitled6.cpp | c15d502a7372d52591927acdf5bc0627e4aa54a2 | [] | no_license | ZeeshanAhmadKhalil/DevCpp | 26872a9059d683072c116169b4035ea6ae706c54 | c68c67f2972cbc6bca2691dd773a4bff62aa5889 | refs/heads/master | 2020-07-29T00:00:33.065937 | 2019-09-24T06:13:57 | 2019-09-24T06:13:57 | 209,585,282 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 387 | cpp | #include<iostream>
#include<conio.h>
using namespace std;
class record
{
private:
int marks;
char grade;
public:
record(int m,char g)
{
marks=m;
grade=g;
}
show()
{
cout<<"Marks="<<marks<<endl;
cout<<"Grade="<<grade<<endl;
}
};
main()
{
record s1(750,'A'),s2(650,'B');
cout<<"Record of student 1"<<en... | [
"mk1411997@gmail.com"
] | mk1411997@gmail.com |
48d733a102c070324c653a94f86722ab8cc00b41 | eb2f8b3271e8ef9c9b092fcaeff3ff8307f7af86 | /Grade 10-12/2018 autumn/NOIP/NOIP2018提高组Day2程序包/answers/GD-0166/defense/defense.cpp | 70956fb195c609bae04abd57b0520e7aaa196cf2 | [] | no_license | Orion545/OI-Record | 0071ecde8f766c6db1f67b9c2adf07d98fd4634f | fa7d3a36c4a184fde889123d0a66d896232ef14c | refs/heads/master | 2022-01-13T19:39:22.590840 | 2019-05-26T07:50:17 | 2019-05-26T07:50:17 | 188,645,194 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 577 | cpp | #include<cstdio>
using namespace std;
int n,m;
int main()
{
freopen("defense.in","r",stdin);
freopen("defense.out","w",stdout);
scanf("%d%d",&n,&m);
if (n==5&&m==3)
{
printf("12\n");
printf("7\n");
printf("-1\n");
}
else if (n==10&&m==10)
{
printf("213696\n");
printf("202573\n");
printf("202573... | [
"orion545@qq.com"
] | orion545@qq.com |
25fda72655bde8f75e486f5ebb3921f2deec323c | 4799044cec94c502cdd3bac8f7efbd457d44b912 | /Trees/GenericTree.h | a099e3058c1ad96be36352850682767f99018521 | [] | no_license | yogesh019/DataStructures | 669d8b6927df5807904ec3cecd1c8216d21db2f8 | ab369068cab3bb68a84b35deb858cf1aa1472ec5 | refs/heads/master | 2021-01-19T10:56:57.504014 | 2019-06-30T11:08:01 | 2019-06-30T11:08:01 | 82,221,401 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,942 | h | #ifndef GENERICTREE_H_INCLUDED
#define GENERICTREE_H_INCLUDED
#include<iostream>
#include<queue>
#include<stack>
using namespace std;
template<typename T>
class GenericTree;
template<typename T>
class GenericTreeNode{
public:
T data;
GenericTreeNode**children;
GenericTreeNode*parent;
unsigned int chil... | [
"sharmay376@gmail.com"
] | sharmay376@gmail.com |
ee44038c72a75f9fe7a846fdce6baab8b867a8b1 | 7f1e7aaf7100612b6181ad7d79ff33bb3038e22c | /tools/quantize.cc | 00dfe18231cb973fc6ef6868a08347a0f1b4f799 | [] | no_license | tyfkda/save_endo | 209d8d5e3653705e74385b4d0cb62993a47b043c | 94a6ea01967a9b1532796a60e57ca5d104d42af1 | refs/heads/master | 2020-12-24T21:28:27.610789 | 2016-04-14T05:50:14 | 2016-04-14T05:50:14 | 56,209,728 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,230 | cc | #include "util.h"
#include <iostream>
#include <png.h>
using namespace std;
int CompareImage(unsigned char* image1, unsigned char* image2,
int width, int height) {
int risk = 0;
for (int i = 0; i < width * height; ++i) {
unsigned char* p = &image1[i * 3];
unsigned char* q = &image2[i * 3];... | [
"tyfkda@gmail.com"
] | tyfkda@gmail.com |
db8977cb12edc3d81a3298412e83d352418ca39b | 8f9a6e3cf0be0510210b800188ba790939a72d06 | /1135.cpp | 520e29f7544abd659c8880308e51ac1196dd5aec | [] | no_license | ppdg123/hihoCoder | ac6d042463cbda2d0726d6df2d07621d6e3dcd02 | 8fada68531304366581f73116621ab13cd6d14db | refs/heads/master | 2021-01-10T04:39:51.294284 | 2015-10-21T11:41:20 | 2015-10-21T11:41:20 | 43,962,401 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 872 | cpp | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main()
{
int val[3],cur[3];
char str[20005];
scanf("%d%d%d",&val[0],&val[1],&val[2]);
sort(val,val+3);
scanf("%s",str);
int len = strlen(str);
int cnt = 0;
int pcnt[200],tmp,i;
m... | [
"ppdg@foxmail.com"
] | ppdg@foxmail.com |
4d134248f30a0fa9dcf42a3578e6e5f9155a1d93 | dd656493066344e70123776c2cc31dd13f31c1d8 | /MITK/Modules/DiffusionImaging/Algorithms/itkTractsToProbabilityImageFilter.cpp | ea27142da41231ba044e46a534a6dfdfbab43f7f | [] | no_license | david-guerrero/MITK | e9832b830cbcdd94030d2969aaed45da841ffc8c | e5fbc9993f7a7032fc936f29bc59ca296b4945ce | refs/heads/master | 2020-04-24T19:08:37.405353 | 2011-11-13T22:25:21 | 2011-11-13T22:25:21 | 2,372,730 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 13,253 | cpp | #include "itkTractsToProbabilityImageFilter.h"
#include "itkBSplineUpsampleImageFilter.h"
#define __CEIL_UCHAR__(val) (val) = \
( (val) < 0 ) ? ( 0 ) : ( ( (val)>255 ) ? ( 255 ) : ( (val) ) );
namespace itk{
template< class TInputImage, class TOutputPixelType >
TractsToProbabilityImageFilter< TInputImage,... | [
"dav@live.ca"
] | dav@live.ca |
2731a594e9a8a7425ba292450e45342afff81a5f | 25d4df40ca9e15578548c2167cd9fb207fc8a3e4 | /HW2/H4B/rk4.h | 5b57d54e796bb340006459a6dcde8c502e93bd2d | [] | no_license | Ukami/closuit_PHYS401 | 398cfac6299ae53ca6255cc71e1c43bdcfa495f6 | db46cce6d9a5a62a5b9dcfc64be4bf5f2060d594 | refs/heads/master | 2020-05-01T07:47:17.915516 | 2015-04-17T19:41:51 | 2015-04-17T19:41:51 | 29,846,194 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 696 | h | #ifndef RK4_H
#define RK4_H
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include "datstruct.h"
double func(double a)
{
return -pow(a, 3.0); // change this is function changes
}
data rk4(double x, double p, double h)
//x and p position and moment... | [
"u421006155@thebe.physics.tamu.edu"
] | u421006155@thebe.physics.tamu.edu |
403fe2257385f878cdc3cae6cf5f77114af96cc1 | 07ad6f5980d009ddb6c4c5d535a8fbea4ecb8394 | /imesh-cloud-node.ino | 188bf3340e38640b8d4c9f1bf7111e667e0c83d7 | [] | no_license | mojisejr/i-mesh-gateway-node | c83a31d706de6015a0f3f6386ed21e344ffafc26 | aaff8ce8c9381fb3c44cead0f8fc408837df466f | refs/heads/master | 2020-03-22T03:54:16.875289 | 2018-07-03T14:03:17 | 2018-07-03T14:03:17 | 139,459,328 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,985 | ino | //#define BLYNK_PRINT Serial
#include <SoftwareSerial.h>
#include "ESP8266WiFi.h"
#include "ArduinoJson.h"
#include "PubSubClient.h"
#include <BlynkSimpleEsp8266.h>
#include <SimpleTimer.h>
#include "ifarm.h"
//Blynk Params-->
SimpleTimer timer;
WidgetTerminal terminal(V51);
//<---
//ThingSpeak params--->
char* mqttSer... | [
"nonthasak.l@gmail.com"
] | nonthasak.l@gmail.com |
779eddee6f673676397d559374456dc4f1d857ac | 7884ca202744631a23a1810480b296d208450472 | /Codes.cpp | 988a386c9124d54f1275d1052bad84a703631984 | [] | no_license | Tayfurbal/Tutulan_Sayiyi_Tahmin_Etme | 202024dfab5e963713e207cd5b4502fd2c3adf19 | 42fc78b1ef2363ac0e5d48dd73f3f5d3e55dc528 | refs/heads/main | 2023-06-24T08:40:08.727775 | 2021-07-23T11:56:08 | 2021-07-23T11:56:08 | 388,785,612 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 655 | cpp | #include <iostream.h>
#include <conio.h>
main ()
{
int taban=0, tavan, tahmin, sonuc, deneme_sayisi=0;
cout<<"0 ile kac arasinda sayi tutmak istersiniz:";
cin>>tavan;
do
{
cout<<"Benim tahminim ";
tahmin=(taban+tavan)/2;
cout<<tahmin<<endl;
deneme_sayisi=deneme_sayisi+1;
cout<<"Tahminim sizin tuttugunuz... | [
"tayfunzbal@gmail.com"
] | tayfunzbal@gmail.com |
de16406d943ee1e333dc3a8d0c771852394afd6e | 2bc835b044f306fca1affd1c61b8650b06751756 | /mshtml/src/other/htmldlg/htmlpop.cxx | 8441896dad875ab5cd7c7d9f37ac078fa8e19105 | [] | no_license | KernelPanic-OpenSource/Win2K3_NT_inetcore | bbb2354d95a51a75ce2dfd67b18cfb6b21c94939 | 75f614d008bfce1ea71e4a727205f46b0de8e1c3 | refs/heads/master | 2023-04-04T02:55:25.139618 | 2021-04-14T05:25:01 | 2021-04-14T05:25:01 | 357,780,123 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,750 | cxx | //+------------------------------------------------------------------------
//
// Microsoft Forms
// Copyright (C) Microsoft Corporation, 1996
//
// File: htmlpop.cxx
//
// Contents: Implementation of the CHtmlPopup
//
// History: 05-27-99 YinXIE Created
//
//-----------------------------------------... | [
"polarisdp@gmail.com"
] | polarisdp@gmail.com |
8ae62553847dd86063ffccaab6694e12b92bfbd1 | 1d3c46aee4b676d0f53194ab3afef8ba11f1ea20 | /FluxEngine/Rendering/Drawable.h | 4ee5219e7bd2dc5ab190fda9481a5c30a2b342fb | [
"MIT"
] | permissive | echofriendly/FluxEngine | fe2d3752b224a2b92fe064c8e4f3f24f70ddc000 | e77f34223cd70f011af18b8acedc41ccdb6311ca | refs/heads/master | 2020-04-14T08:47:35.497127 | 2018-08-21T21:07:22 | 2018-08-21T21:07:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 992 | h | #pragma once
#include "Scenegraph/Component.h"
class Scene;
class SceneNode;
class Material;
class Geometry;
struct Batch
{
const Material* pMaterial = nullptr;
const Geometry* pGeometry = nullptr;
const Matrix* pModelMatrix = nullptr;
const Matrix* pSkinMatrices = nullptr;
int NumSkinMatrices = 1;
};
class Dra... | [
"sim2.coenen@gmail.com"
] | sim2.coenen@gmail.com |
046a9eaa5e6fe493445eb277f24ef30d2277ea1c | 553298299eed97e2c22835bb7c3912f5006c3c28 | /Common/Obj8/Comment.cpp | ab2b38f4ce2a2f0d37c32fcb32a756fff5af4e4a | [] | no_license | SchaichAlonso/StaticsMapping | 853d8f8bd6df0f02b755830902ba36199278d7f9 | 9b33139f853a45e3c1a3535d445e89ba6772f9e5 | refs/heads/master | 2022-11-03T03:09:14.964266 | 2022-10-19T17:02:10 | 2022-10-19T17:02:10 | 110,700,210 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,011 | cpp | #include "Parser/SyntaxError.hpp"
#include "Comment.hpp"
Obj8::Comment::Comment ()
: Record ()
{
}
Obj8::Comment::Comment (StringRef str, Parser::LexerContext *ctx, int flags)
: Record (str, ctx, Parser::Word::ConsumeRemainingLine | flags)
{
if (not qualified (m_identifier)) {
throw (Parser::SyntaxErro... | [
"alonso.schaich@sodgeit.de"
] | alonso.schaich@sodgeit.de |
4a3beda182e3c008ea4b79052dcb04531257e33c | 7e791eccdc4d41ba225a90b3918ba48e356fdd78 | /chromium/src/chrome/browser/ui/views/frame/browser_non_client_frame_view_mus.cc | 191a03a512377373f533229b76f5aadfb12a427d | [
"BSD-3-Clause"
] | permissive | WiViClass/cef-3.2623 | 4e22b763a75e90d10ebf9aa3ea9a48a3d9ccd885 | 17fe881e9e481ef368d9f26e903e00a6b7bdc018 | refs/heads/master | 2021-01-25T04:38:14.941623 | 2017-06-09T07:37:43 | 2017-06-09T07:37:43 | 93,824,379 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 25,743 | cc | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ui/views/frame/browser_non_client_frame_view_mus.h"
#include <algorithm>
#include "base/profiler/scoped_tracker.h"
#include "bu... | [
"1480868058@qq.com"
] | 1480868058@qq.com |
39f3ec3bf2708f89fe471391f30996ca979e1a81 | dd5d0b8fd7cb9769a45760f5b15c73a5146baf17 | /src/BSQL/Library.cpp | 8965905edce42f1bb488eef6d640c20c62727436 | [
"MIT"
] | permissive | praisenarsie/BSQL | 7ab71df6fb372478e08f9098ef9b007dce42a990 | afaddc94ff27f8d892926867601a3ece6ff38837 | refs/heads/master | 2020-03-19T10:41:58.230694 | 2018-06-06T22:36:28 | 2018-06-06T22:36:28 | 136,393,766 | 0 | 0 | null | 2018-06-06T22:42:51 | 2018-06-06T22:42:50 | null | UTF-8 | C++ | false | false | 927 | cpp | #include "BSQL.h"
Library::Library() noexcept :
identifierCounter(0)
{}
Connection* Library::GetConnection(const std::string& identifier) noexcept {
auto iter(connections.find(identifier));
if (iter == connections.end())
return nullptr;
return iter->second.get();
}
bool Library::ReleaseConnection(const std::st... | [
"Cyberboss@users.noreply.github.com"
] | Cyberboss@users.noreply.github.com |
5892d4d5447a8577cc5a1f87ac50c994994a958c | a6752e9d5296c5628ba16771bef009b4607c919b | /cpp_src/core/itemimpl.h | 540ac34d23f45af1be1959887d3d3e9ff90e8bb5 | [
"LicenseRef-scancode-unknown-license-reference",
"Apache-2.0"
] | permissive | sagpant/reindexer | ae8c8c547a1e4beec4182615e1b4565f9a916bd9 | 54bf5ad40f3590e9b4dd6287f21e3b4774c8ae2c | refs/heads/master | 2022-11-12T22:38:58.310850 | 2020-06-12T10:50:26 | 2020-06-12T10:50:26 | 274,374,431 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 3,680 | h | #pragma once
#include <deque>
#include <vector>
#include "core/cjson/tagsmatcher.h"
#include "core/keyvalue/key_string.h"
#include "core/keyvalue/variant.h"
#include "core/payload/payloadiface.h"
#include "tools/serializer.h"
using std::vector;
namespace reindexer {
struct ItemImplRawData {
ItemImplRawData(Payload... | [
"ogerasimov@gmail.com"
] | ogerasimov@gmail.com |
08aba69e1a1701e6d38445d8444c5d4b74d664ee | bf7d57591ac97669cb44ef752833c5650018dea0 | /Assignments/CSC17A_Project 2/Player.cpp | d96eb0f9ac0ac6a236551da36c380f0f4ffa1385 | [] | no_license | JMAK13/McIntyreJosh_CSC_17A_Spring2018 | 681f1765577264893893800deeffc6288da8ab0e | 428bf473feb0142d90795d9cbdc3593a6a6c7a4d | refs/heads/master | 2021-01-25T09:53:35.133945 | 2018-11-22T09:54:46 | 2018-11-22T09:54:46 | 123,328,090 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,856 | cpp | /*
* File: Player.cpp
* Author: Josh McIntyre
* Created on May 16, 2018, 1:28 PM
*/
//Included System Libraries
#include <iostream>
//Included User Libraries
#include "Player.h"
//Default Player Constructor
Player::Player(){
isPl=true;
name="Player Name";
inHand=0;
hand=new int[52];
for(in... | [
"josh.r.mcintyre13@gmail.com"
] | josh.r.mcintyre13@gmail.com |
8e15a8208caa74358c591f72382f150c29ef41b8 | ed97fb5c71da7ed89235432e3971bb0ef6064f8b | /algorithms/cpp/383.cpp | 9cd9dfaf11dc945d74e8c608d71cb9fad59c6f20 | [
"MIT"
] | permissive | viing937/leetcode | 8241be4f8bc9234a882b98ada2e5d13b0ebcca68 | b07f7ba69f3d2a7e294f915934db302f43c0848f | refs/heads/master | 2023-08-31T18:25:06.443397 | 2023-08-31T15:31:38 | 2023-08-31T15:31:38 | 37,374,931 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 457 | cpp | #include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
vector<int> cnt1(26, 0), cnt2(26, 0);
for (auto ch: ransomNote) cnt1[ch-'a'] += 1;
for (auto ch: magazine) cnt2[ch-'a'] += 1;
for (int i = 0; i... | [
"viing937@gmail.com"
] | viing937@gmail.com |
32a4ca058d6fd719da093eaab40240b2cadd5b99 | 967a01f1a14e3f6c174d58a431e6a09c79fc34e8 | /examples/aura_demo/aura_demo.cc | 917ea61ccf4962d62eb93aa5fb16a30c085f16f5 | [
"BSD-3-Clause"
] | permissive | PubFork/mojo | 98855f148574cde1811d081cc39a28d6188d86f8 | 950de5bc66e00aeb1f7bdf2987f253986c0a7614 | refs/heads/master | 2020-05-24T14:24:52.426551 | 2014-11-25T00:42:39 | 2014-11-25T01:03:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,876 | cc | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <stdio.h>
#include <string>
#include "base/bind.h"
#include "base/macros.h"
#include "mojo/application/application_runner_chromium.h"
#include "... | [
"jamesr@chromium.org"
] | jamesr@chromium.org |
a3ee64fc7c838f005a4c888ced2a5fd156c68870 | 9dfe52d4f6f828db4e77aa34699df8e560a51e9c | /bits.h | e8bbb5c59232b93d23cd0da8361c65a934aaac66 | [] | no_license | jfuentes/CMIB | 5200f552ba68868d2f88c4340b9b5b62be5d03aa | 3687f4bf57515ef2fd4790f0a19e58e06fbbca10 | refs/heads/master | 2020-03-25T18:45:39.442810 | 2018-10-03T07:38:52 | 2018-10-03T07:38:52 | 144,046,631 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 20,892 | h | /* sdsl - succinct data structures library
Copyright (C) 2008 Simon Gog
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 3 of the License, or
(at your option) any later version.
This p... | [
"jfuentes@ubiobio.cl"
] | jfuentes@ubiobio.cl |
87f245e635ede3c5b65c53541a1138d5552e5696 | fd87b8ceeb80e561475064ea3b5af51278326f2d | /math/vector3.hpp | 58e999b0c33c4cc1aeef717863a24e704cf38667 | [
"MIT"
] | permissive | fhnmor21/broome | 3306d4d83b57b3701c41c444566a5ca7ca035290 | aea0ab083f7485b015d742b9fb15d0583a979b0a | refs/heads/master | 2023-03-07T14:46:46.783648 | 2021-02-24T03:58:10 | 2021-02-24T03:58:10 | 55,816,416 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,204 | hpp | /**
The MIT License (MIT)
Copyright (c) 2016 Flavio Moreira
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, merg... | [
"fhnmor21@gmail.com"
] | fhnmor21@gmail.com |
d6a73fbdef3cc92ad737190bb839c9d5ba626a9c | 5732a7279c9632d1cef13f5fafb6116ee9d15dfb | /engine/Graphic/SDL/sdlrenderer.cpp | 7d762651954e6f5d944c7a8e95e22a7acdc3a604 | [] | no_license | juanAngel/RPG_Game | dd14f62fb9b0cbaf8ed98b12ec07783bf2266c84 | dfae2ad203819cc4a58e65306b0532999c8fd624 | refs/heads/master | 2020-09-16T06:22:43.774135 | 2019-11-26T23:10:38 | 2019-11-26T23:10:38 | 223,681,813 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 840 | cpp | #include "sdlrenderer.h"
#include <Graphic/SDL/sdlcamera.h>
#include <Graphic/SDL/sdltexture.h>
#include <Graphic/SDL/sdlengine.h>
SDLRenderer::SDLRenderer(SDLCamera* camera){
mRenderer = SDL_CreateRenderer(
camera->windows(),
-1,
SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTV... | [
"juan@localhost.localdomain"
] | juan@localhost.localdomain |
876de52cdfa27db411cf66485a509b78e4bf9c91 | 92e67b30497ffd29d3400e88aa553bbd12518fe9 | /assignment2/part6/Re=20/2.8/U | d1ab0a555beb015c7f9d8351d9c4d5341625c036 | [] | no_license | henryrossiter/OpenFOAM | 8b89de8feb4d4c7f9ad4894b2ef550508792ce5c | c54b80dbf0548b34760b4fdc0dc4fb2facfdf657 | refs/heads/master | 2022-11-18T10:05:15.963117 | 2020-06-28T15:24:54 | 2020-06-28T15:24:54 | 241,991,470 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 63,627 | /*--------------------------------*- C++ -*----------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Version: 7
\\/ M anipulation |
\*-... | [
"henry.rossiter@utexas.edu"
] | henry.rossiter@utexas.edu | |
e8a5856c70f0cceca937f59fd49c4fb7013906a2 | 41b444116c8431b7e4199f78b0f27f1dc61d190f | /P1616.cpp | 72c52afb82862efe3206deb1141560ab933b1cdb | [
"MIT"
] | permissive | lwzhenglittle/NOIP | 6caa100b1865c93837deca3283bf43e54c84462f | f256c8d706b3ac985de04a5fae77246f44ba5b23 | refs/heads/master | 2021-07-12T06:58:37.345212 | 2020-09-27T12:09:49 | 2020-09-27T12:09:49 | 207,077,580 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 400 | cpp | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,V;
int c[200010];
int v[200010];
int dp[200010];
int main(){
scanf("%d%d",&V,&n);
for(int i=1;i<=n;i++){
scanf("%d%d",&c[i],&v[i]);
}
for(int i=1;i<=n;i++){
for(int j=c[i];j<=V;j++){
dp[j]=max(d... | [
"924695205@qq.com"
] | 924695205@qq.com |
af2a8f6a79fdbb4260d66ef6b643e696029243a0 | 2f3a946c1ec8ddfe27eded31b0a842ce65ed95b7 | /Cpp-C/Ema/TestTools/QATools/Series100Consumer112-PConfig-001/Consumer.cpp | d8cd7b0bd9ae8eccef9e9debc8028eed0f9c8cc8 | [
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-generic-cla",
"Apache-2.0"
] | permissive | ahigashinaka/Elektron-SDK | 747adc47fe1e939ad69d55775428072510496f8f | 46ac8eb3b5b77137018b5fe675a09a8a8d177f09 | refs/heads/master | 2020-03-21T10:26:32.481433 | 2018-06-12T16:00:22 | 2018-06-12T16:00:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,408 | cpp | ///*|-----------------------------------------------------------------------------
// *| This source code is provided under the Apache 2.0 license --
// *| and is provided AS IS with no warranty or guarantee of fit for purpose. --
// *| See the project's LICENSE.md for details. ... | [
"arthur.yurov@thomsonreuters.com"
] | arthur.yurov@thomsonreuters.com |
b9bfc18469af1c16252673c4fc406f881d2c3fa9 | 1b712a2a6ccdd5a8fd9070749205d2dd97e78299 | /练习加考试/photo.cpp | b7f1b98e6f4d36f1a7d1dd7d7b23bef0386945a4 | [] | no_license | xsy1996/C_algorithm_codes | b12eff717bbbf19f6872b2da35b532abc8392f37 | 2e9b8ad99d330de39bc000b8c0fa3dc9242b3147 | refs/heads/master | 2020-04-13T12:26:46.975699 | 2018-12-26T17:24:54 | 2018-12-26T17:24:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,007 | cpp | #include<stdio.h>
#include<stdlib.h>
char map[80][80];
int jd=0,fz=0,s=0,xmax=0,xmin=80,ymax=0,ymin=80,fx[4][2]={{1,0},{0,1},{0,-1},{-1,0}};
void photo(int x,int y){
int i,j,k;
map[x][y]='.';
s++;
if(x<xmin)
xmin=x;
if(x>xmax)
xmax=x;
if(y<ymin)
ymin=y;
... | [
"Xushiyu1996@gmail.com"
] | Xushiyu1996@gmail.com |
bcae832de17b3f5148ce2f0c6a1afaf1931227ad | d606a1fc756efea8875c9c59feccbb54061ef534 | /FacetCenterHeatTransferTest/CompareNumericalAndAnalyticalSolutions.cpp | d64c440d74045f73f9cd62bc2fb27c725304edb7 | [] | no_license | lucasguesserts/StaggeredLib | 8e7a9baf5732adfbf661ac4ba243bb3df7905e64 | 4ad8729698d67c39c3fd85e0094e668d828f003b | refs/heads/master | 2022-11-05T12:22:58.641196 | 2018-07-01T17:30:00 | 2018-07-01T17:30:00 | 241,598,522 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,096 | cpp | #include <array>
#include <vector>
#define _USE_MATH_DEFINES
#include <cmath>
#include <boost/filesystem.hpp>
#include <stdexcept>
#include <iostream>
#include <Eigen/Dense>
#include <Utils/Test.hpp>
#include <Utils/EigenTest.hpp>
#include <Utils/RateOfConvergence.hpp>
#include <Stencil/ScalarStencil.hpp>
#include <St... | [
"guesser@sinmec.ufsc.br"
] | guesser@sinmec.ufsc.br |
bb85d9a4eae0ea12c5e9e4dd542dcb2394674a0e | 3296a22298dd31c078bc74f21c85c8cd6e4fff97 | /RemoveDuplicates.cpp | 1f38c87f6b1e2b1e5defec17753170ce317cc31a | [] | no_license | kritirikhi/DataStructuresAndAlgorithms | 355e0ef84af97bbca86dfebcbe6e33325d1e8c21 | 9bfa3e578ee7fa8464edcfb320afa6cf681f1be0 | refs/heads/master | 2020-12-23T13:16:54.126714 | 2020-07-01T13:21:02 | 2020-07-01T13:21:02 | 237,164,318 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 566 | cpp | #include<iostream>
using namespace std;
void removeDuplicate(char input[],int i,char output[],int j){
// base case
if(input[i]=='\0'){
output[j]='\0';
cout<<output;
return;
}
// recursive case
if(input[i]==input[i+1]){
output[j]=input[i];
removeDuplicate(inp... | [
"kritirikhi1999@gmail.com"
] | kritirikhi1999@gmail.com |
2d1a39a8b21a02de33b7d3e47cd1b88d1527384c | a003802a42e6fb089e8f10486bc45d1037c9711e | /NouveauSensors/nouveau_i2c._base.cpp | 625c845beb2515a57662926866d81a51ce62a0d6 | [] | no_license | anostra/HWSensors | 7c94ab3bf836f05c7b435ddf99b09ec49f8f6c37 | e6b2fecd1f1491f746914eee090d272037423a34 | refs/heads/master | 2021-01-18T06:28:10.255449 | 2012-12-11T20:33:30 | 2012-12-11T20:33:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,105 | cpp | //
// nouveau_i2c.cpp
// HWSensors
//
// Created by Kozlek on 11.08.12.
//
//
/*
* Copyright 2012 Red Hat 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, ... | [
"natan.zalkin@me.com"
] | natan.zalkin@me.com |
bba3698540fcb4b972aae0d1d6342ac0f5310f54 | 6c1de2d89960559fd19c0674c26b3d79df6afd81 | /idlecallback.h | 30e0b41040e4ede1576fba9eee9281b5868d0beb | [
"BSD-2-Clause",
"BSD-3-Clause",
"BSD-4-Clause-UC",
"LicenseRef-scancode-other-permissive"
] | permissive | uclmediatools/vic | 98cd0a331669596669799abf9aee5b49e77b2e80 | 6bc8feca6c126924521c840710b95513668d69e8 | refs/heads/master | 2016-09-05T09:51:26.801101 | 2006-11-29T05:36:49 | 2006-11-29T05:36:49 | 10,332,314 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,227 | h | /*
* Copyright (c) 1993-1994 Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
... | [
"ucacsva@bc8abe95-590b-0410-a0f3-dc9ed9a1a8fa"
] | ucacsva@bc8abe95-590b-0410-a0f3-dc9ed9a1a8fa |
7cbab26f73af6966a86044812757fd0f5d20dbf6 | a2156427d674e597f3ecbeb1733974224282a7f1 | /test/EeyoreClient.cpp | 9bdc9b7daee0f8759e64896851a467244657bacc | [] | no_license | PoohCook/PlusStuff | cdf682aa4b62411c3e5767ce2091c1d23ceec7fa | 8becac2dc5cc013209626bccdd97b5813e908010 | refs/heads/master | 2020-03-29T05:20:37.628446 | 2018-10-04T03:43:54 | 2018-10-04T03:43:54 | 149,578,307 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,516 | cpp | /*
* File: EeyoreClient.cpp
* Author: Pooh
*
* Created on October 3, 2018, 4:18 PM
*/
#include <string>
#include <iostream>
#include <boost/serialization/vector.hpp>
#include <boost/serialization/string.hpp>
#include <boost/program_options.hpp>
#include "ChannelClient.h"
#include "PoohCommand.h"
namespace po ... | [
"PoohCook@gmail.com"
] | PoohCook@gmail.com |
95f60f757c732af60fdb4f0ae0927f96c4d227e3 | 1521c6c1ed741db06b5f87f1ec0c9cba9931f1b0 | /Source/Batiment/Interieur/MurVertical.h | 8cf5d3595bb594d7f70f7902e3f3f367cb5c638e | [
"CC-BY-3.0",
"MIT",
"CC-BY-4.0"
] | permissive | Matthieu-Riou/Kurt-The-Last-Key | 15c55be183669e3ac498fed35a8e1fa6227ea1d2 | ea59e86963a035748b394ec09154af872a6fa309 | refs/heads/master | 2016-09-05T13:05:53.523239 | 2014-09-25T14:41:25 | 2014-09-25T14:41:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 748 | h | #ifndef MURVERTICAL_H
#define MURVERTICAL_H
/** \file MurVertical.h
\brief Représentation d'un mur horizontal
\author RIOU, MAUSSION
*/
#include <SFML/Graphics.hpp>
#include <string>
#include <sstream>
#include <vector>
#include <iostream>
#include "MurAbstrait.h"
#include "../../Espace.h"
/** \c... | [
"matthieu.riou@etu.univ-nantes.fr"
] | matthieu.riou@etu.univ-nantes.fr |
c5aea21242758519581db7ba5b38422a7e9a1557 | d23d36fd5b4e6851fef68940b15ed625677a576b | /作业3-3/作业3-3/作业3-3View.h | 102a45273e6bd5b23b4d1e09719a250bdfaf51b8 | [] | no_license | DJQ0926/test | 0d5fd731edef513e08b1169578e70fe9139d7d05 | e9a755ac66750e14bbb870d211531d91a92fc2ee | refs/heads/master | 2021-02-15T23:03:21.681207 | 2020-07-05T09:51:20 | 2020-07-05T09:51:20 | 244,942,227 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 943 | h |
// 作业3-3View.h : C作业33View 类的接口
//
#pragma once
class C作业33View : public CView
{
protected: // 仅从序列化创建
C作业33View();
DECLARE_DYNCREATE(C作业33View)
// 特性
public:
C作业33Doc* GetDocument() const;
// 操作
public:
// 重写
public:
virtual void OnDraw(CDC* pDC); // 重写以绘制该视图
virtual BOOL PreCreateWindow(CREATESTRUCT& cs)... | [
"964158009@qq.com"
] | 964158009@qq.com |
018d01ba70f5016f9ae65b5452f9d0ff2d649ede | 63793887b9b848285150f40c4ff141682cfc1f8c | /amit/prime_matrix.cpp | 4f285dc1a4331c8e702b21c98f35d08de4ab5153 | [] | no_license | akashyap661/Placement-Program | 245966c41a440f8ca2f583e571ca0521d2fa0a20 | 669de910617ebfebac262c984959278aa92ece7c | refs/heads/master | 2020-06-08T14:25:42.321230 | 2019-06-22T14:59:23 | 2019-06-22T14:59:23 | 193,243,940 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,501 | cpp | // In this problem we need to count no.of step as if we increase value of elements by 1 in order
// to make any row or column prime
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
bool prime(int n)
{
bool a[n+1];
int i,j;
memset(a,true,sizeof(a));
for(i=2;i*i<=n;i++)
{
if(a[i... | [
"akashyap661@gmail.com"
] | akashyap661@gmail.com |
d73e5def4bc72f59f761aef9d9e1736e03480e3f | 5495469ae3ed685a40d8afa027a94e6dca44a6d2 | /day03/ex02/ClapTrap.cpp | 4fb39608e11a49ad9565f15f0915604068193605 | [] | no_license | ishtvan-lucor/cpp_pool | 4dab3e23fd7f84b68f05eefeb8e435c792baba6f | 7cb570d5d2ce82bd596d08c540de446bbaa2ed7c | refs/heads/master | 2020-06-09T18:03:31.031485 | 2019-08-20T14:40:08 | 2019-08-20T14:40:08 | 193,480,572 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,319 | cpp | #include "ClapTrap.hpp"
ClapTrap::ClapTrap( std::string name ) : _hp(10), _max_hp(10),
_ep(10), _max_ep(10), _lvl(1),
_name(name), _melee_ad(0),
_range_ad(0), _armor_dr(0)
{
std::cout << "ClapTrap is here!" << std::endl;
}
ClapTrap::ClapTrap(ClapTrap const ©)
{
std::cout << "Mor... | [
"ishtvan.koloshynsky@gmail.com"
] | ishtvan.koloshynsky@gmail.com |
97f3ee981341445396056bcb848cc6fd5805d022 | 139b1a522a666a62a7e45bc0c6a3ce7c9e910a86 | /stira/deconvolve/deconvolve/IterativeDeconvolve.cpp | e3b607360c9b25734be9ddca6acbfb9441592ac9 | [
"MIT"
] | permissive | andyTsing/stira | 5857c7acc579c918164491459c1c3cc011f57fa5 | 863bc39ac3a4e5cfb354428965bdb7b93e76855d | refs/heads/master | 2021-01-23T23:13:18.375623 | 2015-04-27T20:20:50 | 2015-04-27T20:20:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,726 | cpp |
/***********************************************************************************
* Copyright (C) 2008 by Filip Rooms *
* *
* Terms and conditions for using this software in any form are... | [
"filip.rooms@gmail.com"
] | filip.rooms@gmail.com |
dc0b7a2f4a15156def72a424fa3d9aa67b67cfa1 | a34445105030b0a6bc1e6ea1ed20923e8af6b8b7 | /C++/level2/프린터.cpp | 03509eb273554ea66d209e3b929fcfd05fde7e3c | [] | no_license | ambacc244/algorithm | e701f37cb541d79716a40cbf89640472f356a0e9 | da3b313f913e5c7564f8a17355673d6ee5feec89 | refs/heads/master | 2023-02-05T13:34:41.477254 | 2020-12-25T03:43:46 | 2020-12-25T03:43:46 | 245,620,194 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 788 | cpp | #include <string>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
int solution(vector<int> priorities, int location) {
int answer = 0;
bool pass = false;
queue<pair<int, int>> queue;
priority_queue<int> order;
for(int i=0; i<priorities.size(); i++){
queue.push(... | [
"leeye@oregonstate.edu"
] | leeye@oregonstate.edu |
4835e87f8357521ec9c58aed7f19ff3810d55b84 | 71501709864eff17c873abbb97ffabbeba4cb5e3 | /llvm11.1.0/flang/include/flang/Evaluate/traverse.h | 4888946c1a6c3e814804a3dd994b2c01ec1e9565 | [
"LLVM-exception",
"Apache-2.0"
] | permissive | LEA0317/LLVM-VideoCore4 | d08ba6e6f26f7893709d3285bdbd67442b3e1651 | 7ae2304339760685e8b5556aacc7e9eee91de05c | refs/heads/master | 2022-06-22T15:15:52.112867 | 2022-06-09T08:45:24 | 2022-06-09T08:45:24 | 189,765,789 | 1 | 0 | NOASSERTION | 2019-06-01T18:31:29 | 2019-06-01T18:31:29 | null | UTF-8 | C++ | false | false | 10,169 | h | //===-- include/flang/Evaluate/traverse.h -----------------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... | [
"kontoshi0317@gmail.com"
] | kontoshi0317@gmail.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.