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 |
|---|---|---|---|---|---|---|---|---|
d5e64d6c21183ae321e9353dc4fb729c9ec23ee6 | 18740c7030aef101b8da28b24d946fd84db816ac | unknownbrackets/maxcso | /7zip/CPP/7zip/Archive/Wim/WimHandlerOut.cpp | C++ | cpp | 50,522 | permissive | // WimHandlerOut.cpp
#include "StdAfx.h"
#include "../../../Common/ComTry.h"
#include "../../../Common/IntToString.h"
#include "../../../Common/StringToInt.h"
#include "../../../Common/UTFConvert.h"
#include "../../../Common/Wildcard.h"
#include "../../../Windows/PropVariant.h"
#include "../../../Windows/TimeUtils.h... |
521a0334161425a3138d9d4ce872fd29b70ccc16 | 27239d973113be800ca8178621085145ab3c716d | refaqtor/ProjectConceptor | /src/plugins/GroupCommand/Group.cpp | C++ | cpp | 4,373 | no_license | #include "Group.h"
#include "ProjectConceptorDefs.h"
Group::Group():PCommand() {
}
void Group::Undo(PDocument *doc,BMessage *undo) {
PCommand::Undo(doc,undo);
int32 i = 0;
BMessage *currentContainer = NULL;
BMessage *node = NULL;
BMessage *subNode = NULL;
BList *subList = NULL;
... |
d3a5713025f19e4960e8a9b98999c418123aff91 | b6f8a2c55993ac30aef7238363d205b0bb4b1751 | ppwwyyxx/pytorch | /aten/src/ATen/test/vec_test_all_types.cpp | C++ | cpp | 65,735 | permissive | #include <ATen/test/vec_test_all_types.h>
#include <c10/util/irange.h>
namespace {
#if GTEST_HAS_TYPED_TEST
template <typename T>
class Memory : public ::testing::Test {};
template <typename T>
class Arithmetics : public ::testing::Test {};
template <typename T>
class Comparison : public ::testi... |
0fcb340145bd7b4691ccc3c5aa28568b9ef883f6 | 0c5df568b69df4222366fba8912a953f4ec9ffc9 | tangzhijun/cpp11-and-DX11-Tutorials | /Chapter1/Tutorial9/Tutorial9.cpp | C++ | cpp | 459 | permissive | #include <iostream>
#include <memory>
#include "Hero.h"
using namespace std;
void main() {
// Never do this
Hero* hero = new Hero("Chloe");
hero->print();
delete hero;
cout << "----------------" << endl;
{
auto bob = make_shared<Hero>("Bob");
bob->print();
}
cout << "----------------" << endl;
{
share... |
d4d85f04dd2f905e13f1ee830e47c9a37f1346c2 | e81363fc4edb9bd3e77c251ea26a8bb93bb5b61d | abdullah-ch/Composition-and-Aggregation- | /Task 2/ConsoleApplication170/CompactDisc.cpp | C++ | cpp | 870 | no_license | // ConsoleApplication169.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "CompactDisc.h"
using namespace std;
CompactDisc::CompactDisc()
{
cout << "CompactDisc constructer has been called" << endl;
}
void CompactDisc::Size_Capacity_Compact_Disk(int Capacity)
{
this->Ca... |
c7249479efd51fcafc07525dcc9258243d9ca233 | 5911f72c2288dfb1f8cf32ce7ee76b92c805ff66 | blazegeek/geek | /src/llmq/quorums_utils.cpp | C++ | cpp | 1,091 | permissive | // Copyright (c) 2018 The Dash Core developers
// Copyright (c) 2018-2019 The GeekCash developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "quorums_utils.h"
#include "chainparams.h"
#include "random.h"
namespac... |
739d4902a0440b643a70175e9eec6960c9fafe89 | c3f32a4c45a9e3b94611634f2d310db0398d029f | mszoek/llvm-project | /lldb/source/Interpreter/CommandReturnObject.cpp | C++ | cpp | 5,042 | permissive | //===-- CommandReturnObject.cpp -------------------------------------------===//
//
// 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
//
//===---------------------------... |
dfee46acfe6a94eeee817c71e0ed39930d30a2ca | d9cc588a60b65efde16bab925340ded7dea9c764 | Sookmyung-Algos/2021algos | /algos_assignment/2nd_grade/황수연_syhwang1231/week1/1158.cpp | C++ | cpp | 773 | no_license | #include <iostream>
#include <queue>
using namespace std;
int main(void)
{
int m, n;
queue<int> q;
cin >> n >> m;
for (int i = 1; i <= n; i++) //1부터 n까지 들어간 queue 만들기
q.push(i);
cout << "<" ;
while (q.size() > 1) //1개가 남기 전까지
{
for (int i = 0; i < n-1; i++) //n-1만큼 실행(그래야 하나가 남게 됨)
{
for (int... |
ba82bf4861bb8f987b6ec5ff37c22deeba83a4e9 | 8491f12b1638a4ecaa9aa8102279b80da9e1a7cb | kjhgnkv/DSControl_17_09 | /nodeeditor/utils/undo/AddGraphicsArrowCommand.hpp | C++ | hpp | 821 | no_license | #pragma once
#include "AbstractSceneCommand.hpp"
#include <QPointer>
namespace QtNodes
{
class FrameGraphicsItem;
class UniversalConnectionableItem;
class FlowScene;
class ArrowController;
namespace Arrows
{
class AbstractArrow;
}
class AddGraphicsArrowCommand : public AbstractSceneCommand
{
public:
AddGraphic... |
cb3f7682ee7301a5c63a7a1c43bb36fb21787c04 | 110c688c0342044b37f07076b193f552c7383570 | T-Dimov/OOP2016 | /Homeworks/Homework1/schedule.cpp | C++ | cpp | 2,339 | no_license | #include "stdafx.h"
#include "schedule.h"
#include <assert.h>
Schedule::Schedule() :size(0), capacity(20), container(nullptr)
{
container = new Appointment[capacity];
}
Schedule::Schedule(const Schedule& o) :container(nullptr)
{
copy(o);
}
Schedule& Schedule::operator=(const Schedule& o)
{
if (this != &o)
{
de... |
8296d5d3ef4356f4d89a3d869c33f427383563c0 | 5740119bf5b45bf99c1ff2bff8a65ca1756cfe59 | duinomaker/game2048 | /engine/include/Move.hpp | C++ | hpp | 401 | no_license | #ifndef __GAME2048_MOVE__
#define __GAME2048_MOVE__
#include <iostream>
namespace game2048 {
enum class Move {
UP = 0,
DOWN = 1,
LEFT = 2,
RIGHT = 3,
UNKNOWN = -1
};
static const Move allDirections[] = {
Move::UP,
Move::DOWN,
Move::LEFT,
Move::RIGHT
};
std::ostream& operator<<(st... |
4f90404d96f194ff733e2855584f294539e31930 | 33e9fb2857cc990e3a4e7f290abdc7112fd70028 | yoricsv/DynamicallyIndication | /PProcEnumSwitch/main.cpp | C++ | cpp | 12,829 | no_license | #include <iostream>
//#include <iomanip>
using namespace std;
/* SETTINGS ------------------------------------------------------------------*/
// CHOOSE A TYPE OF DYSPLAY //
#define SEVEN_SEGMENT_DYSPLAY
//#define SIXTEEN_SEGMENT_DYSPLAY
// TYPE A QUANTITY OF DYSPLAYS //
#define NUMBER_OF_DYSPLAYS 4
// CHOOSE AN ... |
32d89bc276622c6baa31aece1ab498403cf2daba | ed9fc4685bf168cf99767151ec2d0f33f209b75f | Kei-phi/GitAOJ | /C++/intro/a_div_b.cpp | C++ | cpp | 243 | no_license | #include <iostream>
#include <iomanip>
using namespace std;
int main(){
int a, b;
int r;
cin >> a;
cin >> b;
cout << a / b << " " << a % b << " " << fixed
<< setprecision(5) << (double)a / (double)b << endl;
return 0;
}
|
dbe20f003bc3b73a95180b944492044ff0144a9d | b24d864b7bc1c25f4539a8d40e40dcfb6512ee23 | zH4x/SoT-Insider-SDK | /Cpp/External/SDK/BP_PromptActor_EmissaryStoleLoot_MA_functions.cpp | C++ | cpp | 3,555 | no_license | // Name: SoT-Insider, Version: 1.102.2382.0
#include "../pch.h"
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Functions
//---------------------------------------... |
de84d271149b12cbd48fdf0ebeb342749848292f | f17ae1fe3791dd5af3c9ae02b468fc0c6cfa20d5 | g/grizzly_motor_driver | /grizzly_motor_driver/src/diagnostic_updater.cpp | C++ | cpp | 8,582 | no_license | /**
Software License Agreement (BSD)
\authors Mike Hosmar <mhosmar@clearpathrobotics.com>
\copyright Copyright (c) 2018, Clearpath Robotics, 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:
* Redi... |
852d1631bbb95aae7b267bf2b6fda34318e3dbdd | 0c367f0323ed8529c11339b7d3e2af248bc6d689 | tstanvir/mySolutionRepo | /codeforces/1330/A.cpp | C++ | cpp | 3,096 | no_license | /// Bismillahir Rahmanir Rahim
//Author: Tanvir Hussain
//ICE,NSTU
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x,m,n) memset... |
10e693f1fa2e59acb64a33101220f321f6b27ee5 | e8b626a31e12411cc3f812151fc950a0b2963e81 | git-Charlie/ARK-SDK | /SDK/ARKSurvivalEvolved_DmgType_Melee_Dino_Herbivore_Medium_Stego_SharpPlate_classes.hpp | C++ | hpp | 1,120 | permissive | #pragma once
// ARKSurvivalEvolved (329.9) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "ARKSurvivalEvolved_DmgType_Melee_Dino_Herbivore_Medium_Stego_SharpPlate_structs.hpp"
namespace sdk
{
//---------------------------------------------------------------------------
//Classes
//--------------------... |
dd1e717b9e2090800b82d69be1df39d0835184de | 5576db248b0d74e3650367cc32baa20949bc0f5b | seirion/FontMan | /FontMan.cpp | C++ | cpp | 4,082 | no_license | // FontMan.cpp : Defines the class behaviors for the application.
//
#include "stdafx.h"
#include "FontMan.h"
#include "MainFrm.h"
#include "FontManDoc.h"
#include "FontManView.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
////////////////////////////////////////... |
7fd2be79da56cdebf559a418b0bdfefd1833c04b | ebea0a0e181ed75e70329aed0ce160adeee106a6 | AlexanderSavelyev/rdkit | /Code/GraphMol/Wrap/MolOps.cpp | C++ | cpp | 64,258 | permissive | // $Id$
//
// Copyright (C) 2003-2014 Greg Landrum and Rational Discovery LLC
//
// @@ All Rights Reserved @@
// This file is part of the RDKit.
// The contents are covered by the terms of the BSD license
// which is included in the file license.txt, found at the root
// of the RDKit source tree.
//
#define NO_I... |
fd8e007a6f5b208c27f215a315f48b8e81fa918c | ab4fc6a8cb1a505bde0534de82cc6aa93f9f1511 | deets/raspberry-racer | /cpp/src/gfx/openvg-adapter-impl.hh | C++ | hh | 2,532 | permissive | #ifndef OPENVG_ADAPTER_IMPL_HH
#define OPENVG_ADAPTER_IMPL_HH
#include "gfx/openvg-adapter.hh"
class OpenVGAdapterImpl : public OpenVGAdapter {
public:
// OpenVGAdapter implementation
virtual void vgSetf(VGParamType type, VGfloat value) const;
virtual void vgSetfv(VGParamType type, VGint count, const VGfloat*... |
771e14747b6f9f115a4d8f11a5cac90c63591dd5 | 2791207c849db5085ac8c5dc358e300be81dd9b3 | losangler/C_project | /算法程序-用C++语言实现/ch3/求对称三对角阵的特征值.cpp | C++ | cpp | 4,415 | no_license | //求对称三对角阵的特征值.cpp
#include <cmath>
#include <iostream>
using namespace std;
//b[n] 存放n阶实对称三角阵的主对角线上的元素。返回时存放全部特征值。
//c[n] 前n-1个元素存放实对称三角阵的次对角线上的元素。
//q[n][n] 若存放n阶单位矩阵，则返回实对称三对角阵T的特征向量组；
// 若存放由3.1节中的函数strq()所返回的一般实对称矩阵A的豪斯荷尔德
// 变换的乘积矩阵Q，则返回实对称矩阵A的特征向量组。其中q中的第j列
// 为与... |
f6b88cecee88db8ff9a35fb8efe63070258d1f00 | 2835c907a89c4e0fa44c9c32f7ed45d0484b8548 | PopCap/GameIdea | /Engine/Source/ThirdParty/PhysX/APEX-1.3/module/clothing/src/ClothingCookedParam.cpp | C++ | cpp | 28,254 | permissive | /*
* Copyright (c) 2008-2015, NVIDIA CORPORATION. All rights reserved.
*
* NVIDIA CORPORATION and its licensors retain all intellectual property
* and proprietary rights in and to this software, related documentation
* and any modifications thereto. Any use, reproduction, disclosure or
* distribution of this so... |
8d01ef0167a9b7922b449a25377b4733069429d7 | cdf4795d10338490d21f98bba8420152b0486c2e | felipefdsilva/euclidean-tsp | /main.cpp | C++ | cpp | 1,475 | no_license | /*
* Universidade Federal do Rio de Janeiro
* Teoria dos Grafos 2018.2
* Trabalho da Disciplina - Parte 3 (Caixeiro Viajante - variação euclideana)
* Autores: Felipe Ferreira e Luis Fernando
* Implementação do programa de testes da biblioteca de solução do tsp
*/
#include <chrono> //para marcação do tempo de execução ... |
6bd2f91a26e0d00e019a93b1de1263f9a88f0c4b | 74db49d44cd36cdeec3d9508bbff3058c6df14cf | terzo/Euetelscope_v00-09-02_fork | /external/eudaq/tags/v01-00-00/onlinemon/src/HitmapHistos.cc | C++ | cc | 16,057 | no_license | /*
* HitmapHistos.cc
*
* Created on: Jun 16, 2011
* Author: stanitz
*/
#include "HitmapHistos.hh"
#include "OnlineMon.hh"
#include <cstdlib>
HitmapHistos::HitmapHistos(SimpleStandardPlane p, RootMonitor* mon): _sensor(p.getName()), _id(p.getID()), _maxX(p.getMaxX()), _maxY(p.getMaxY()), _wait(false),
_hi... |
fe04dcce3e89001a19518238c377621b9a9d6b3e | ebc5436cfb0c63e743c91557b09698979665f355 | cadexproject/cadex | /src/qt/cadex.cpp | C++ | cpp | 25,083 | permissive | // Copyright (c) 2011-2015 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Dash Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#if defined(HAVE_CONFIG_H)
#include "config/cadex-config.h"
#endif
#incl... |
d392fbb51562f2537f69d0db5d88646ca2fc041f | 9a9a73ea4b786b5ae2a92b52518c4e4e878feec3 | trungliennd/EwardCurves | /Code/Curves/ellipticCurve.cpp | C++ | cpp | 6,095 | no_license | #include "FinteFiledElement.h"
#include <iostream>
#include <vector>
#include <iomanip>
#include <ostream>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <math.h>
#include <sstream>
#include <NTL/ZZ.h>
#include <openssl/aes.h>
#include <openssl/rand.h>
#include <openssl/hmac.h>
#includ... |
c44cd13b9b824be8f7920220e94f0833c2585776 | d6efc1c9bd56c08d04524fc8b09a745d4288b7f4 | shenzhu/squirrel | /db/memtable.cpp | C++ | cpp | 5,099 | no_license | #include "memtable.h"
#include "dbformat.h"
#include "comparator.h"
#include "env.h"
#include "iterator.h"
#include "coding.h"
namespace leveldb {
static Slice GetLengthPrefixedSlice(const char* data) {
uint32_t len;
const char* p = data;
p = GetVarint32Ptr(p, p + 5, &len); // +5: we assume "p" is not corrupted
... |
0ce38a36822dae661971ca5a88e5690baf1140c8 | 6d7197c060a8d00e5636eafb072209f46061f18e | joshcollins1008/VirtualMachinesProject | /share/vm/gc_implementation/g1/concurrentMark.cpp | C++ | cpp | 173,995 | no_license | /*
* Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free ... |
7fb03cc0c18a9180af9d63564eb70248ba2ca702 | e9086170654390d7780ee1bdbefdd0cff98b2c94 | mritunjay11196/OOPS-Cpp | /22-1.cpp | C++ | cpp | 680 | no_license | // Iinitializer
// Lecture 22 Part 1
// Initializer list is used to initialize data members of a class
// the list of members to be initiallized is indicated with constructor as a comma separated list followed by a colon
// mainly we use this method to initialize 'const' and referance variables since we can not initia... |
1887cb27dc43fed637542c7a2a84c9477baf476d | 107350e428d6cf864859719f10bc4edd9be42562 | peter0749/lycon | /src/lycon/util/hardware.cc | C++ | cc | 5,487 | permissive | #include "lycon/util/hardware.h"
#include <cstring>
#include "lycon/util/error.h"
namespace lycon
{
struct HWFeatures
{
enum
{
MAX_FEATURE = LYCON_HARDWARE_MAX_FEATURE
};
HWFeatures(void)
{
memset(have, 0, sizeof(have));
x86_family = 0;
}
static HWFeatures initi... |
925c78529e9ea2100e388969fdb79b751122e2bb | 685438077b29d55a05b3886b839ff41276029914 | ta0kira/zeolite | /tests/pointer/Extension_Response.cpp | C++ | cpp | 3,287 | permissive | /* -----------------------------------------------------------------------------
Copyright 2022 Kevin P. Barry
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/LIC... |
910443cafe66793ee018dbb73c6bb96b731b70cd | 61d3ed0ed5c4b1d8992f50e0ce460b4480753602 | bdamer/dukat | /src/texture.cpp | C++ | cpp | 3,587 | permissive | #include "stdafx.h"
#include <dukat/texture.h>
#include <dukat/surface.h>
#include <dukat/shaderprogram.h>
#include <dukat/sysutil.h>
namespace dukat
{
Texture::Texture(void) : target(GL_TEXTURE_2D), profile(ProfileNearest), w(0), h(0)
{
glGenTextures(1, &id);
}
Texture::Texture(TextureId id) : target(GL_TEXTUR... |
a2b91d8494bd8b7e7de2ebfd5a60c592b5edafb7 | e146b6d42c95f6466603a9bc63b45e82ca96f0b4 | r14sandeep/Test | /C/c_linux/cpp/vt/templates/non_type_temp.cpp | C++ | cpp | 510 | no_license | #include<iostream>
using namespace std;
template <class T,int N>
class myclass
{
T memblock[N];
public:
void setmember(int x,T val);
T getmem(int x);
};
template<class T,int N>
void myclass<T,N>::setmember(int x,T val)
{
memblock[x]=val;
}
template <class T,int N>
T myclass<T,N>::getmem(int x)
{
return memblock[... |
5b2027ce143ab5c78d9822f073c06994cf520ae0 | b9fcd99b101318b8939dbc5b75328b1b34c148a4 | Sunlitspace542/Sonic-1-2-2013-Decompilation | /Sonic12Decomp/PauseMenu.cpp | C++ | cpp | 5,091 | no_license | #include "RetroEngine.hpp"
TextMenu pauseTextMenu;
void PauseMenu_Create(void *objPtr)
{
NativeEntity_PauseMenu *pauseMenu = (NativeEntity_PauseMenu *)objPtr;
pauseMenu->state = 0;
pauseMenu->timer = 0;
pauseMenu->selectedOption = 0;
pauseMenu->barPos ... |
594b16ceb5c6ca5dcbc239229f0bc4b73fd59e42 | 5432102650d53958ba6e63c260887cb9109e495f | ChiuTeHao/uva-online-judge | /uva12169.cpp | C++ | cpp | 1,408 | no_license | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
const long long int MOD=10001;
bool check(long long int nums[],int n,long long int a,long long int b)
{
long long int num=nums[0];
for(int i=0;i<n;i++)
{
if(num!=nums[i]) return false;
int tmp=(num*a+b)%10001;
... |
3d40cd40c689995227d58ad69067e0c90156f1a9 | d884892ff4587787877f6fb27875ed13eb7a2c77 | caychen/Cpp11 | /Source10.cpp | C++ | cpp | 2,834 | no_license | #include <iostream>
#include <memory>
//智能指针与垃圾回收
void CheckWeakPtr(std::weak_ptr<int> & wp)
{
std::shared_ptr<int> sp = wp.lock();
if (sp != nullptr)
std::cout << "still " << *sp << std::endl;
else
std::cout << "pointer is invalid" << std::endl;
}
//智能指针
//unique_ptr、shared_ptr、weak_ptr
//1、unique_ptr：不能与其他u... |
4989bfaaa3ed4183518da45499006db57680bd5a | 9c397346a76f0a68eb22d740c8623f7e91e34034 | djewsbury/XLE | /Assets/AssetUtils.cpp | C++ | cpp | 24,828 | permissive | // Copyright 2015 XLGAMES Inc.
//
// Distributed under the MIT License (See
// accompanying file "LICENSE" or the website
// http://www.opensource.org/licenses/mit-license.php)
#include "AssetUtils.h"
#include "ICompileOperation.h"
#include "Marker.h"
#include "DepVal.h"
#include "IFileSystem.h"
#include "NascentChunk... |
6412e5fd2cd992532567eb0b09f06ebab4b6505b | 4ddf672ce105f5a908ea4cbbaa07772cfb5c514a | jentlestea1/obs_xslt | /obs/src/cpp/Manoeuvre/DC_DummyManoeuvre.cpp | C++ | cpp | 686 | no_license | //
// Copyright 2004 P&P Software GmbH - All Rights Reserved
//
// DC_DummyManoeuvre.cpp
//
// Version 1.0
// Date 10.04.03
// Author A. Pasetti (P&P Software)
#include "../GeneralInclude/CompilerSwitches.h"
#include "../GeneralInclude/DebugSupport.h"
#include "../GeneralInclude/ClassId.h"
#include "../Ge... |
cf5c79f4209351df4b9b86e6852bf7cf6e91bc0e | f897737717e47006e5328d5f02a962ac5baef3e6 | zekiguven/dicom3tools | /libsrc/src/dcdisp/rdrgb.cc | C++ | cc | 2,132 | no_license | #include <iostream.h>
#include "basetype.h"
#include "srcsink.h"
#include "usetrue.h"
#include "rdimage.h"
#include "rdrgb.h"
ReadableInterleaved24BitRGBImage::ReadableInterleaved24BitRGBImage(
SupplySource *s,Uint16 vColumns,Uint16 vRows,Uint16 vNumberOfFrames,
Uint16 vBitsAllocated,Uint16 vBitsStored,Uint16 vHigh... |
5000305d0b9163845fe430cbd4abd04edc26d29e | 4c419a762203ea53e3ad7eb568827cf13c572b71 | alexandraback/datacollection | /solutions_5640146288377856_0/C++/Gozz/A.cpp | C++ | cpp | 347 | no_license | #include <iostream>
#include <vector>
#include <cstdint>
typedef int64_t i64;
using namespace std;
int main() {
i64 T;
cin >> T;
for (i64 t = 1; t <= T; ++t) {
i64 R, C, W;
cin >> R >> C >> W;
i64 score = 0;
score += R * C/W;
score += W-1;
if (C%W)
++score;
cout << "Case #" << t << ": " << scor... |
850a06cb117709b32694ff42473114fd09bef621 | f51adecf20cc13ab9020b847af24a7e880ed2477 | Lemoner/AlgorithmSubject | /C/ACM2029.cpp | C++ | cpp | 332 | no_license | #include<stdio.h>
#include<string.h>
int main(void)
{
int n,len,flag;
char c[1000];
scanf("%d",&n);
while(n--){
scanf("%s",c);
len=strlen(c);
flag=0;
for(int i=0;i<len/2;i++){
if(c[i]!=c[len-i-1]){
flag=1;
break;
}
}
if(flag==1){
printf("no\n");
}
else{
printf("yes\n");
}
}
r... |
0ac20f6c91fc7642fa2803aa95a42e1b758b2c7d | bb847c319f9a7bf01a3a06e6c706702b1d779997 | nusrat-chaiti/computer-graphics | /rocket/main.cpp | C++ | cpp | 4,550 | no_license | #include<windows.h>
#include <GL/glut.h>
#include<math.h>
#include<cstdio>
void myInit(void)
{
glClearColor(0.0, 1.0, 1.0, 0.0);
glMatrixMode(GL_PROJECTION);
gluOrtho2D(-1.0, 1.0, -1.0, 1.0 );
}
void Circle(GLfloat cx, GLfloat cy,GLfloat cz, GLfloat radius,int r,int g,int b)
{
int triangleAmount = 40; //# of tria... |
a93ee1d60be31b895f9e93a55cb6d8629a270dc6 | 23f507dff76fb54f7f26053b74e7b6d0755dae10 | defoltem/dungeon | /cret/inventory/object.cpp | C++ | cpp | 1,478 | no_license | #include "wNs.h"
#include <iostream>
void object::info(){
printw("weight: %d\n", weight);
printw("self price: %d\n", self_price);
}
int object::getw(){
return weight;
}
int object::getsp(){
return self_price;
}
int object::getd(){
return 1;
}
int object::geth(){
return 1;
}
std::string object::g... |
483f728fccbdf885c0669670d083cfced56916f2 | a22a98857f2b048e88298d954fcd4bb48eab2014 | Chr0nos/ft_retro | /srcs/Plasma.class.cpp | C++ | cpp | 2,254 | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Plasma.class.cpp :+: :+: :+: ... |
8f6a330bb70a76332287db88e4a88f31f0fe7ceb | df2b34598c1aa12a998e4814786f821bf6ae806b | renato-yuzup/axis-fem | /Axis.StandardElements/domain/formulations/nlhr_commands/NlhrStrainCommand.hpp | C++ | hpp | 735 | permissive | #pragma once
#include "domain/formulations/UpdateStrainCommand.hpp"
namespace axis { namespace domain { namespace formulations {
namespace nlhr_commands {
class NlhrStrainCommand : public axis::domain::formulations::UpdateStrainCommand
{
public:
NlhrStrainCommand(void);
~NlhrStrainCommand(void);
private:
virtu... |
ed71353937871662dbc08f00f779d2018a4905fd | 92c834828a9b78621339d67f7bd5f27d5e1d4c11 | agrawal-ris/competitive | /Codeforces/Codeforces - 580C.cpp | C++ | cpp | 1,522 | no_license | #include <bits/stdc++.h>
using namespace std;
void edge (vector <int> graph[], int a, int b) {
graph[a].push_back(b);
}
void printgraph(vector <int> graph[], int size)
{
for (int i=0; i<size; i++)
{
cout<<i;
for (int j=0;j<graph[i].size();j++)
{
cout<<" -> "<< graph[i][j];
}
cout<<endl;
}
}
... |
c5e34f3a3627f73856f65e87528f894d25283f77 | 43f8e80d54e624f1a81b7180bd8b50e3967bbf55 | dotted/wfto | /DKER/TestDLL/src/host/TargetDlg.cpp | C++ | cpp | 2,209 | no_license | // TargetDlg.cpp : インプリメンテーション ファイル
//
#include "stdafx.h"
#include "dxwndhost.h"
#include "TargetDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// CTargetDlg ダイアログ
... |
0dcd45192191cae1c8529eddf0b9095fd958b24a | 4854deafe3c9b8685f78edeaf7c5c73cda50a5c0 | majacQ/migrace_databaze | /skola/Fel_bc/3.semestr/PJC/prednaska priklady/03/04while.cpp | C++ | cpp | 453 | no_license | #include <iostream>
#include <iomanip>
using namespace std;
int main ( int argc, char * argv [] )
{
unsigned int i;
cout << "Zadej pocet" << endl;
cin . clear ();
cin >> i;
if ( !cin . good () )
{
cout << "Chyba formatu" << endl;
return ( 1 );
}
while ( ... |
863ed3a47efd4b309ab2174c6c8edf654a768212 | dfec87ac3c195bdbcd3a0a9bc9d84b22518371f6 | AchmadRifai/MyMath | /main.cpp | C++ | cpp | 516 | no_license | #include <iostream>
#include"Pecahan.h"
using namespace std;
using namespace math;
int main()
{
Pecahan a(2),b(4),c;
c=a+b;
cout<<a.to_string()<<"+"<<b.to_string()<<"="<<c.to_string()<<endl;
c=a-b;
cout<<a.to_string()<<"-"<<b.to_string()<<"="<<c.to_string()<<endl;
c=a*b;
cout<<a.to_string(... |
465d481a3bb5a2875d449680c2cd0590696fe8d3 | 9e9aac2de505df208652d26935a764be7bb4161c | episyron/plasma-workspace | /libtaskmanager/autotests/tasktoolstest.cpp | C++ | cpp | 6,231 | no_license | /*
SPDX-FileCopyrightText: 2016 Eike Hein <hein@kde.org>
SPDX-License-Identifier: LGPL-2.1-only OR LGPL-3.0-only OR LicenseRef-KDE-Accepted-LGPL
*/
#include <QObject>
#include <KConfigGroup>
#include <KDesktopFile>
#include <KIconTheme>
#include <KSharedConfig>
#include <KSycoca>
#include <QDir>
#include <Q... |
70bbb413792f4daa68f2f9f7026ff41be8e3ba92 | 99d863c377a01c3aa8dc38588633e447faa73658 | zhmu/ananas | /external/gcc-12.1.0/libstdc++-v3/testsuite/23_containers/unordered_set/debug/cend_neg.cc | C++ | cc | 993 | permissive | // Copyright (C) 2012-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 published by the
// Free Software Foundation; either version 3, or (at your op... |
9cc26aa9674da3705263db29885c49e378ade464 | 88a90671c04ee2cfb6b8c9209591ccd6924bcaab | g-leon/ds-and-algo | /Facebook-Hacker-Cup/2015/Qualifications/New-Year's-Resolution/main.cpp | C++ | cpp | 1,193 | no_license | #include <fstream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <climits>
using namespace std;
struct food {
int prot, carb, fat;
food(): prot(0), carb(0), fat(0) {};
}fa[20];
i... |
1ef2f57ef29de35caaaa94c6fb69a03c17cc8637 | a39c5e64ff656df12e5ba50384ac9dc4d37578b8 | ezet/HIG | /C/HarvardHacker1/problem2/main.cpp | C++ | cpp | 729 | no_license | #include <iostream>
#include <string>
long long ExtractLastDigit(long long *n) {
int digit = *n % 10;
*n /= 10;
return digit;
}
int SumDigits(int n) {
int sum = 0;
while (n) {
sum += ExtractLastDigit((long long*)&n);
}
return sum;
}
int main(int argc, char *argv[]) {
long long cardno, remaining;
... |
1bf07966ad600654fafcb7e23467f51ca5715895 | 2028050a6f8d3344e4f39430a72314c55f895e62 | SedaOzcan97/cevikcozum-staj-2020 | /Project1/Project1/Kaynak.cpp | C++ | cpp | 263 | no_license | #include <iostream>
using namespace std;
int SumOfAr()
{
int b = 0;
int n = 5;
int ar[] = { 5,6,3,1,8 };
for (int i = 0; i < n; i++)
{
b += ar[i];
}
cout << b << endl;
return 0;
}
int main()
{
SumOfAr();
return 0;
} |
dcab93acaa60c6cbdf7b4c6be0d4f2e65da12dcf | 8a8ba7082d27e75fa8e82cb0117f38d90ec04d29 | jcd1994/MatlabTools | /Compiled/blaze-3.2/blazetest/src/mathtest/smatsmatsub/SCbLCa.cpp | C++ | cpp | 4,226 | permissive | //=================================================================================================
/*!
// \file src/mathtest/smatsmatsub/SCbLCa.cpp
// \brief Source file for the SCbLCa sparse matrix/sparse matrix subtraction math test
//
// Copyright (C) 2012-2017 Klaus Iglberger - All Rights Reserved
//
// This f... |
60ba526f32361f689aa6183a6f7ac1e7f55cfccd | 9582cc06df951f2d21826c8b58349ded77761836 | StandOutstar/QTproject- | /My_SerialCom/mainwindow.cpp | C++ | cpp | 8,625 | no_license | #include "mainwindow.h"
#include "ui_mainwindow.h"
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
ui->setupUi(this);
QTimer *timer = new QTimer(this);
connect(timer, SIGNAL(timeout()), this, SLOT(qtimeSlot()));
timer->start(1000);
ui->... |
ab5340568a97ad8968c6c2315252817f6993eb9c | c546fd797c8dd9bd380b9f844fab78fd95d2aec4 | Oyami-Srk/BeSol | /Source/prop_struct.cpp | C++ | cpp | 5,036 | no_license | //Jason Wrinkle - Solitaire Game
//Copyright (C) 1999 Jason Wrinkle (jwrinkle@utdallas.edu)
//
//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 2
//of the License, or (at your... |
2f7e7b2d566ff6ddb8de71ff0d7626b9d719bfc6 | 0f72899181ef628be55b2fed698ffad21099247c | gabrielfvale/cg-ck0245 | /src/util/Texture.cpp | C++ | cpp | 507 | no_license | #include "Texture.hpp"
Texture::Texture(unsigned char *pixels, int w, int h)
{
this->data = pixels;
this->w = w;
this->h = h;
}
RGB Texture::value(float u, float v, const Point& p)
{
int i = ( u)*w;
int j = (1 - v)*h - 0.001;
if (i < 0) i = 0;
if (j < 0) j = 0;
if (i > w - 1) i = w - 1;
if (j > h - ... |
fdd50aa20c661e325c3bc8c08e1b83336c87c405 | a2aa256e28197f6847f1bd9ba2da1b38310377cc | cnsoft/cocos2d-x | /tests/cpp-tests/Classes/LabelTest/LabelTestNew.cpp | C++ | cpp | 59,553 | no_license | #include "LabelTestNew.h"
#include "../testResource.h"
#include "renderer/CCRenderer.h"
USING_NS_CC;
using namespace ui;
enum {
kTagTileMap = 1,
kTagSpriteManager = 1,
kTagAnimation1 = 1,
kTagBitmapAtlas1 = 1,
kTagBitmapAtlas2 = 2,
kTagBitmapAtlas3 = 3,
};
enum {
kTagSprite1,
kTagSpri... |
142c2e7e8ab0927bb390812ee615f7fa4dbf7a6e | 0945a856dc5dfea9c2f7b80aa0d6e8d81d88b63a | minshogi/dailyPS | /DP/BOJ1149.cpp | C++ | cpp | 578 | no_license | #include <iostream>
using namespace std;
int D[1001][3] = {};
int P[1001][3] = {};
int f(int k, int c)
{
if(k==1)
return P[k][c];
int &ret = D[k][c];
if(ret)
return ret;
return ret = P[k][c] + min(f(k - 1, (c + 1) % 3), f(k - 1, (c + 2) % 3));
}
int main()
{
ios_base::sync_with_s... |
6c7962eeaa6ee5559bb684023ac8ba65477ea92e | f005bfc5de26931f6367f689591c3ce9beec8c45 | ylshan/Messy_Test | /demo/CppBaseTest/test_parse_cvs.cpp | C++ | cpp | 797 | no_license | #include "test_parse_cvs.hpp"
#include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include "parse_csv.hpp"
// Blog: http://blog.csdn.net/fengbingchun/article/details/79324555
namespace parse_cvs_ {
int test_parse_cvs_1()
{
std::ifstream file("E:/GitCode/Messy_Test/testdata/test_csv.csv");
s... |
f7f7ac86f4f8da96c483d66752777dd7d8b3361d | 8cac09ae01935aa40dd8d4e746311e7587dd146a | nupurbarnwal014/c--plusplus-program | /Find LCM using HCF.cpp | C++ | cpp | 402 | no_license | #include <iostream>
using namespace std;
int main()
{
int n1, n2, hcf, temp, lcm;
cout << "Enter two numbers: ";
cin >> n1 >> n2;
hcf = n1;
temp = n2;
while(hcf != temp)
{
if(hcf > temp)
hcf -= temp;
else
temp -= hcf;
}
... |
bc5a5b3ef71d4b394dd0070dcef216a34d3f4bf7 | 76edf86b5945e74aca43eca20e7728a6961c60ec | oravital7/BinaryTree-CPP | /Tree.hpp | C++ | hpp | 1,094 | no_license | #include <iostream>
using namespace std;
class Node {
private:
int data;
Node* right, *left;
public:
Node(int i) {
data = i;
right=left=NULL;
}
Node* getRight() {
return right;
}
Node* getLeft() {
return left;
}
int getData() {
re... |
e417744dcd545d23d8fb6fcb0294be1d1dabe8e9 | e4137ab6abf27d5971e9d7529f80457d986f1d99 | fromddy/uva | /uva572/uva572_2017.9.11.cpp | C++ | cpp | 1,086 | no_license | //2017.9.11 night
//wirtten by robot
//wa了一晚上，找不到错误的原因
//是 dr和dc没有分辨清楚
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=105;
char pic[maxn][maxn];
int m,n,vis[maxn][maxn];
void dfs(int r,int c,int id)
{
if(r<0||r>=m||c<0||c>=n) return;
if(vis[r][c]>0||pic[r][... |
862771cb60d7376431016c95822bf28789338d89 | d5716b073886e9543b8f3dc553202186f08d1b40 | richmondx/dead6 | /Source/GameDLL/Menus/FlashMenuObjectOptions.cpp | C++ | cpp | 5,456 | no_license | /*************************************************************************
Crytek Source File.
Copyright (C), Crytek Studios, 2001-2005.
-------------------------------------------------------------------------
$Id$
$DateTime$
Description: Flash menu screen "Options"
-------------------------------------------... |
eab4e8eae3973d28157ed276331b2700c8306453 | 441336dd5488d3b0df1bba57fb8a4fcd6752bd54 | cutenc/edt-finalproject-nand | /source/visualizer/KeyboardManager.cpp | C++ | cpp | 1,547 | no_license | /*
* KeyboardManager.cpp
*
* Created on: 10/ott/2012
* Author: alberto
*/
#include "KeyboardManager.hpp"
#include <iostream>
KeyboardManager::KeyboardManager(InputDeviceStateType::Ptr ids, SteppableController::Ptr controller) :
IDST(ids), CONTROLLER(controller)
{ }
KeyboardManager::~KeyboardManager() {... |
f9b6e4f6e225e246e61c190c8e8215fe8a03b8b2 | f82e4641f8be1207f7ffa77a152af96d4ce3cdf7 | nya3jp/icpc | /unknown/src/practice/20070405/twoends.cc | C++ | cc | 1,694 | no_license | #include <iostream>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <cmath>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)(n); i++)
#define ALLOF(c) (c).begin(), (c).end()
#define FOR(it,c) for(__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)... |
a9e735a1094e27d10ec13da6430200c1d5e8757a | 74026d4f83a6ef2db77f43011cdbfd7af34b8d07 | chuckbruno/aphid | /shared/ogl/DrawParticle.cpp | C++ | cpp | 2,080 | no_license | /*
* DrawParticle.cpp
*
*
* Created by jian zhang on 1/14/17.
* Copyright 2017 __MyCompanyName__. All rights reserved.
*
*/
#include "DrawParticle.h"
#include <math/ATypes.h>
#include <ogl/GlslInstancer.h>
#include <math/miscfuncs.h>
namespace aphid {
DrawParticle::DrawParticle()
{
m_numParticles = 0;
... |
931d06874ea697a71728b3026cbda11d73d95aa9 | 6231b9b71ed4c680120453ee47851618714cf147 | wayou/chromium | /components/autofill_assistant/browser/user_data_util.cc | C++ | cc | 23,845 | 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 "components/autofill_assistant/browser/user_data_util.h"
#include <map>
#include <numeric>
#include "base/callback.h"
#include "base/i18n/case_... |
d5a76fb40f31524515598f3ed5ff32ab6061739d | 650a7833d57ec14466664646fac52c6e387efee2 | californiawz/ParagonUIPrototyping | /Source/DeckBuilderDesktop/Models/CardDeckImporterJSON.cpp | C++ | cpp | 4,194 | no_license | // Fill out your copyright notice in the Description page of Project Settings.
#include "DeckBuilderDesktop.h"
#include "CardDeckImporterJSON.h"
#include "CardDeckModel.h"
#include "CardListModel.h"
#include "HeroListModel.h"
UCardDeckImporterJSON::UCardDeckImporterJSON(class FObjectInitializer const & ObjectInitial... |
d6758170bc20f9f77b402ef1185b76fc17e86d66 | 071a224b6e1c08242772dff23c6c74447a00eb00 | cnsuhao/GeometricToolsEngine1p0 | /GeometricTools/GTEngine/Source/GteDX11DrawTarget.cpp | C++ | cpp | 3,106 | no_license | // Geometric Tools LLC, Redmond WA 98052
// Copyright (c) 1998-2014
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
// File Version: 1.0.0 (2014/08/11)
#include "GTEnginePCH.h"
#include "GteDX11DrawTarg... |
1a6193b9238efebfd3340ab6619f143d29272180 | 1fe4840a052253d26777664627f1a6d7998c5d7c | bryful/F-s-PluginsProjects | /ColorChangeSimple/ColorChangeSimple.cpp | C++ | cpp | 8,422 | permissive | //-----------------------------------------------------------------------------------
/*
F's Plugins for VS2010/VS2012
*/
//-----------------------------------------------------------------------------------
#include "ColorChangeSimple.h"
PF_Err (*subFunc8)(refconType refcon, A_long xL, A_long yL,PF_Pixel8 *inP, P... |
12a78268f89b8d7f12958cf91ddcdf512174870f | 6adb5bd2f80fa7c65c68b00d5eea93984c7e9f11 | aws/aws-sdk-cpp | /generated/src/aws-cpp-sdk-chime/source/model/DeletePhoneNumberRequest.cpp | C++ | cpp | 525 | permissive | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/chime/model/DeletePhoneNumberRequest.h>
#include <aws/core/utils/json/JsonSerializer.h>
#include <utility>
using namespace Aws::Chime::Model;
using namespace Aws::Utils::Json;
using na... |
eb18f4e28eb445be95811e24110c6282dd812dd4 | 036e9ffc6524e3deaa3005a0fe083f312cb8e21e | cilkplus/llvm | /lib/Target/Sparc/AsmParser/SparcAsmParser.cpp | C++ | cpp | 37,243 | permissive | //===-- SparcAsmParser.cpp - Parse Sparc assembly to MCInst instructions --===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===-------------------------------------------------------... |
e648ba385581af76efa63a3150b017b8397c0423 | 11802e3f34a9dbf8a6b5f17ebbb1ea5e0f69a6b6 | Benjamin-Baang/Movie-Database-Website | /src/query.cpp | C++ | cpp | 294 | no_license | #include "../inc/query.hpp"
Query::~Query()
{
delete this->search_;
}
void Query::set_strategy(Search *search)
{
delete this->search_;
this->search_ = search;
}
vector<Movie*> Query::search(const vector<string> &conditions) const
{
return this->search_->search(conditions);
} |
94f72518dd0eb38cf42faa1b85b73239260da729 | 778e356fbc3e34fa6c8256822833bf645a533e11 | Ph0en1xGSeek/ACM | /LeetCode/401.cpp | C++ | cpp | 1,047 | no_license | class Solution {
public:
vector<string> readBinaryWatch(int num) {
int cnt_minute = 0;
int cnt_hour = 0;
vector<string> ans;
for(int i = 0; i < 1024; ++i) {
cnt_minute = 0;
cnt_hour = 0;
for(int j = 0; j < 6; ++j) {
if(((1... |
f1ef446bcfd6dbbb992adecc5e602fe8af5aa20c | e2644e1cf61d273b1e34eb85cd6992af4feefa05 | baojunli/FastCAE | /OCC/opencascade-7.2.0/x64/debug/inc/BOPDS_VectorOfListOfPassKeyBoolean.hxx | C++ | hxx | 949 | permissive | // Created by: Peter KURNEV
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// 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.1 as published
// by the Free S... |
a516af1d0444a5ef64ad1ed3df17ddbc29e57c44 | 1e53f4c3f841876acf6bd6f2ed31365b759511b0 | zeta1999/idocp | /examples/cranex7/ocp_benchmark.cpp | C++ | cpp | 5,045 | permissive | #include <iostream>
#include <string>
#include <memory>
#include <chrono>
#include "Eigen/Core"
#include "idocp/robot/robot.hpp"
#include "idocp/ocp/parnmpc.hpp"
#include "idocp/ocp/ocp.hpp"
#include "idocp/cost/cost_function.hpp"
#include "idocp/cost/joint_space_cost.hpp"
#include "idocp/cost/contact_cost.hpp"
#incl... |
f8333df6a3879bb8cb8868c0762f4382b920a3f2 | 795cebaa3232e01bbab029320390404594c2807e | b369rahul/Data-Structure-Algorithm-UCSD | /Algorithm Toolbox/week6_dynamic_programming2/1_maximum_amount_of_gold/knapsack.cpp | C++ | cpp | 766 | no_license | #include <iostream>
#include <vector>
#include <algorithm>
#define int long long
using namespace std;
int optimal_weight(int w, vector<int> &weights) {
//write your code here
int **ov= new int*[w+1];
for(int i=0;i<w+1;++i) ov[i]=new int [weights.size()+1];
for(int i=0;i<=w;++i)ov[i][0]=0;
for(int j=0;j<=... |
11f542500f0aced71c53fcc72cd358e2fbbd3ea7 | a6b74d520574871e48d5371a165d75fa203df9ad | sanjivr/practise | /Coding_Challenge/broker.cc | C++ | cc | 6,403 | no_license | #include<iostream>
#include<string>
#include<list>
#include<vector>
#include<ext/hash_set>
#include<ext/hash_map>
#include<ext/hash_fun.h>
#include "doubly_linked_list.h"
using namespace std;
using namespace __gnu_cxx;
namespace __gnu_cxx {
template<> struct hash<std::string> {
hash<const ch... |
06fd8171be24a789f8dd448908b47b1f212b9dd4 | f782143c73be59783a5ad21745dd6d14e0bf8f7c | chacal/openthread | /examples/platforms/utils/mac_frame.cpp | C++ | cpp | 4,499 | permissive | /*
* Copyright (c) 2019, The OpenThread Authors.
* 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
* notice, this ... |
d3f69d3b5b089ad066c408cbafe824174c611f58 | 95ea2cd020998f6eb8e02a676cb786ba3a2cb4fb | dorsamaleki/learning-hackerrank-warmup | /3-a-very-big-sum.cpp | C++ | cpp | 397 | no_license | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
long long int sum = 0;
cin >> n;
vector<long long int> arr(n);
for(int arr_i = 0;arr_i < n;arr_i++){
cin >> arr[arr_i];
}
for(int arr_i = 0;arr_i < n... |
b105f781410bf5c262ba1dfd3cdf0e8bdb3879e8 | 30baec3395b0905bbd7276217e70057d34ab2fec | hjs542761058/ACM | /Codeforces Round #568 (Div. 2)/E.cpp | C++ | cpp | 1,097 | no_license | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int x1[27],x2[27],y1[27],y2[27];
int n,m;
char c[2001][2001],d[2001][2001];
void solve ()
{
cin>>n>>m;
for (int i=1;i<=26;i++) x1[i]=x2[i]=y1[i]=y2[i]=0;
int mc=0;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
cin>>c[i][j];
d[i][j]='.';
... |
f6ef75e36839e63729d0b6311c7f471fd9e15c28 | 68aa95948ed949c88cc9308e7387a9d5f0ea602a | rosoareslv/SED99 | /c++/xbmc/2015/8/Settings.cpp | C++ | cpp | 68,458 | permissive | /*
* Copyright (C) 2005-2013 Team XBMC
* http://xbmc.org
*
* 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 2, or (at your option)
* any later version.
*
* ... |
5519b46d0c313af9f7e2fbd054fb097c5067f9e0 | 6096f5e3523558816cab86d50131206a53c65f01 | Tyrcnex/tai-mod | /export/release/windows/obj/src/haxe/crypto/Adler32.cpp | C++ | cpp | 6,535 | permissive | #include <hxcpp.h>
#ifndef INCLUDED_haxe_crypto_Adler32
#include <haxe/crypto/Adler32.h>
#endif
#ifndef INCLUDED_haxe_io_Bytes
#include <haxe/io/Bytes.h>
#endif
#ifndef INCLUDED_haxe_io_Input
#include <haxe/io/Input.h>
#endif
HX_DEFINE_STACK_FRAME(_hx_pos_34b82606d183bd93_32_new,"haxe.crypto.Adler32","new",0xc900c8e2... |
87466df09993ffcbc833a5eaad5f629d3c9b252a | c2e2728c1c1298513dbc90262aa2c4bd6a3fff41 | jxl-bot/libjxl | /tools/cjxl.cc | C++ | cc | 32,121 | permissive | // Copyright (c) the JPEG XL Project
//
// 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 agree... |
c8faab05b871881b7ea1db6c778327b796162619 | 5fb624912781841cbcb45650eddfb232989edc5c | yzq986/cntt2016-hw1 | /TC-SRM-574-div1-450/czgj.cpp | C++ | cpp | 1,322 | no_license | /*
State-compressed dp
*/
#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define red(i, r, l) for (int i = (r); i >= (l); --i)
using namespace std;
typedef long long LL;
LL dp[1 << 18][20];
int lg2[1 << 18];
bool check(int mask, int i, int j){ // if i-j intersects some segment in mask.... |
78c82cc1d447913dcd9639dc6f49071252e363d0 | 967b17e77c2d3057e17ed132d3479898bb9f62b5 | horacec371/openvino | /ngraph/frontend/paddlepaddle/src/pdpd_fw_node.hpp | C++ | hpp | 1,664 | permissive | // Copyright (C) 2018-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
//
#pragma once
#include <ngraph_ops/framework_node.hpp>
#include "decoder.hpp"
namespace ngraph
{
namespace frontend
{
class PDPDFrameworkNode : public op::FrameworkNode
{
public:
NGRAPH_R... |
789ea9af943d03f39ee057225ac12c634c888457 | 9498a47602394704d69f0609a670d69b65375494 | ABPozharliev19/string-project-2021 | /string-project-2021/back-end.cpp | C++ | cpp | 6,649 | no_license |
#include "grand.h"
#include <iostream>
#include <string>
#include <stdlib.h>
#include <time.h>
#include <Windows.h>
using namespace std;
void game(int numWords, int sec)
{
string word[60] = {
"apple", "application", "apply", "appoint", "appointment", "appreciate",
"blame", "blanket", ... |
b839d4c419b1cc21b22fbd34c5b54ab7af2b8736 | 8c71708222667f3469402bc8f7be2dbf3f768d99 | bgoonz/UsefulResourceRepo2.0 | /MY_REPOS/misc-experiments/_FIREBFIRE/grpc-SwiftPM/test/core/channel/channel_stack_builder_test.cc | C++ | cc | 4,028 | permissive | /*
*
* Copyright 2017 gRPC authors.
*
* 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
*
annel_stack_builder.h"
#include <limits.h>
#... |
3e8c99b8518dd69141c1f08cb532cbbc4c53b4bb | 5b88b90ead3e63c78920108de0ac6cde0b4b081a | beloofficial/Dev-C | /also/lovushki2.cpp | C++ | cpp | 627 | no_license | #include<iostream>
#include<iomanip>
using namespace std;
int main()
{//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int i,n,a[111111],b[111111];
double k,j,l,t,ans,h,p,q,ans1;
cin>>n;
for(i=1;i<=n;i++)
{cin>>a[i]>>b[i];}
for(i=1;i<=n;i++)
{
if(a[i]>b[i]){h=b[i];p=a[i];... |
71e9d756de41f93beb22d4ad39737a86a546341d | d350ab43844fd7064015f93efcf8ff2fcf9fc4d7 | debayan/FAT | /starlab/surfacemesh/surfacemesh_mode_info/surfacemesh_mode_info.cpp | C++ | cpp | 19,507 | no_license | #include <QMouseEvent>
#include "surfacemesh_mode_info.h"
#include "StarlabDrawArea.h"
#include "FindDialog.h"
#include "float.h"
#include <qgl.h>
#include "SurfaceMeshNormalsHelper.h"
#include "FaceBarycenterHelper.h"
#include "SurfaceMeshModel.h"
using namespace qglviewer;
using namespace SurfaceMesh;
// Fast OpenG... |
cc6ae2943dcb4d1735ec3ab14b25e41911c77cc3 | 0536f4176289053ab7129dde66485872f3a1aa75 | tst-ccamp/earthenterprise | /earth_enterprise/src/fusion/fusionver.cpp | C++ | cpp | 2,169 | permissive | // Copyright 2017 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... |
691e21160218cc824f1f00248de580eaef73c906 | 4e9cc1bc30d22a4fc3d3dea6b7038f227783fdd1 | HubPeter/beauty_of_code | /find/finds.cpp | C++ | cpp | 1,235 | no_license | #include<iostream>
using namespace std;
bool Find2( int arr[], int sum, int n );
void quickSort( int arr[], int p, int r );
int partition( int arr[], int p, int r );
void Show( int arr[] );
int main(void){
int arr[] = {2,3,5,38, 8, 5, 2, 58, 2, 5, 8, 3, 98, 29};
int n = sizeof(arr)/sizeof(int);
int sum = 7;
bool rs... |
994d9c0d996d301bf3dcfa216b2c92a048e12efa | eefa7b55703adb546f6a83dbf711551c05ffe0b6 | Lst11/sdapl | /tourtablewindow.cpp | C++ | cpp | 568 | no_license | #include "tourtablewindow.h"
#include "ui_tourtablewindow.h"
#include <QDebug>
using namespace std;
TourTableWindow::TourTableWindow(QWidget *parent, const QSqlDatabase &database) :
QDialog(parent),
ui(new Ui::TourTableWindow),
database(database) {
ui->setupUi(this);
tourController = ... |
95fd798965f3614a7cbbf2a14b2292402a11a029 | ed75b30f9f9f6911deb7ffd8553594fd7248698e | bishtranjan1/chromium | /net/quic/core/quic_stream_sequencer.cc | C++ | cc | 7,769 | 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/quic/core/quic_stream_sequencer.h"
#include <algorithm>
#include <limits>
#include <utility>
#include "net/quic/core/quic_packets.h"
#... |
dccf605d3696eed36c250bf324d961079c166668 | 7ee587135f6c02f8c09a3c3a5a761cebda011ef7 | mik90/ristretto | /src/server/RistrettoServer.hpp | C++ | hpp | 2,748 | permissive | #pragma once
#include <filesystem>
#include <map>
#include <memory>
#include <fmt/core.h>
#include <grpc++/grpc++.h>
#include <grpc/support/log.h>
#include <spdlog/spdlog.h>
#include "KaldiInterface.hpp"
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wuseless-cast" // NOLINT: Clang-tidy is not aware o... |
52449e884dc0c4aaaf5e47779940b9d2a47ab2e5 | 2afdac84c8ec3b64916968e78ebe4d7a6930bb22 | vxl/vxl | /contrib/brl/bbas/bocl/pro/processes/bocl_get_device_process.cxx | C++ | cxx | 2,679 | no_license | // This is brl/bbas/bocl/pro/processes/bocl_get_device_process.cxx
#include <iostream>
#include <fstream>
#include <sstream>
#include <bprb/bprb_func_process.h>
//:
// \file
// \brief A process for initializing a bocl manager
//
// \author Vishal Jain
// \date Mar 8, 2011
// \verbatim
// Modifications
// <none yet>
... |
edb1f7900694fbf62e4199bac223d56e92ab9460 | cb16a66a25835ce413562ea694cfbabd61dedbec | PunnyOz2/POSN-Programming | /April/CAT Code.cpp | C++ | cpp | 1,719 | no_license | #include<bits/stdc++.h>
using namespace std;
#define hashsize 1000003
long long hashh[1000003];
char num[1000100];
long long ans[1000100];
long long mark[1000100];
long long num2[1000100];
long long n,len,i,strnum,sum,j,h,now,q;
int main()
{
scanf("%lld %lld",&n,&len);
for(i=1;i<=n;i++){
scanf(" %s",num);
... |
8102de0fbf83178d3876c1d07605f79fc5d81dc5 | d17106c41067dcd1d1b17de3f5036942bf1c6c28 | nekko1119/Sprout | /sprout/darkroom/objects/sphere.hpp | C++ | hpp | 7,578 | permissive | /*=============================================================================
Copyright (c) 2011-2013 Bolero MURAKAMI
https://github.com/bolero-MURAKAMI/Sprout
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.tx... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.