blob_id stringlengths 40 40 | content_id stringlengths 40 40 | repo_name stringlengths 5 114 | path stringlengths 5 318 | language stringclasses 5
values | extension stringclasses 12
values | length_bytes int64 200 200k | license_type stringclasses 2
values | content stringlengths 143 200k |
|---|---|---|---|---|---|---|---|---|
7dfef3ed32ee9fe89a1eb00a146a59a2b9f7f8f6 | 2a02f2304456c157590490ed77d55f5d794e04c4 | twinkarma/Chaste | /mesh/src/writer/VtkMeshWriter.hpp | C++ | hpp | 10,349 | permissive | /*
Copyright (c) 2005-2018, University of Oxford.
All rights reserved.
University of Oxford means the Chancellor, Masters and Scholars of the
University of Oxford, having an administrative office at Wellington
Square, Oxford OX1 2JD, UK.
This file is part of Chaste.
Redistribution and use in source and binary forms... |
fe5baff28285e312c06af6c13c7bee1209a32c04 | b07a37cac280bb99fa58090a4e1af4f847e1d85b | kwoss2341/qt_ex | /Ch03/01_BasicWidget/08_QSpinBox_QDoubleSpinBox/widget.cpp | C++ | cpp | 1,169 | no_license | #include "widget.h"
Widget::Widget(QWidget *parent) : QWidget(parent)
{
int ypos = 30;
int val[3] = {50, 100, 200};
double double_val[3] = {50.5, 127.32, 171.342};
for(int i = 0 ; i < 3 ; i++)
{
spin[i] = new QSpinBox(this);
spin[i]->setMinimum(10);
spin[i]->setMaximum(300)... |
486bf97a93311ad4dc6bc16b5d6afea8e0e37294 | d03b754d3900450f598cf212c4a96edef3058a91 | YeQiang1075736553/target-offer | /c++/t4.cpp | C++ | cpp | 4,795 | no_license | #include"iostream"
#include"vector"
using namespace std;
/*************************************************
剑指offer之面试题4：二位数组中的查找
题目：
在一个二维数组中，每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。
请完成一个函数，输入这样的一个二维数组和一个整数，判断数组中是否含有该整数。
思路：
见程序标注
编程环境：
visual studio 2017
作者：
CSDN博客：https://my.csdn.net/yeqiang19910412
Github：https:/... |
418fb6c6c56deea5c266edf4ca04c59cc40469a0 | 3d278bd6fe3c7c40f7487b191b26b70a5312325a | larsks/opennebula-lks | /src/vmm/VirtualMachineManagerDriver.cc | C++ | cc | 16,694 | permissive | /* -------------------------------------------------------------------------- */
/* Copyright 2002-2011, OpenNebula Project Leads (OpenNebula.org) */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); you may ... |
66f4abd322a726c3a60a81c1642e6cccdf4fca54 | 167f2b030058b756df1461a85539a0636baed362 | Le-Fix/gta5-quadcopter | /LeFixDrone/script.cpp | C++ | cpp | 16,004 | no_license | //Rotate Ped to get accurate bullet decals (tried, is strange)
//Map scale
//switch to fpv and animate goggles
#include "script.h"
#include "inc\main.h"
#include "AudioHandler.h"
#include "Clone.h"
#include "TimeCycleManager.h"
#include "Drone\Drone.h"
#include "Input\Gamepad.h"
#include <menu.h>
#include "Utils\U... |
86c55cd628347778d6d1d1b9c6a7aa241fa092cb | 90fe61487ad011720d9121b81e1ffbe05706b753 | sharvi1203/DSA | /Trees/Check for Balanced Tree.cpp | C++ | cpp | 445 | no_license | int height(Node* root){
if(root==NULL){
return 0;
}
if(root->left==NULL && root->right==NULL){
return 1;
}
int l=height(root->left);
int r=height(root->right);
return (l>r)?l+1:r+1;
}
bool isBalanced(Node *root)
{
if(root==NULL){
return true;
}
int l=heigh... |
7d81b66851ecb137f81e3f44dbe316fb65343af2 | f051851bdb117dcca477ab8f946723cf32b98682 | rfzeg/multiple_robots_slam | /exploration/src/legacy_hybrid_exploration_node.cpp | C++ | cpp | 2,621 | no_license | #include <ros/ros.h>
#include <exploration/sensor_based_exploration.h>
#include <exploration/frontier_based_exploration.h>
#include <exploration/movement.h>
#include <std_msgs/Bool.h>
#include <std_msgs/Int8.h>
#include <exploration_libraly/struct.h>
#include <geometry_msgs/PointStamped.h>
int main(int argc, char* arg... |
6f39e6c186ccba33546f6995a163e73995ef3718 | 86c7c76e34479ea687c4c61bfe4c34a197839c27 | ygling2008/rtabmap | /corelib/src/util3d.cpp | C++ | cpp | 56,416 | no_license | /*
Copyright (c) 2010-2016, Mathieu Labbe - IntRoLab - Universite de Sherbrooke
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
... |
3b5912066356447c1b9ed47b92d65ee0f19aba70 | b662e2927b5e0b78ae0c3d8128c2a7b2f0d2e80f | otcshare/chromium-src | /content/renderer/in_process_renderer_thread.cc | C++ | cc | 3,063 | permissive | // 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 "content/renderer/in_process_renderer_thread.h"
#include "build/build_config.h"
#include "content/renderer/render_process.h"
#include "content/r... |
9f247179147cd153aa787852211b77cea18b2600 | 9f11ddd272539c8f8026961e7ef8d1a22c7ebf53 | williammc/boost.simd | /include/boost/simd/meta/real_of.hpp | C++ | hpp | 1,160 | permissive | //==================================================================================================
/*!
@file
Defines the as_logical meta-function
@copyright 2012 - 2015 NumScale SAS
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENSE.md or copy at http://boost.org/LI... |
dd4d8781bcbd18a867c04cee38378b05f987d2f6 | df53dd23537e071ea7d546edb30d80a6352c5d18 | hopefulxiaowu/cocos2dx-example | /Classes/AIHelp/AIHelpSupport.cpp | C++ | cpp | 17,373 | permissive | #include "AIHelpConfig.h"
#include "AIHelpSupport.h"
#define LOG_TAG "AIHelpSupport"
#define LOGD(...) __android_log_print(ANDROID_LOG_DEBUG,LOG_TAG,__VA_ARGS__)
#define LOGE(...) __android_log_print(ANDROID_LOG_ERROR,LOG_TAG,__VA_ARGS__)
const char *supportClazzName = "net/aihelp/init/AIHelpSupport";
OnAIHe... |
e99c2d5e46cfae0ed8c6396e34c468976f2fe96a | bb7f9c10e99370b93e122729d83959ce160d2c51 | mystique100/chaincoin | /src/test/getarg_tests.cpp | C++ | cpp | 5,340 | permissive | // Copyright (c) 2012-2018 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <util.h>
#include <test/test_chaincoin.h>
#include <string>
#include <vector>
#include <boost/algorithm/string.hpp... |
fde58dec2462eb266bd0d5d9d356057609c7994c | 2eb2b1f475cfd414803098dbe81d684efcd1413d | zenoalbisser/chromium | /gpu/command_buffer/client/program_info_manager.cc | C++ | cc | 33,100 | permissive | // Copyright (c) 2012 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 "gpu/command_buffer/client/program_info_manager.h"
namespace {
template<typename T> static T LocalGetAs(
const std::vector<int8>& data,... |
d49051e8822662a274cd7097ccb139f3b65c8b68 | 2fadc8e9fa6d6838afe607f71ef87ca5711bc485 | rongbohou/granite | /src/vi_estimator/landmark_database.cpp | C++ | cpp | 9,386 | permissive | /**
MIT License
This file is part of the Granite project which is based on Basalt.
https://github.com/DLR-RM/granite
Copyright (c) Martin Wudenka, Deutsches Zentrum für Luft- und Raumfahrt
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files... |
23a40eff4a33fc386e891c3b063f3f7bdebb0ee0 | 11f0883eccc6e423ca2998862ce99fe83f0a89d4 | Talbot3/FlyLab | /examples/demo-c++(11-14-17-20)/question/array.cpp | C++ | cpp | 317 | permissive | #include <iostream>
using namespace std;
int main(int args, char* argv[])
{
int len=sizeof(argv)/sizeof(char);
int len2=sizeof(argv[0])/sizeof(char);
int len4=sizeof(argv[2])/sizeof(char);
int len3=len/len2;
printf("数组的第一维长度是 %d，第二维长度是 %d, %d %d\n",len3,len2, len4, args);
return 0;
} |
3d747b0478247c5a2bec150b0f7c7354b8adb760 | c2fa34c5fa9807a03896e721d1bf8507151a5d53 | fsps60312/old-C-code | /C++ code/HSNU Online Judge/203.cpp | C++ | cpp | 988 | no_license | #include<bits/stdc++.h>
using namespace std;
const int INF=2147483647;
int N,L;
int W[100001],H[100001],SUM[100001];
int DP[400000];
void Build(const int &id,const int &l,const int &r)
{
DP[id]=INF;
if(l==r)return;
int mid=(l+r)>>1;
Build(id*2,l,mid),Build(id*2+1,mid+1,r);
}
void Set(const int &id,const int &l,cons... |
99248ac68baf74e299748e2e3cdec146a36585e3 | 862e29d4c7bf886d66ae0cdc5d19011df3644b91 | Leonardosu/competitive_programming | /UFCG/2023/lista 6 (mobius inversion)/d.cpp | C++ | cpp | 1,208 | no_license | #include "bits/stdc++.h"
#define f first
#define s second
#define endl '\n'
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(),x.end()
#define present(c, x) (c.find(x) != c.end())
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 2e5 +... |
e10cc4eff76e8182a3dd69fb998d30c3791c6687 | 44661a7f40652f5ab86bc0b5ae14298942cd8e27 | Mvpyetti/Data-Structure-Examples | /DictionaryProgram/spellCheck.cpp | C++ | cpp | 5,897 | no_license | //Tommy Bonetti Assignment 7
//This is the implementation file for spellCheck
#include "spellCheck.h"
#include "hashTable.h"
#include <iostream>
#include <fstream>
#include <cctype>
#include <string>
using namespace std;
//Constructor will initialize well perform all applicable initializations
spellCheck::spellCheck... |
fa565a55b10e7059c4c65d756eba5e10cca285ae | 2aa1f7ed3afdf1d46344ad43447750e19761920c | omer4d/OldCodeBackup | /CODE/test.cpp | C++ | cpp | 721 | no_license | #include <stdio.h>
#include <conio.h>
#include <string>
#include <sstream>
static int parseColor(std::string const& code, int def)
{
std::stringstream converter;
int res;
if(code[0] == '#')
{
converter << &code[1];
converter >> std::hex >> res;
... |
909c49a856af2d06c91eb8329727a0c02ae64b8e | 6e5c6ada689200988c884f15f837f81d42dab09b | keshavkabra/codehcef | /2014/mar/prosum1.cpp | C++ | cpp | 673 | no_license | #include<cstdio>
#include<iostream>
#include<queue>
#include<vector>
#include<map>
#include<utility>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<set>
#include<string>
#include<numeric>
#define f(i,a,n) for(int i=a;i<n;i++)
#define SIZE 100100
using namespace std;
int main()
{
int T;
cin>>T;
while... |
0a888c92a542d2c1f72201485b1f2e26bde00bf9 | b5835282d19257a89294ff5bcc1fbcb82696ff70 | Geballin/tile-qt | /generic/tileQt_RadioButton.cpp | C++ | cpp | 7,362 | permissive | /*
* tileQt_RadioButton.cpp
* ------------------------
*
* This file is part of the Tile-Qt package, a Tk/Tile based theme that uses
* Qt/KDE for drawing.
*
* Copyright (C) 2004-2008 by:
* Georgios Petasis, petasis@iit.demokritos.gr,
* Software and Knowledge Engineering Laboratory,
* Institute of Informatics... |
055f57b865c0670be6c784f0a78508a790a2dfa1 | 2aa8c411da011c7b65ed1f63e77d6213d5385fcb | francescog/nt2 | /modules/gsl_specfun/unit/scalar/gsl_sf_conicalp_sph_reg.cpp | C++ | cpp | 2,615 | permissive | //////////////////////////////////////////////////////////////////////////////
/// Copyright 2003 and onward LASMEA UMR 6602 CNRS/U.B.P Clermont-Ferrand
/// Copyright 2009 and onward LRI UMR 8623 CNRS/Univ Paris Sud XI
///
/// Distributed under the Boost Software License, Version 1.0
/// ... |
0863a055d8967b73647937d00fb7dc23b8c6fb34 | 5d48bb088a8bbfe953886c36b017edf3298631cd | cftang0827/online_judge | /ACM_102 (2).cpp | C++ | cpp | 618 | no_license | #include <iostream>
using namespace std;
int main()
{
int b1=0,b2=0,b3=0;
int g1=0,g2=0,g3=0;
int c1=0,c2=0,c3=0;
int BCG=0,BGC=0,CBG=0,GBC=0,CGB=0,GCB=0;
int max=0;
while(cin>>b1>>g1>>c1>>b2>>g2>>c2>>b3>>g3>>c3)
{
BCG = b2+b3+c1+c3+g1+g2;
BGC = b2+b3+g1+g3+c1+c2;
CBG = c2+c3+b1+b3+g1+g2;
GBC = g2+... |
09d8c4c7af6e472c4d77c782531acf596dfe4299 | c5c0c976e6a53a83d7a5e56cc31332f06d2a7f62 | donovan68/musikcube | /src/plugins/httpdatastream/stdafx.cpp | C++ | cpp | 1,777 | permissive | //////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2004-2019 musikcube team
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redist... |
70a3e3dbe9805959109d9347301ce5a39e2dd416 | 313fc1b98875a473566d6e222088eb796a372505 | admecoin/Zeon_hex | /src/zeon-cli.cpp | C++ | cpp | 9,639 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin developers
// Copyright (c) 2009-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Copyright (c) 2018-2019 The ZEON Core developers
// Distributed under the MIT/X11 software license, see the accompanying
// file ... |
9de72381a3db8622e031f6d9bd06fac4461767b2 | a5b1a0a22317ab717f26e505e10362e427b470ba | mostafaoraei/Piscine_cpp | /D0/ex02/main.cpp | C++ | cpp | 1,819 | no_license | #include <iostream>
#include <vector>
#include "Account.h"
int main() {
typedef std::vector<Account::t> account_t;
typedef std::vector<int> ints_t;
typedef std::pair<account_t::iterator, ints_t::iterator> acc_int_t;
int const amounts[] = {42, 54, 957, 432, 1234, 0, 754, 16576};
size_t const amoun... |
fd07e4a161e2b76ff9562a5e9a90011b0211bccf | 49043aa6ddb896641722b3177c1d4cda2f7e6c48 | mlc-masternode/masterleisurecoin | /src/spork.cpp | C++ | cpp | 11,110 | permissive | // Copyright (c) 2014-2016 The Dash developers
// Copyright (c) 2016-2017 The PIVX developers
// Copyright (c) 2017-2018 The Bitcoin Green developers
// Copyright (c) 2018 The Masterleisurecoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.or... |
9066d101a0f2bee3729c9beb744f5dc2f240ba57 | 6fe10dfc02990d3e7520f659372006320a2973fb | jorgefpont/CSF002A | /hwk3/hwk3.cpp | C++ | cpp | 3,751 | no_license | /* ======================================================
File Name : hwk2.cpp
Author : Jorge Pont
Copyright : N/A
Description : hwk3 cdf002A
Rev History : initial
Date : 10/11/2020
Version : 1.0
Comments :
Change ID : NA
Author : Jorge Pont
==================================... |
06ec0fee0a8c01f7558a307c2865ec8f967c083e | dc57fd71681025d0a3f0f817bfeea23f7d70aa04 | snowrain10/BOJ | /11944.cpp | C++ | cpp | 890 | no_license | #include<iostream>
#include<string>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
// 첫번째는 문자열로 입력받음
string N;
int M;
cin >> N >> M;
int len = N.length();
// string을 int로 변환
int num = stoi(N);
string result;
// 문자열을 갯수만큼 출력했을 때, M보다 크면, M만큼만 출력
... |
05e8d84cb6fc8a2cdd62e02712ddc902df0dfae5 | e028b755c74f56d65bfd091362d4ebdd80677195 | sonugiri1043/LeetCode | /LeetCode_209_Min_size_subarray_sum.cpp | C++ | cpp | 965 | no_license | /*
209. Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s,
find the minimal length of a contiguous subarray of which the sum ≥ s.
If there isn't one, return 0 instead.
Example:
Input: s = 7, nums = [2,3,1,2,4,3]
Output: 2
Explanation: the subarray [4,3] has the m... |
374e7da41de186cc22d4a0878f571045a717f38f | 3976719a5c00766961535f31c54905da45690181 | h4hany/leetcode | /python_solutions/1157.online-majority-element-in-subarray.cpp | C++ | cpp | 22,190 | no_license | // C libraries
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
// Containers
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_se... |
486302f5214424cce741dbc26d7b2a112bb8649d | 0c5df856d9c8e1b0b5129ba1ad7fa28074000af8 | abdollah110/DM2017 | /RecoStudy/EverythingWithEta2p1/NewOutFiles_Preselection_JetPt50_200_Lplus/CodexAnalyzer_Preselection.cc | C++ | cc | 53,804 | no_license | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// This code is to pre-select the events. This ise used as a base for background estimation, ...
// To run this code one first needs to compile it:
//1) ./Mask.sh CodexAnalyzer_Preselection.cc
//2) ./Cod... |
56e5b291590030d4f0a921640d88b82a9551b22e | de3857175dffdb6a19b495a1e3ec3cdc47b973a5 | KozhevnikovDenis/HH | /ActiveX, ATL/POSU2 Button/POSU2ButtonPropPage.cpp | C++ | cpp | 1,905 | no_license | // POSU2ButtonPropPage.cpp: реализация класса страницы свойств CPOSU2ButtonPropPage.
#include "pch.h"
#include "framework.h"
#include "POSU2 Button.h"
#include "POSU2ButtonPropPage.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
IMPLEMENT_DYNCREATE(CPOSU2ButtonPropPage, COlePropertyPage)
// Схема сообщений
BEGIN_ME... |
ab0984654af3d7e906558451a5e8bcad04b5200e | 1ee83df72fadd11769c0bd5725e96fe5edd06ead | bcace/boids | /src/serial.cpp | C++ | cpp | 1,785 | no_license | #include "serial.h"
#include "platform.h"
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <assert.h>
Serial serial_make(char *_data, int _capacity) {
Serial s;
s.data = _data;
s.read = 0;
s.written = 0;
s.capacity = _capacity;
return s;
}
void serial_clear(Serial *s) {
... |
bf5d9e99c51ae45cda52efa75e2913db9fddacf2 | db76cb64a1c64ded454cdd38cae880421c647217 | cruro/cruro | /src/qt/modaloverlay.cpp | C++ | cpp | 6,149 | permissive | // Copyright (c) 2016-2018 The Cruro Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <qt/modaloverlay.h>
#include <qt/forms/ui_modaloverlay.h>
#include <qt/guiutil.h>
#include <chainparams.h>
#include... |
93b6abcb346aaa2bb028b02159341795acda9663 | f485a7a77f4c61cad614cf6c3fce1c01d220d65a | filipeabelha/gym-solutions | /cdf/101015b.cpp | C++ | cpp | 601 | no_license | #include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define cl(x, v) memset((x), (v), sizeof(x))
#define db(x) cerr << #x << " == " << x << endl
#define dbs(x) cerr << x << endl
#define _ << ", " <<
typedef long long ll;
typedef long double ld... |
0299666130607485fb679ad0ecf25d08118e0d69 | 9e8475dac55c11cc6fa06ce6089fa5b0b6b5e30d | dnfield/engine | /shell/platform/fuchsia/dart-pkg/zircon/sdk_ext/system.cc | C++ | cc | 20,035 | permissive | // Copyright 2013 The Flutter 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 "system.h"
#include <array>
#include <fcntl.h>
#include <lib/fdio/directory.h>
#include <lib/fdio/io.h>
#include <lib/fdio/limits.h>
#include <l... |
04fe87d39b064646d4b9aaf36da72af035ee1f1e | 81f76a21403b713ea51eda5a0456ff23afe93756 | AliEmili/codeforcesProblem | /Candies and Two Sisters/main.cpp | C++ | cpp | 320 | no_license | #include <iostream>
using namespace std;
int main() {
int t;
long long n;
cin >> t;
while(t--){
cin >> n;
if(n<3){
cout << 0 << endl;
}else if(n%2==0){
cout << n/2-1 << endl;
}else{
cout << n/2 << endl;
}
}
return 0;
} |
5de56fe3ff74abbde9904fd52dbcfe571002cbec | 898044991a4874b8353cafd513d90529ad3ec897 | Liquid369/dogecash-1 | /src/masternode.cpp | C++ | cpp | 24,126 | permissive | // Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2017-2020 The PIVX Developers
// Copyright (c) 2020 The DogeCash Developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "masternode.h"
#include "... |
3244c363c41136626951d4d7913f12402dabe223 | 17bd69b7c0d5cc8f6cddaa1748c3ac99b307ee1e | Noiri/Yukicoder_with_Cpp | /level_1.5/No146_試験監督(1).cpp | C++ | cpp | 358 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main(){
int n;
cin >> n;
ll ans = 0;
for(int i=0; i<n; i++){
ll c, d;
cin >> c >> d;
if(c%2 == 0) c--;
ans += ((c/2+1) % MOD) * (d % MOD);
ans %= MOD;
}
co... |
682c6bbcf79c8ffc784c81aaa4eb47124ad64d58 | 7a5fbe81e3e7670a6c019c644c18c0e5b7e9de4e | wmonnette/Coursework | /COMP 2710/P3/P3_wjm0017.cpp | C++ | cpp | 5,220 | no_license | /* Wesley Monnette
* wjm0017
* P3_wjm0017.cpp
* Compiled with g++
*
* g++ P3_wjm0017.cpp
*/
#include <fstream>
#include <iostream>
#include <cstdlib>
#include <string>
#include <cassert>
using namespace std;
const int MAX_SIZE = 100;
// Input: 1. Array storing data retrieved from the file (i.e., instream)
//... |
13bac3350c2f4f9175a033f1b2484c40d76a53ea | 38ed3d152a39906d15201b752c0ce081935b6c6f | Chazyboy775/Dead-by-Daylight-SDK | /SDK/杀机_BP_FS_Badge01_ACC_parameters.hpp | C++ | hpp | 889 | no_license | #pragma once
// ÀèÃ÷ɱ»ú (4.22.3) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ɱ»ú_BP_FS_Badge01_ACC_classes.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Parameters
//---------------------------------------------------------------------------... |
14d5dd0f58fc71ab8a7268dac50ebd2d4055a088 | ed86ee4a12aa6d6177386400c4e521540af9edb3 | DRG-Modding/Header-Dumps | /Current/DLCclaimPopup_DLC03_Roughneck.hpp | C++ | hpp | 909 | no_license | #ifndef UE4SS_SDK_DLCclaimPopup_DLC03_Roughneck_HPP
#define UE4SS_SDK_DLCclaimPopup_DLC03_Roughneck_HPP
class UDLCclaimPopup_DLC03_Roughneck_C : public UWindowWidget
{
FPointerToUberGraphFrame UberGraphFrame;
class U_DLCclaimPopup_Base_C* DLCclaimPopup_Base;
class U_DLCclaimPopup_TextLine_C* UI_ClaimableDL... |
5d6eb427bdb6bfe6b3e9c770e81f4fbdc52cbbf4 | 6f34c816b0d96102b40d147b54ad7f68cd1f6919 | FeCastle/arum | /bprobe/include/dyn_detail/boost/detail/atomic_count_gcc_x86.hpp | C++ | hpp | 1,779 | no_license | #ifndef DYN_DETAIL_BOOST_DETAIL_ATOMIC_COUNT_GCC_X86_HPP_INCLUDED
#define DYN_DETAIL_BOOST_DETAIL_ATOMIC_COUNT_GCC_X86_HPP_INCLUDED
//
// boost/detail/atomic_count_gcc_x86.hpp
//
// atomic_count for g++ on 486+/AMD64
//
// Copyright 2007 Peter Dimov
//
// Distributed under the Boost Software License, Ver... |
7305e7062cf8de5bfcb7f6a05f93f591c5875964 | ef5a81e4ec35959e9d73405765260222f487db49 | therealdarkknight/Rambug-Engine- | /src/maths/vec2.cpp | C++ | cpp | 10,392 | no_license | /*
DO NOT DELETE THIS COMMENT:
The ROM(Rambug Optical Mathematics) Library:
This software is written by Danyil Blyschak, 8/2015 (1st Build).
For any permissions, questions, or bug fixes, email the
support email that came with your distribution of this software.
*/
#include "vec2.h"
namespace Rambug
{
nam... |
a1471327320add419d29b338cb073e8f6e5fa8ce | 70290a4324b0968bffa5b26f85bc373c5b0021d3 | Augusto-DF/Lab03 | /src/q01/bebida.cpp | C++ | cpp | 944 | no_license | /**
* @file bebida.cpp
* @author Mattheus Augusto Pinheiro de Oliveira
* @brief Implementação da classe bebida
*/
#include <iomanip>
#include "bebida.h"
/**
* @brief Construtores e Destrutor
*/
Bebida::Bebida(){}
Bebida::Bebida(std::string _codigo, std::string _descricao, double _preco, double _teor):
Produto(... |
3b94cc02a0b4942390c506e49950c3d04c005c1f | 923150b8306ad9e909ff79e0dba73c81fd871069 | wouf/cmssw | /DQM/HLXMonitor/src/HLXMonitor.cc | C++ | cc | 67,573 | permissive | /*
Author: Adam Hunt
email: ahunt@princeton.edu
*/
#include "DQM/HLXMonitor/interface/HLXMonitor.h"
#include "FWCore/Version/interface/GetReleaseVersion.h"
// STL Headers
#include <math.h>
#include <iomanip>
#include <TSystem.h>
using std::cout;
using std::endl;
HLXMonitor::HLXMonitor(const edm::Paramete... |
e95148673aa22a4e7c6a431307697cb9766d2226 | eed1ba72753ec5956f487233a822deab0e8b21cc | huitianbao/C-plusplus | /2016_12_16_huhao fuxi sort 1/sort 1.cpp | C++ | cpp | 553 | no_license | #include<iostream>
using namespace std;
// failed 2016_12_16
int main(){
// 数组 类型
int a[20];
//for(int j=0;j<10;j++){ //产生随机数
for(int i=0;i<20;i++){
a[i]=rand()%20+1;
}
for(int k=0;k<20;k++){
cout<<a[k]<<" ";
}
cout<<endl<<endl;
//}
void swap(int a,int b){
int tmp;
t... |
23613e7e80540494e56af3bbb1f303381ce5ab3e | a849d733cc5dae9b4382ddc5dd35e8953d7c7f9b | nerdlabs001/SSF-Lab | /src/qt/bitcoinamountfield.cpp | C++ | cpp | 8,230 | permissive | // Copyright (c) 2011-2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <qt/bitcoinamountfield.h>
#include <qt/bitcoinunits.h>
#include <qt/guiconstants.h>
#include <qt/qvaluecombobox.h>
... |
dcf23601e6be579817467cb43eb4b55c47f25dc5 | d42c6f2c02ed8122018f6eb59247c8235dad2943 | zakhars/Education | /Coursera/Yandex_CppWhite/Coursera_CppWhite_Week02_Task10.cpp | C++ | cpp | 1,659 | permissive | #include <iostream>
#include <vector>
#include <string>
using namespace std;
void NextMonth(vector<vector<string>>& month, int new_days)
{
int old_days = static_cast<int>(month.size());
vector<string> records_left;
if (new_days < old_days)
{
for(int i = new_days; i < old_days; i++)
{
... |
0bc45cca9e3d2cbae56a23ed0109787b6a9fe2b1 | 2dd2dbff475e157fb575793fb69feffd839f29ec | abhisehekkumr/linked-list | /bubbleSort.cpp | C++ | cpp | 1,189 | no_license | //head is the head of the linked list
// Following is the node structure
/**************
class node{
public:
int data;
node * next;
node(int data){
this->data=data;
this->next=NULL;
}
};
***************/
node* bubble_sort_LinkedList_itr(node* head)
{
if(!head)
return head;
... |
eed5e1f16908adc740b08a9ec976fc6a4b7ae358 | 039cf0cfa07818e444a0d9a1f8f8176dd952388d | askoulwassim/Algorithms-and-Data-Structures | /hw29/D1.cpp | C++ | cpp | 1,464 | no_license | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
using namespace std;
int main() {
int* arr;
arr = new int[5];
for (int i = 0; i < 5; i++) {
arr[i] = 0;
}
double highest_sum = 0.0;
for (int x1 = 1; x1 < 21; x1++) {
for (int x2 = 1; x2 < 21; x2++) {
for (int x3 = 1; x3... |
5a3bdd64d671b27dc9c7a38c929eafc23607b52d | fc9b71241ba3348fd14800011fe14c3419ffae5c | mh755628/contest | /number_theory.cpp | C++ | cpp | 4,375 | no_license | namespace nt {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int64_t rand(int64_t l, int64_t r) {
return l + rng() % (r - l + 1);
}
template <typename T = int64_t, typename U = __int128_t>
T pow(T a, T b, T mod) {
a %= mod;
T r = 1;
for(T... |
ef5f950059535a673cee2e33afd16d5f3e2bacd2 | 2e124bec885101da73086afa5c1642c9f6f78a7b | shiver/blaze-lib | /blazetest/src/mathtest/dmatdmatmult/SUDbSDa.cpp | C++ | cpp | 4,351 | permissive | //=================================================================================================
/*!
// \file src/mathtest/dmatdmatmult/SUDbSDa.cpp
// \brief Source file for the SUDbSDa dense matrix/dense matrix multiplication math test
//
// Copyright (C) 2013 Klaus Iglberger - All Rights Reserved
//
// This fi... |
d3975d482afd972230742dceb6d3d69cbec767fb | 0e9cfb87a59bbd8e0140c8725e9230da4a85b0c2 | barisCanCoskun/Cpp-Programming | /10Section13/ConstructorsAndDestructors/main.cpp | C++ | cpp | 1,238 | permissive | #include <iostream>
#include <string>
using namespace std;
class Player{
private:
string name;
int health;
int xp;
public:
void set_name(string n)
{
name = n;
}
//Overloaded constructors
Player()
{
cout << "No args constructor called" << endl;
}
Player(strin... |
808405bad9bee034105655c9b956990a830bd1c7 | 1dcea237bc43c947e9ab6557fd9fb1a5b1e5f858 | tryanaditya/mainmain | /supporting libraries/pyside/PySide-1.2.4/pyside_build/py3.5-qt4.8.7-64bit-release/pyside/PySide/QtGui/PySide/QtGui/qwidgetaction_wrapper.cpp | C++ | cpp | 35,902 | no_license | /*
* This file is part of PySide: Python for Qt
*
* Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
*
* Contact: PySide team <contact@pyside.org>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* version 2... |
c476471cdc3865a9d00f35711aaaa4c2d2ec7157 | de68add7f132e23df5bfbfbb504ba005e47db943 | code-tom-code/FPGAGPUTesting | /CPUDrivenGPUTest2/Software_d3d9_Driver/Software_d3d9_Driver/IDirect3D9Hook.cpp | C++ | cpp | 13,906 | permissive | #pragma once
#include "IDirect3D9Hook.h"
COM_DECLSPEC_NOTHROW HRESULT STDMETHODCALLTYPE IDirect3D9Hook::QueryInterface(THIS_ REFIID riid, void** ppvObj)
{
HRESULT ret = d3d9->QueryInterface(riid, ppvObj);
if (ret == NOERROR)
{
*ppvObj = this;
AddRef();
}
return ret;
}
COM_DECLSPEC_NOTHROW UL... |
215bd88a10e53fffb2eb3bca397d961c58a949cd | 74efb4e134c7ff4ccfb34e1b4c8bcefc332e83d4 | wenii/EGLDemo | /framework/jni/Texture.cpp | C++ | cpp | 1,513 | no_license | //
// Created by Administrator on 2017/7/21.
//
#include "Texture.h"
#include "../../thirdparty/stb/stb_image.h"
#include <GLES3/gl3.h>
#include <GLES3/gl3ext.h>
#include <unistd.h>
#include "PackageFiles.h"
#include "Log.h"
unsigned int Texture::LoadTextureFromBuffer(void* buffer, int length)
{
GLuint textID =... |
c67c0cffe8f8819b344e1c9d31b54d1dec1d6458 | 7a9c73336b0578547cf272750f55de6b79514d9c | whywhyzhang/ACM-ICPC-Code | /2014Train/VJ/1/1_M.cpp | C++ | cpp | 1,774 | no_license | #include<iostream>
#include<cstring>
using namespace std;
int que[1000006],las,fir;
int A,B,C;
long long vis[101][101][101];
bool judge(int x,int y,int z)
{
if(vis[x][y][z]==-1)
return 1;
return 0;
}
long long slove()
{
int temp,t1,t2,t3;
int base;
las=fir=0;
memset(vis,-1,sizeof(vis));
que[las++]=A*110*... |
c9693ed7fb9e93a60514951bbc73f04b57d67dae | 415e6774da66d5f573436ee1e5baf4ccfff577ae | landcreator/ebos | /plugins/kafka_plugin/kafka.cpp | C++ | cpp | 6,682 | permissive | #include "kafka.hpp"
#include <fc/io/json.hpp>
#include "try_handle.hpp"
namespace std {
template<> struct hash<kafka::bytes> {
typedef kafka::bytes argument_type;
typedef size_t result_type;
result_type operator()(argument_type const& s) const noexcept {
return std::hash<string>{}(string(s.begin... |
7351983a83bd8428095a210829a9fc22f897fbe3 | d1fc60dbddd39750b38104b2a0c8798e965d3899 | HaramakiPtr/CalcLED3gx | /Sources/main.cpp | C++ | cpp | 2,941 | no_license | #include "common.hpp"
namespace CTRPluginFramework
{
const std::string about = "Twitter @HaramakiPTR\n\n" \
"<参考>\n" \
"https://github.com/HIDE810/MultiFunc3gx/blob/master/Sources/calc.cpp\n\n" \
"https://blog.goo.ne.jp/masaki_goo_2006/e/d77c7b85b3dbc04b1b36cf88eaf57d73\n\n" \
"https://www.3dbrew.org/wiki/MCU... |
88cb4736321f86896c2f7dfa5a50c7a855ab2622 | 4e230b29e27c5f4a9759af87d28e05cc7ac1d6c3 | svarvel/browser-android-tabs | /net/disk_cache/disk_cache_test_base.cc | C++ | cc | 12,511 | permissive | // Copyright (c) 2012 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/disk_cache/disk_cache_test_base.h"
#include <utility>
#include "base/files/file_util.h"
#include "base/path_service.h"
#include "base/... |
94660731bfbd74c6df299553291064267fcd451f | 17a25a093c541a8f7ccde4946ad79cfb04ec13fb | mbeven/FINM_2016_SPRING | /FINM 32400/quickfix-1.14.3/quickfix/src/C++/test/MySQLStoreTestCase.cpp | C++ | cpp | 2,455 | permissive | /****************************************************************************
** Copyright (c) 2001-2014
**
** This file is part of the QuickFIX FIX Engine
**
** This file may be distributed under the terms of the quickfixengine.org
** license as defined by quickfixengine.org and appearing in the file
** LICENSE... |
cab7ffbc232874189b2685b3aca51bb68b977186 | fc60a0a99d4a6717c81fe746f1ab6f5ff314919b | Vizionnation/chromenohistory | /chrome/services/app_service/public/cpp/intent_filter_util.cc | C++ | cc | 2,274 | permissive | // Copyright 2019 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/services/app_service/public/cpp/intent_filter_util.h"
namespace apps_util {
apps::mojom::ConditionValuePtr MakeConditionValue(
cons... |
9ef2d39e2a3c656d48441ee367964f478925e88d | 2f9f9025e394bac6a756f4c77794d2132d06148d | teerta/Biu | /sln/Biu/src/Biu.Transmission/QuickObject.cpp | C++ | cpp | 10,375 | no_license | #include "stdafx.h"
#include "QuickObject.h"
using namespace Biu::Transmission;
using namespace System::Text;
// CommandBase
CommandBase::CommandBase()
: CommandVar(0)
, PartialToken(0)
{
}
bool CommandBase::BSerialize(BiuSerializer^ ser)
{
bool bRet = true;
try
{
CommandTimestamp = DateTime::Now;
ser
... |
8214f3a0efd8f023105e8ff7987b12f21a6d9650 | ed23734bb070db375a3b0a28e3baf99da2e7acda | abdur-rahman-mbstu/Uri-Solution | /2532 Demogorgon.cpp | C++ | cpp | 715 | no_license | #include<bits/stdc++.h>
using namespace std;
int n,m,dam[1002],mana[1002],dp[1001][2101];
int fun(int pos, int tdam)
{
int p=0,q=0;
//cout<<pos<<" "<<tdam<<endl;
if(pos==n)
{
if(tdam>=m) return min(p,q);
else return 2000000;
}
if(dp[pos][tdam]!=-1) return dp[pos][tdam... |
adbca438d364425240b7ad8265d40c7267248889 | d92079fdacc27789024a4073ce3b93915a514c97 | jyhsia5174/algo | /leetcode/131.cpp | C++ | cpp | 1,402 | no_license | // 131. Palindrome Partitioning
class Solution {
public:
vector<vector<string>> partition(string s) {
vector<vector<string>> res = doPartition( 0, s);
for(auto &v: res )
reverse( v.begin(), v.end() );
return res;
}
bool isP( const string &s ){
int i = 0, j = ... |
d20fd9fb74bab915b46b4bd097ff92c63a6a721d | 0e5ad9ceaf78015dc7c2ce21d100d4f153920fc9 | vinothgcdm/learn_cpp | /parallel-prog/20-latch-demo/main.cpp | C++ | cpp | 1,424 | no_license | /**
* Deciding how many bags of chips to buy for the party
*/
/**
* a BARRIER is a stopping point for a group of threads that prevents them
* from proceeding until all, or enough threads, have reached the barrier.
*
* Barrier: Releases when certain number of threads are waiting.
* Latch: Releases when count va... |
19a2255da781e358e8aeadc27661c30d638f6e26 | 81c3914b188b9e82ae97c6728318b9df42bf9e89 | jaiminpan/TTalkServer | /src/slog/slog_api.cpp | C++ | cpp | 3,282 | permissive | //
// slog_api.cpp
// slog
//
// Created by luoning on 15-1-6.
// Copyright (c) 2015年 luoning. All rights reserved.
//
#include "slog_api.h"
#include "log4cxx/logger.h"
#include "log4cxx/basicconfigurator.h"
#include "log4cxx/propertyconfigurator.h"
#include "log4cxx/helpers/exception.h"
#include <stdarg.h>
using... |
d32e2e88dfc76743cd75faa7bbb95fb6dd72dd19 | bc8971785d7a523da1049a7c92bcc0c3710e7c73 | hryyan/Grunge | /ACM/LeetCode线性表.cpp | C++ | cpp | 9,858 | no_license | // Remove Duplicates from Sorted Array
class Solution
{
public:
int removeDuplicates(int A[], int n)
{
if (n == 0) return 0;
int index = 0;
for (int i = 0; i < n; )
{
if (A[index] != A[i])
A[++index] = A[i];
}
return index + 1;
}
}... |
bfb77e9b4066368f177085688a3e2d2fe35c8e0d | 563d1f53aac5609cd5b08e1bb6fc72a9f39c281e | green-fox-academy/KisG93 | /week-01/day-2/12alot/main.cpp | C++ | cpp | 444 | no_license | #include <iostream>
int main() {
int number = 0;
std::cout << "Hi, tell me a number plz. :)" << std::endl;
std::cin >> number;
if(number <= 0) {
std::cout << "Not enough" << std::endl;
} else if(number == 1) {
std::cout << "One" << std::endl;
}else if(number == 2) {
s... |
99686e1544382edf8818a51afc5f473c12311d79 | 294c430190c213318b729651691ec341057dd87d | ziuteg/uni-projects | /databases/project/db_functions.cpp | C++ | cpp | 10,613 | no_license | // Autor: Łukasz Siudek
// Indeks: 283493
#include <string>
#include <fstream>
#include <sstream>
#include <memory>
#include <functional>
#include <boost/optional.hpp>
#include <pqxx/pqxx>
#include "libs/va.hpp"
#include "libs/json.hpp"
#include "db_functions.h"
namespace db {
using json = nlohmann::json;
using H... |
f0d0e47bacc9ce4796083fcbe857e85d5f5a10e1 | fd9c1a52f36b4716f5a7da5e513b74498e16595a | Radiation-Physics-Group-of-Alexandria/GeantV | /realphysics/physics/vecem/src/GUKleinNishinaComptonModel.cc | C++ | cc | 7,072 | no_license | #include "GUKleinNishinaComptonModel.h"
#include "GUConstants.h"
#include "ThreeVector.h"
#include "SystemOfUnits.h"
#include "PhysicalConstants.h"
#include "Material.h"
#include "Element.h"
#include "MaterialProperties.h"
#include "MaterialCuts.h"
#include "Electron.h"
#include "Gamma.h"
#include "LightTrack.h"
#... |
bd0347f32447b7db3c94dda89c78226564660ff7 | 864b7a7dad720e735c3e8539429a1625b8886b4e | pathorn/sirikata | /simoh/src/OSegScenario.cpp | C++ | cpp | 12,992 | permissive | /* Sirikata
* OSegScenario.cpp
*
* Copyright (c) 2010, Ewen Cheslack-Postava
* 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 a... |
ad4b4a8eb3f39c029a3f77d3ac356873f1eab04c | 2d170422613c45b24c8f2f5245f380285bb0ac62 | thinkerahead/Learning-opencv | /OpenCV_example_code/chapter04/4-12_medianBlur.cpp | C++ | cpp | 1,807 | no_license | // C++ source file
/***********************************************
# Copyright (c) 2018, Wuhan
# All rights reserved.
#
# @Filename: 4-12_medianBlur.cpp
# @Version：V1.0
# @Author: Frank Liu - frankliu624@gmail.com
# @Description: 中值滤波
# @Create Time: 2018-10-05 16:34:21
# @Last Modified: 2018-10-05 16:34:21
**********... |
b29ce40e34e791ae336001e72960fceed98d5259 | 14665a86106074bef2f85fc25fd9aec0e042d45c | RomKaz/work-in-progress | /ca/communityconfigurationproject_e/Editor_AddedInvisibleZoneProtection/config.cpp | C++ | cpp | 924 | no_license | ////////////////////////////////////////////////////////////////////
//DeRap: Produced from mikero's Dos Tools Dll version 4.65
//Fri Oct 31 06:13:58 2014 : Source 'file' date Fri Oct 31 06:13:58 2014
//http://dev-heaven.net/projects/list_files/mikero-pbodll
/////////////////////////////////////////////////////////////... |
82e5db7089c0b3a81f969b21793fe7164433bc45 | 6f223ac90bd9696b7c3102dfbf6b1ab4bec57f2e | avasopht/boost_1_55_0-llvm | /libs/geometry/doc/src/docutils/tools/doxygen_xml2qbk/configuration.hpp | C++ | hpp | 1,212 | permissive | // Boost.Geometry (aka GGL, Generic Geometry Library)
//
// Copyright (c) 2010-2013 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2012-2013 Adam Wulkiewicz, Lodz, Poland.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt... |
529f91ac55acd86a79a2423c4fb7bfb39f988d3f | ed8f2eab6a393bb3364e84909850c2f23e084a0a | melton1968/xtensor | /include/xtensor/xutils.hpp | C++ | hpp | 26,572 | permissive | /***************************************************************************
* Copyright (c) Johan Mabille, Sylvain Corlay and Wolf Vollprecht *
* Copyright (c) QuantStack *
* *
* Distribute... |
b53fcaea4a5787b8b89a951ffb6864ee2c88c7c0 | 006a09fbbc49451e90929e1a5d53f3595fb5ee78 | pavankapoor31/chromium | /ash/wallpaper/wallpaper_controller_impl.cc | C++ | cc | 103,312 | permissive | // Copyright (c) 2012 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 "ash/wallpaper/wallpaper_controller_impl.h"
#include <memory>
#include <numeric>
#include <string>
#include <utility>
#include "ash/constan... |
2fb8e4a3f6df002009c8acbbbbdf3fc05654eb19 | a48c19113e1f0ae4fc9807d89c0b956d7e527ab6 | n00b87/RCBASIC3 | /rcbasic_edit/rcbasic_editrc_debugger.cpp | C++ | cpp | 601 | permissive | #include "rcbasic_editrc_debugger.h"
rcbasic_editrc_debugger::rcbasic_editrc_debugger( wxWindow* parent )
:
rc_debugger( parent )
{
}
void rcbasic_editrc_debugger::onPause( wxCommandEvent& event )
{
// TODO: Implement onPause
}
void rcbasic_editrc_debugger::onStep( wxCommandEvent& event )
{
// TODO: Implement onSte... |
4918f1d1acb7981a02bc48bd6505170d47ea482d | fad03074315ebbfbde6cfb7eb86a178d505adca8 | j717273419/hhvm | /hphp/runtime/vm/jit/irgen-builtin.cpp | C++ | cpp | 38,117 | permissive | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-2014 Facebook, Inc. (http://www.facebook.com) |
+---------... |
71596c1a7c5a39241960305bb7c59df4fdace8f0 | b7ffe262628011b62c705e206cce4fb0d8085b48 | vraoresearch/tensorflow | /tensorflow/lite/kernels/floor_div.cc | C++ | cc | 5,627 | permissive | /* Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
9c39183cb8af87a3222af14ba40504787eb93f12 | e77fd73db438143dcb3568eac784843dd58d9f67 | mostasimbillah/Programming-Contest | /CodeForces/122A. Lucky Division.cpp | C++ | cpp | 1,778 | no_license | /*
In the name of Allah,the most Gracious ,the most Merciful.
__ __ _ _ ____ _ _ _ _
| \/ | | | (_) | _ \ (_) | | | | | |
| \ / | ___ ___ | |_ __ _ ___ _ _ __ _... |
7ceeeaa6dffa142549d546af9fd98681ea7faf86 | a5b2e6746a53374d33fd0f02b394bf861cf52654 | DmitrySoshnikov/hhvm | /hphp/runtime/vm/func.cpp | C++ | cpp | 28,859 | permissive | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-2014 Facebook, Inc. (http://www.facebook.com) |
+---------... |
62f38322a1eaafec4833b3b8da23afb6c9c55e61 | 861d78f413cffaa4b0e6eb7839166b3fa9fc521d | apache/openoffice | /main/basctl/source/inc/basobj.hxx | C++ | hxx | 4,519 | permissive | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to y... |
f923e09632467be313784800591291147637a798 | 918369d5f838442eb927b5aef100177fd8ae647a | ltang15/Graphing-calculator | /function.cpp | C++ | cpp | 488 | no_license | #include "function.h"
#include "math.h"
double Function:: calc(double x){
if (_func =="sin")
return sin(x);
else if (_func =="cos")
return cos(x);
else if (_func =="tan")
return tan(x);
else if (_func =="log")
return log(x);
else if (_func =="sqrt")
... |
981fdd4ffc081668c0dfe1267c4d89a289009773 | ed9be90689b682ac7f0d159b49ae818d68225c58 | Reputeless/OpenSiv3D | /Siv3D/src/Siv3D/Script/Bind/ScriptVec4.cpp | C++ | cpp | 19,462 | permissive | //-----------------------------------------------
//
// This file is part of the Siv3D Engine.
//
// Copyright (c) 2008-2023 Ryo Suzuki
// Copyright (c) 2016-2023 OpenSiv3D Project
//
// Licensed under the MIT License.
//
//-----------------------------------------------
# include <Siv3D/Script.hpp>
# include <Siv3D/... |
029f182c6895184f34276111eb36235a012fa254 | d1b493b2dbcad2cea0060bbd3cf1c29a59827f05 | dean-wong/smart-car | /src/application.cpp | C++ | cpp | 5,916 | permissive | /*
*
*/
#include "application.h"
#include <Arduino.h>
#undef _DEBUG
// #define _DEBUG
#ifdef _DEBUG
#define LOG(x) Log2Serial(x)
#else
#define LOG(x) {}
#endif
// 设定SR04连接的Arduino引脚
#define SR_TRIG 4
#define SR_ECHO 5
#define LED_INDICATE 13
// 红外障碍物检测传感器，由于使用了中断，所以必须是2，3引脚
#define IRPIN_RIGHT 2
#defin... |
84eb2aa5c9e43e363a08a4cba60db22632832f0f | 3b4ac065f10d6dfff2227fe52449545463dab7c8 | qhdong/cpp-primer | /chapter-03/hex.cpp | C++ | cpp | 381 | no_license | #include <iostream>
#include <string>
using std::cout;
using std::cin;
using std::endl;
using std::string;
int main() {
const string hexdigits = "0123456789ABCDEF";
string res;
string::size_type n = 0;
while (cin >> n) {
if (n >= 0 && n <= 15) {
res += hexdigits[n];
}
}... |
7cea941de02ba98656e7bfac6479952f67618c61 | 096aa628f895a826b98ae8afbf7e440b3b947b36 | x10an14/tdt4260Group | /m5/src/arch/mips/interrupts.cc | C++ | cc | 5,342 | permissive | /*
* Copyright (c) 2006 The Regents of The University of Michigan
* Copyright (c) 2007 MIPS Technologies, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source co... |
3be2da27dc888b633864cd5f2e7c1d61863021a6 | 334e3fb82241275d430820dbeca862c519fc1b2e | aoleynichenko/cpp-mt-hw | /hw03/OutputWay.cpp | C++ | cpp | 866 | no_license | #include <fcntl.h>
#include <stdio.h>
#include <string>
#include <sys/stat.h>
#include <unistd.h>
#include "OutputWay.h"
using std::string;
OutputWay::OutputWay(data_type_t* buffer, size_t buf_size) {
buf = buffer;
size = buf_size;
pos = 0;
char fname[] = "/tmp/extsortXXXXXX";
fd = mkstemp(fnam... |
e3dc834cf2bc18a359a62fde920edca96a4e2c06 | 108c4aa8bdd52ca4fbdc0b7ab7318a5756b444e0 | matheusmso/code | /spoj/addrev.cpp | C++ | cpp | 616 | no_license | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
scanf("%d", &n);
for (int turns = 0; turns < n; turns++) {
scanf("%d %d", &x, &y);
int xr = 0;
int yr = 0;
while (x) {
xr *= 10;
xr += x%10;
x /= 10;
}
... |
284f0f78bc65435e5cdcce2b006f7b5834a92108 | 9ea8091dcec8c2a96d443faf3fd45b1885ae7463 | KanadeSiina/PracticeCode | /202003_practice/arc097/gen.cpp | C++ | cpp | 1,548 | no_license | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v <... |
b5048ea41c80974f96e9716241f4338cb2b72735 | af6c247f8567162a7cc242751bdd9336da62a195 | Hitachi-Data-Systems/ivy | /src/IosequencerRandom.cpp | C++ | cpp | 8,596 | permissive | //Copyright (c) 2016, 2017, 2018 Hitachi Vantara Corporation
//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/LICE... |
f75b88f949722d98bb1760560dc260f371c6bae4 | 73efef31b57115ac747d710e1a9e40a750c0bab8 | blizmax/Rogy-Engine- | /Engine/renderer/renderer.cpp | C++ | cpp | 58,040 | permissive | #include "renderer.h"
#include "cameraComponent.h"
#include "reflection_probe.h"
#include "GrassComponent.h"
IMPL_COMPONENT(ReflectionProbe)
IMPL_COMPONENT(CameraComponent)
IMPL_COMPONENT(GrassComponent)
#define LOG_INFO std::cout << "RENDERER : " <<
#define END_LOG << std::endl
// ----------------------------------... |
a1c614f6ec1eb00409f62d7709a1fa93b31fcf6d | 50c8d9dae89b8589b477d8853240f0cd1cafe0b4 | ExpLife/Norton_AntiVirus_SourceCode | /AVCore/Trunk/Source/NPS/SRC/NPSINIT.CPP | C++ | cpp | 41,540 | no_license | /* Copyright 1991-1993 Symantec, Peter Norton Computing Group */
/************************************************************************/
/* */
/* $Header: S:/NPS/VCS/NPSINIT.CPv 1.14 15 Apr 1998 17:27:46 mdunn $ */
/* ... |
e05d50cb41f61d16b89ba193e12f7aa65569883a | aeb99ddf9bf1de9c75695c6ee3af2155452fc4b5 | yinweijie/Leetcode-Leetbook | /problemset/leetcode-55.cpp | C++ | cpp | 431 | no_license | // 55. 跳跃游戏
// https://leetcode-cn.com/problems/jump-game/
#include <vector>
#include <cassert>
using namespace std;
class Solution {
public:
bool canJump(vector<int>& nums) {
assert(nums.size() > 0);
int maxPos = nums[0];
for(int i = 0; i < nums.size(); i++) {
if(i > maxPos)... |
6cebe69d61692c03a558aeb30fb24f0ddaac56ad | 83eb81d74be8395bdc2d15205e216f326afc910e | davidkatanik/trivial-betting-company-2013 | /Tikety.cpp | C++ | cpp | 4,180 | no_license | #include "Tikety.h"
//---------------------------------------------------------------------------
TTiketList *SeznamTiketu; // pointer na seznam tiketu aplikace
//---------------------------------------------------------------------------
__fastcall TTiket :: TTiket(unsigned IdTik,unsigned IdUziv,float KurzTik,f... |
142e0d6c9f40c85cd98f3cd4f0d71b70d9a03dcb | 3236f40558c42a83ba85d2a3fb77d661fbfb79a4 | Unreal-kurs/04_BattleTank | /BattleTank/Source/BattleTank/Private/TankTurret.cpp | C++ | cpp | 386 | no_license | // Copyright Spelgarden ENK and EmbraceIT Ltd.
#include "TankTurret.h"
void UTankTurret::Rotate(float RelativeSpeed)
{
RelativeSpeed = FMath::Clamp<float>(RelativeSpeed, -1.f, +1.f);
auto RotationChange = RelativeSpeed * MaxDegreesPerSecond * GetWorld()->DeltaTimeSeconds;
auto Rotation = RelativeRotation.Yaw + Rot... |
c487114e2c8bedfd78f0476aabf8b4540980c437 | 13c530a6e9b4be70ebc48675f8d35686da15ff4b | SiteView/ECC8.1.3 | /ECC8.1/Server/kennel/monitor/unix/monitor/WebLogic7x.cpp | C++ | cpp | 6,307 | permissive |
#include "WebLogic7x.h"
#include "SnmpUtils.h"
#include "base\funcGeneral.h"
// -- JmsRuntimeMBean
struct oid jmsRuntimeTable = {{0x2b, 6, 1, 4, 1, 140, 625, 240}, 8, "", 0, ""};
struct oid jmsRuntimeIndex = {{0x2b, 6, 1, 4, 1, 140, 625, 240, 1, 1}, 10, "", ASN1_OCTSTR, ""};
struct oid jmsRuntimeObjectNam... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.