text stringlengths 8 6.88M |
|---|
#pragma once
#include <functional>
#include <iostream>
#include <memory>
#include <string>
#include "algorithm.hpp"
#include "graphics2D.hpp"
#include "options.hpp"
#include "outputs.hpp"
namespace fantom
{
//------------------------------ Algorithm Factory -------------------------------------
class Algori... |
#ifndef ENVIRONMENT_H
#define ENVIRONMENT_H
#include "GameWindow.h"
#include "Sprite.h"
#include "GameObjects.h"
#include "Button.h"
#include <vector>
#include <fstream>
#include <sstream>
#include <cmath>
#include "TextField.h"
#include "Enemy.h"
using namespace std;
class Environment
{
public:
Environme... |
#include <cstdlib>
#include <iostream>
#include <exception>
using namespace std;
class List {
public:
struct Node {
int date{};
Node* next{ nullptr };
};
private:
Node* m_front{ nullptr };
Node* m_back{ nullptr };
int m_listSize{ };
void listCheck() {
Node* member = m_front;
for (int i = 0; i < m_list... |
#include <iostream>
#define INF 0x3f3f3f3f
using namespace std;
int ham (int z) {
int ans = 0;
while (z) { ans += z & 1; z >>= 1; }
return ans;
}
/*
pair<int,int> bfs (int n, int b[][21], int s) {
int dist[21];
for (int i = 1; i <= n; i++) dist[i] = INF;
dist[s] = 0;
bool vis[21];
for (int i = 1; i <= n; i++)... |
//
// Created by rewbycraft on 1/19/20.
//
#include "grpc-helper.h"
#include "packets.h"
void setup_grpc(struct app_config *aconf) {
RTE_LOG(INFO, APP, "Setting up GRPC...\n");
RTE_LOG(INFO, APP, "\tCreating channel credentials...\n");
auto creds = grpc::InsecureChannelCredentials();
RTE_LOG(INFO, APP, "\tCreatin... |
#include "protoc2rcftest.h"
#include "protoc2rcfcomm.h"
#include <google/protobuf/compiler/code_generator.h>
#include <google/protobuf/compiler/command_line_interface.h>
#include <boost/algorithm/string.hpp>
#include <unistd.h>
#include <iostream>
#include <stdio.h>
#include <fstream>
using namespace std;
namespac... |
#include "SoXipNeheFlagGenerator.h"
#include <Inventor/sensors/SoTimerSensor.h>
#include <Inventor/nodes/SoIndexedFaceSet.h> // contains SO_END_FACE_INDEX definition
SO_ENGINE_SOURCE(SoXipNeheFlagGenerator);
// Initializes the SoXipNeheFlagGenerator class.
void
SoXipNeheFlagGenerator::initClass()
{
SO_ENGINE_INIT_C... |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int route[ 11 ][ 101 ];
void output( int rows, int cols, int m );
int main()
{
int m,n,map[ 11 ][ 101 ],sum[ 11 ][ 101 ];
while (cin>>n>>m)
{
int down,up,Min =10000000,temp= 1;
memset( sum, 0, sizeof(sum) );
memse... |
/***********************************************************************
created: 13/4/2004
author: Paul D Turner
purpose: Implementation of Slider widget base class
*************************************************************************/
/*************************************************************************... |
#include "../header/rectangle.hpp"
#include <iostream>
#include <string>
using namespace std;
int main() {
Rectangle rect1 = Rectangle(4, 4);
cout << "area: " << rect1.area() << endl;
cout << "perimeter: " << rect1.perimeter() << endl;
return 0;
}
|
#include<stdio.h>
#include<iostream>
using namespace std;
int main(int argc, char *argv[])
{
int k= 0;
while(1)
{
int input;
// Scan stream of 0 and 1
cin>>input;
if (input) k = k*2 +1;
else k = k*2;
k = k%3;
if (k == 0 )
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
return 0;
}
|
// walk.h
//
////////////////////////////////////////////////////////////////////////
#if !defined(__WALK_H)
#define __WALK_H
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#include "../fwlib/factory.h"
#include "../fwlib/fwunknown.h"
#include <kineplus.h>
#include <bodyplus.h>
#include "a... |
#include<iostream>
#include"LinkedList.hpp"
using namespace std;
int main(){
LinkedList test1;
cout<<"is it empty "<<test1.is_empty()<<endl;
//test1.remove_first();
try{
//test1.remove_first();
//test1.remove_last();
//test1.remove_current();
//test1.next();
//test1.prev();
//test1.get_first();
//te... |
/*
* Copyright 2016-2017 Flatiron Institute, Simons Foundation
*
* 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 ... |
#include<stdio.h>
#include<conio.h>
void main()
{
clrscr();
int a;
printf("enter number");
scanf("%d",&a);
int i=0;
while(i++<10)
{
printf("\n %d * %d= %d\n",a,i,a*i);
}
getch();
} |
/**
* Copyright (c) 2015, Martin Roth (mhroth@gmail.com)
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" A... |
#pragma once
#ifndef _MATH_SOMETHING_H
#define _MATH_SOMETHING_H
#include <cmath>
#include "./point.cpp"
#define _USE_MATH_DEFINES
namespace math
{
float convertDegreesToRadian(float degree);
int calculateDistance(Point point_1, Point point_2);
Point calculateRotatePosition(float degree, Point center, ... |
/// @file NaImp2.cc
/// @brief NaImp2 の実装ファイル
/// @author Yusuke Matsunaga (松永 裕介)
///
/// Copyright (C) 2005-2012 Yusuke Matsunaga
/// All rights reserved.
#include "NaImp2.h"
#include "ImpMgr.h"
#include "ImpInfo.h"
#include "ImpNode.h"
#include "ImpList.h"
#include "ImpVals.h"
BEGIN_NAMESPACE_YM_NETWORKS
BEGI... |
/*
* Author : BurningTiles
*/
#include <iostream>
using namespace std;
int main(){
int n, temp, ans=0;
cin >> n;
while(n-- && cin >> temp) ans = ans ^ temp;
(ans)? cout << "AMAN" : cout << "JASBIR";
return 0;
}
/*
Juan Marquinho is a geologist and he needs to count roc... |
/****************************************
*
* INSERT-PROJECT-NAME-HERE - INSERT-GENERIC-NAME-HERE
* Copyright (C) 2019 Victor Tran
*
* 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 Foundati... |
/* ---------------------------------------------------------------------
* Numenta Platform for Intelligent Computing (NuPIC)
* Copyright (C) 2018-2019, Numenta, Inc. Unless you have an agreement
* with Numenta, Inc., for a separate license for this software code, the
* following terms and conditions apply:
*
* ... |
#ifndef _H_HUD_SCROLL_COMPUTEREX_H_
#define _H_HUD_SCROLL_COMPUTEREX_H_
#include <string>
#include <vector>
class HUDSCROLL
{
public:
HUDSCROLL()
{
lc=15;
m.resize(lc);
clear();
}
HUDSCROLL(int l)
{
lc=l;
m.resize(lc);
clear();
}
//void insert(char * msg);
void insert(const char * fmt, ...);
void... |
#include "Material.h"
Material::Material(std::shared_ptr<Shader> shader):shader(shader)
{
}
Material::~Material()
{
}
void Material::setUniforms()
{
}
std::shared_ptr<Shader> Material::getShader()
{
return shader;
}
|
#include "planet.h"
#include <QDebug>
#include <cmath>
#include <iostream>
Planet::Planet(const QImage& img, Planet* p) {
/*
Note that the QImage is mirrored vertically to account
for the fact that OpenGL and QImage use opposite directions
for the y axis. Another option would be to... |
#pragma once
#include "database.h"
#include "ChangePassForm.h"
#include "DoctorAddPageControl.h"
using namespace System;
using namespace System::ComponentModel;
using namespace System::Collections;
using namespace System::Windows::Forms;
using namespace System::Data;
using namespace System::Drawing;
using n... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
cout<<"enter number of nodes : ";
int n;
cin>>n;
int b[n][n];
cout<<"\nenter the cost between 2 nodes in the form of matrix :\n";
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>b[i][j];
int a[n];
/... |
/*
Copyright (c) 2005-2023, 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... |
/**
* Copyright (C) 2017 Alibaba Group Holding Limited. 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
*
* ... |
#include "opencv2/highgui/highgui.hpp"
#include "opencv2/imgproc/imgproc.hpp"
#include <iostream>
#include "opencv2/core/core.hpp"
#include <algorithm>
#include <math.h>
#define SQ(x) (x)*(x)
using namespace cv;
using namespace std;
struct point{
int x, y;
};
int main()
{
int i, j, k = 0;
lon... |
// testMap.cpp
#include "Map.h"
#include <iostream>
#include <cassert>
#include <map>
#include <cstdlib>
#include <ctime>
#include <algorithm>
using namespace std;
/*********************************
* *
* Smallberg's Test *
* *
**********... |
#ifndef __data_h
#define __data_h
#include <string>
#include <iostream>
#include <stdint.h>
typedef uint8_t BYTE;
typedef signed char CHAR;
typedef uint16_t WORD;
typedef int16_t INT16;
typedef int16_t SHORT;
typedef int32_t BOOL;
typedef uint32_t DWORD;
typedef uint32_t UINT;
typedef int32_t LONG;
typedef int32_t I... |
#include<map>
class Solution
{
public:
int numJewelsInStones(std::string J,std::string S)
{
std::map<char, int> m;
for (char c : J)
m[c]++;
int ans = 0;
for (char c : S)
if (m.find(c) != m.end())
ans++;
return ans;
}
}; |
// HashSet.hpp
//
// ICS 46 Winter 2021
// Project #4: Set the Controls for the Heart of the Sun
//
// A HashSet is an implementation of a Set that is a separately-chained
// hash table, implemented as a dynamically-allocated array of linked
// lists. At any given time, the HashSet has a "size" indicating
// how many ... |
/*************************************************************
* > File Name : P4722.cpp
* > Author : Tony
* > Created Time : 2020/04/14 08:33:27
* > Algorithm : MaxFlow HLPP
**************************************************************/
#include <bits/stdc++.h>
using namespace std... |
#include "FragTrap.hpp"
FragTrap::FragTrap() : ClapTrap() {
this->_hitPoints = 100;
this->_maxHitPoints = 100;
this->_energyPoints = 100;
this->_maxEnergyPoints = 100;
this->_level = 1;
this->_name = "No Name";
this->_meleeDamage = 30;
this->_rangeDamage ... |
/*Given a pattern containing only I's and D's. I for increasing and D for decreasing.
Devise an algorithm to print the minimum number following that pattern.
Digits from 1-9 and digits can't repeat.
Input:
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case... |
#include<bits/stdc++.h>
using namespace std;
int knapsack(int n,int w,int* weight,int* profit)
{
// base case
if(n==0)
{
return 0;
}
if(w==0)
{
return 0;
}
if(weight[n-1] <= w)
{
return max(profit[n-1] + knapsack(n-1,w-weight[n-1],weight,profit) , knapsack(n-1,w,weight,profit));
}
return knapsack(... |
#pragma once
/* Far Dice Throw
* PATCHES: Skill.dll
*/
#include "../Main.h"
#include "../Singleton.h"
#include "GenericPatcher.h"
class CPatcher_FarDiceThrow : public IGenericPatcher {
public:
CPatcher_FarDiceThrow();
bool ReadINI(void);
bool WriteINI(void);
private:
// Hook functions
static void SetThrowRad... |
#include "table_hotel.h"
#include "ui_table_hotel.h"
#include <QStringList>
#include <QHeaderView>
#include <QStandardItemModel>
#include <QDebug>
#include <QMessageBox>
#include <QInputDialog>
#include <QMessageBox>
#include"table_room.h"
Table_hotel::Table_hotel(QWidget *parent) :
QDialog(parent),
ui(new Ui::... |
#include "IniFile.h"
#include "Crypt.h"
#include "FileUtils.h"
#include "StringUtils.h"
#include "Testing.h"
IniFile::IniFile()
{
//
}
void IniFile::AppendStr( const string& buf )
{
ParseStr( buf );
}
bool IniFile::AppendFile( const string& fname )
{
File fm;
if( !fm.LoadFile( fnam... |
#pragma once
#include "FunctionTreeNode.h"
#include <QString>
#include <QRegExp>
#include <QMap>
class FunctionTreeNodeWithOperation : public FunctionTreeNode
{
public:
FunctionTreeNodeWithOperation();
~FunctionTreeNodeWithOperation();
QString derivate(QChar derivativeBasis);
QString restoreFunction... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, q;
cin>>n;
string a[n];
for(int i=0; i<n; i++) cin>>a[i];
cin>>q;
while(q--)
{
string b;
cin>>b;
int ans = 0;
for(int i=0; i<n; i++)
{
if(a[i]==b) ans++;
}
cout<<ans<<endl;
}
} |
// 10720101 阮彥吉吉 10720137 陳微心 請助教下載github版本
#include <iostream>
#include <fstream>
#include <string>
#include <cstdlib>
#include <iomanip>
#include <cstring>
#include <math.h>
using namespace std;
#define COLUMNS 6
#define MAX_LEN 10
#define BIG_INT 255
typedef struct sT{
char sid[MAX_LEN];
char ... |
/*
Copyright (c) 2005-2023, 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... |
//**************************************************************************
//**
//** See jlquake.txt for copyright info.
//**
//** 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 ... |
#pragma once
#include "TerminalFunctionality.hpp"
#include "TerminalControl.hpp"
#include "Logger.hpp"
#include "LogSpace.hpp"
class InviteReceiver : public TerminalCommand
{
public:
bool doCommand() const override;
InviteReceiver(std::string command, std::shared_ptr<ChatInformation> chatInfo);
~InviteRe... |
#include "InputListener.h"
CInputListener::CInputListener( CInput* pInput )
: m_pInput( pInput )
{
assert( m_pInput );
}
bool CInputListener::IsButtonDown( u32 uButton ) const
{
assert( m_pInput );
return m_pInput->IsButtonDown( uButton );
}
void CInputListener::SetButton( u32 uButton, bool bDown )
{
assert( m_... |
// @copyright 2017 - 2018 Shaun Ostoic
// Distributed under the MIT License.
// (See accompanying file LICENSE.md or copy at https://opensource.org/licenses/MIT)
#pragma once
#include <boost/winapi/basic_types.hpp>
#if !defined (BOOST_USE_WINDOWS_H)
BOOST_SYMBOL_IMPORT boost::winapi::VOID_ WINAPI SetLastError(
boo... |
#ifndef OUTPUTNODE_H
#define OUTPUTNODE_H
#include "node.hpp"
#include <mm/heightmap.h>
class OutputNode : public Node
{
public:
explicit OutputNode(QGraphicsItem *parent = 0);
enum { Type = UserType + 3 };
virtual int type() const { return Type; }
protected:
virtual void updateMap();
virtual const Map* rawMa... |
#ifndef _BCCONFIGREADER_H_
#define _BCCONFIGREADER_H_
#include <QFile>
#include <QString>
//#include "moduleBase/IOBase.h"
#include "DataProperty/modelTreeItemType.h"
class QDomDocument;
class QDomElement;
namespace ConfigOption
{
class BCConfig;
class BCConfigReader //: public ModuleBase::IOBase
{
public:
... |
#pragma once
#ifndef __COURSE_B_H
#define ___COURSE_B_H
#include <string>
using namespace std;
class Course {
public:
Course();
~Course();
private:
int id;
string name;
friend class Student;
};
#endif |
문제
베르트랑 공준은 임의의 자연수 n에 대하여, n보다 크고, 2n보다 작거나 같은 소수는 적어도 하나 존재한다는 내용을 담고 있다.
이 명제는 조제프 베르트랑이 1845년에 추측했고, 파프누티 체비쇼프가 1850년에 증명했다.
예를 들어, 10보다 크고, 20보다 작거나 같은 소수는 4개가 있다. (11, 13, 17, 19) 또, 14보다 크고, 28보다 작거나 같은 소수는 3개가 있다. (17,19, 23)
자연수 n이 주어졌을 때, n보다 크고, 2n보다 작거나 같은 소수의 개수를 구하는 프로그램을 작성하시오.
#include <iostream... |
#include <bits/stdc++.h>
using namespace std;
// Complete the hourglassSum function below.
int hourglassSum(vector<vector<int>> mat)
{
int C = mat.size();
int R = mat.size();
// cout << R << " " << C << endl;
int max_sum = INT_MIN;
for (int i = 0; i < R - 2; i++)
{
for (int j = 0; j < ... |
#pragma once
/**
* Data Structures - linked list
* circular_linked_list.hpp
* Purpose: Circular Linked List interface
*
* @author Prabhsimran Singh
* @version 1.0 27/10/18
*/
#include <iostream>
#include "node.hpp"
namespace ds {
template <typename T>
class CircularSinglyLinkedList {
private:
SingleNod... |
#include "battlecontroller.h"
#include "unit.h"
BattleController::BattleController(uint8 teamsCount, uint8 sizeTeam) :
_teamsCount(teamsCount),
_sizeTeam(sizeTeam)
{
_units = new Unit[_teamsCount * _sizeTeam];
_speedList = new stat[_teamsCount * _sizeTeam];
_userActions = new std::list<UserAction>[... |
/*********************************************************************
Matt Marchant 2014 - 2016
http://trederia.blogspot.com
xygine - Zlib license.
This software is provided 'as-is', without any express or
implied warranty. In no event will the authors be held
liable for any damages arising from the use of this soft... |
// C++ for the Windows Runtime vv1.0.170303.6
// Copyright (c) 2017 Microsoft Corporation. All rights reserved.
#pragma once
#include "Windows.UI.Composition.Effects.2.h"
WINRT_EXPORT namespace winrt {
namespace Windows::UI::Composition::Effects {
struct WINRT_EBO SceneLightingEffect :
Windows::UI::Composition... |
#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n,l;
int x,y;
while(true){
cin >> n;
if(n==0){break;}
cin >> l;
vector<int> g[n];
while(l-->0){
cin >> x >> y;
//bidirectional or undirected graph
//is using 0 based index, so no need to reduce x and y
g[x].... |
#ifndef SUPERVISOR_H
#define SUPERVISOR_H
#include "employee.h"
#include <qlist.h>
#include <qfile.h>
#include <qtextstream.h>
/**
* @brief Класс Диспетчер
*/
class Supervisor : public Employee
{
public:
/**
* @brief Конструктор класса Supervisor
* @param Фамилия и инициалы диспетчера
* @param Ид... |
#include<bits/stdc++.h>
using namespace std;
void allSubsequences(string& s, vector<string>& v)
{
if(s.empty())
{
v.emplace_back("");
return ;
}
string str = s.substr(1);
allSubsequences(str, v);
vector<string>::iterator end = v.end();
for(vector<string>::iterator vst = v.begin(); vst != end; ++vst... |
#include <iostream> //console Input/Output
#include <time.h> //include system time
#include "Store.h"
#include <time.h>
using namespace std;
// function prototypes
bool newCustomerCuesUp();
int getWait(int);
int customersEnterStore(int);
int main(void)
{
srand(time(NULL)); //seed the random... |
// Copyright (c) 2015 University of Szeged.
// Copyright (c) 2015 The Chromium Authors.
// All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef SPROCKET_BROWSER_UI_TOOLBAR_H_
#define SPROCKET_BROWSER_UI_TOOLBAR_H_
#include "base/strings/u... |
#include "loguru/loguru.hpp"
#include <unordered_map>
#include <mutex>
#include <chrono>
#include "BlockingQueue.h"
using std::unordered_map;
using std::chrono::steady_clock;
/**
* The Messenger class implements message-based communication between servers
* and clients with request/response semantics.
*
* Cli... |
#include "../header/fastfood_client.hpp"
#include "../header/fastfood_creator.hpp"
#include "../header/fastfood_restaurant.hpp"
#include "../header/restaurant.hpp"
void FastFood_Client::fastfood_burger_run()
{
int burgerCount{1};
m_Burger.push_back(Create("McDonald's", "$", "Burger"));
m_Burger.at(0)->set... |
/*************************************************************
* > File Name : P2148.cpp
* > Author : Tony
* > Created Time : 2019/10/02 20:15:54
* > Algorithm : 博弈SG
**************************************************************/
#include <bits/stdc++.h>
using namespace std;
inlin... |
//**************************************************************************
//**
//** See jlquake.txt for copyright info.
//**
//** 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 ... |
/*
Copyright (c) 2013-2014 Sam Hardeman
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, dist... |
#ifndef EQUIPMENT_H
#define EQUIPMENT_H
#include <object.h>
namespace lab3
{
namespace objects
{
class Equipment : public Object
{
public:
Equipment(const std::string &name, const std::string &description,
int price,
int volume,
int weight);
int wear () const;
v... |
/*********************************************************************
Matt Marchant 2014 - 2016
http://trederia.blogspot.com
xygine - Zlib license.
This software is provided 'as-is', without any express or
implied warranty. In no event will the authors be held
liable for any damages arising from the use of this soft... |
#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
using namespace std;
const int MAX_N = 8;
const int MAX_M = 30;
const int INF = std::numeric_limits<int>::max(); //2,147,483,647 == 2^31 -1
//INPUT
int n,m,a,b;
int t[MAX_N]... |
#ifndef PROGRAMWINDOW_H
#define PROGRAMWINDOW_H
#include "scientist.h"
#include "scientistservice.h"
#include "computerservice.h"
#include "linkservice.h"
#include <QDialog>
#include <vector>
namespace Ui {
class ProgramWindow;
}
class ProgramWindow : public QDialog
{
Q_OBJECT
public:
explicit ProgramWindow... |
#include <iostream>
#include <string>
#include "AddressType.h"
using namespace std;
void AddressType::setAddress(string strAddr, string c, string st, string z){
streetAddress = strAddr;
city = c;
state = st;
zipCode = z;
}
void AddressType::getAddress(string &streetAddress, string &city, string &state, stri... |
#include "shopmainwindow.h"
#include "ui_shopmainwindow.h"
#include "dialogquerypasswd.h"
#include "loginwindow.h"
#include "tool/databaseimpl.h"
#include "tool/editablequerymodel.h"
#include "model/userinfomodel.h"
#include "model/goodstypemodel.h"
#include "model/goodsinfomodel.h"
#include "model/goodsstockmodel.h"
... |
#include <iostream>
#include "MontonCartas.h"
#include "Player.h"
using namespace std;
int on ()
{
cout << "\t******** BLACK JACK ********" << endl << endl;
cout << "\t1 - Play" <<endl;
cout << "\t2 - Rules" << endl;
cout << "\t3 - Exit" <<endl;
int op ;
cin >> op;
return op;
}
bool fin... |
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isValidBSTHelp(TreeNode * root, TreeNode * min_node, TreeNode * max_node) {
... |
#include "tcp_socket.h"
#include <cstdio>
#include <cstdlib>
#include <cstring>
int getSocket(int domain, int type, int protocol, bool block)
{
int sock = socket(domain, type, protocol);
if (sock == -1)
return -1;
/*if (!block)
setNonBlock(sock);*/
int value = 1;
... |
#include "VOMachine.h"
#include "opencv2/core/core.hpp"
#include "CameraImage.h"
#include <ctime>
#include <fstream>
using namespace cv;
VOMachine::VOMachine(VOAlgorithm* algorithm) : m_algorithm(algorithm){
m_log_file = "";
m_log = false;
}
VOMachine::~VOMachine(){
std::list<BufferComponent*>::iterator it = img_... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stdexcept>
using namespace std;
int main()
{
vector<int> vec; // empty vector
vec.reserve(40);
cout << "vector size: " << vec.size()
<< " vector capacity: " << vec.capacity() << endl;
// disaster: attempts to write to 10 (nonexistent)... |
#include "audio_detener.h"
using namespace App_Audio;
Audio_detener::Audio_detener(int idd)
:id_destino(idd)
{
}
|
#include <iostream>
#include<string>
using namespace std;
class saurav{
public:
void cool(int x) {
string c;
char q[5];
cout<<"\\CREATING PATIENT DATABASE................."<<endl;
cout<<"START LOADING ....."<<endl;
cout<<"Patient id... |
FILESEXTRAPATHS_prepend := "${THISDIR}/rng-tools:"
|
//**************************************************************************
//**
//** See jlquake.txt for copyright info.
//**
//** 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 ... |
/********************************************************************************
** Form generated from reading UI file 'terver_lab1.ui'
**
** Created by: Qt User Interface Compiler version 4.8.5
**
** WARNING! All changes made in this file will be lost when recompiling UI file!
***************************************... |
//------------------------- problem 1 B
#include <iostream>
using namespace std;
int main(){
float number1, number2, Sum, Product, Subtract, Divide, Modulus;
cout << "enter two number one by one \n";
cin >> number1;
cin >> number2;
Sum=number1 + number2 ;
Product=number1*number2;
Subtract=number1-number2;
Divide = numb... |
#include "phone_number.h"
namespace phone_number {
phone_number::phone_number(std::string digits) {
this->digits = digits;
_area_code();
_number();
if (_number_digits.length() > 11 || _number_digits.length() < 9)
throw std::domain_error("Wrong number of digits");
if(_number_digits.length() == 11 && _nu... |
#pragma once
#include <tudocomp/def.hpp>
namespace tdc {
namespace lzss {
class Factor {
public:
len_compact_t pos, src, len;
inline Factor() {
// undefined!
}
inline Factor(len_t fpos, len_t fsrc, len_t flen)
: pos(fpos), src(fsrc), len(flen) {
}
} __attribute__((__packed__));... |
/*
* Programador del módulo: Javier Corbalán Colino (NIP: 720883)
* Fecha: 20 de enero de 2016
*/
/*
* Fichero tiempo.cc de implementación del módulo tiempo
*/
#include "tiempo.h"
/****************************************************************************
* Funciones para definir el valor de un dato de tip... |
#include "Film.h"
#include "tinyxml2.h"
Film::Film()
{
}
void Film::Deserialization( tinyxml2::XMLElement* pRootElement )
{
const char* Filename = pRootElement->Attribute( "filename" );
mFilename.insert( mFilename.size() , Filename , strlen( Filename ) );
pRootElement->QueryIntAttribute( "width" , &mWidth );
pR... |
/*************************************************************
* > File Name : P1137.cpp
* > Author : Tony
* > Created Time : 2019/10/22 21:05:18
* > Algorithm : topsort
**************************************************************/
#include <bits/stdc++.h>
using namespace std;
in... |
#include "widget.h"
#include "ui_widget.h"
#include <QDebug>
Widget::Widget(QWidget *parent) :
QWidget(parent),
ui(new Ui::Widget)
{
ui->setupUi(this);
setWindowIcon(QIcon(":/new/1"));
createWidgets();
createConnects();
createEventFilter();
//setWindowFlags(Qt::Desktop);//使窗口不可见
//s... |
#ifndef MAINWINDOW_H
#define MAINWINDOW_H
#include <QWidget>
#include <QTableWidget>
#include <QBoxLayout>
#include <QLabel>
#include <QPushButton>
#include "Common/customtitle.h"
#include "Common/dialog.h"
#include "loadres.h"
#include "Widget/widgetidentify.h"
class MainWindow : public Dialog
{
Q_OBJECT
public... |
#ifndef FORMALEXPRESSION_H
#define FORMALEXPRESSION_H
#include "calculator.h"
class FormalExpression : public Expression
{
private:
static const std::vector<std::string> expressionOps;
/*
LeftHandSide lhs;
RightHandSide rhs;
*/
std::string operation;
... |
#ifndef FISHY_TOKENIZER_INL
#define FISHY_TOKENIZER_INL
#include <CORE/BASE/checks.h>
#include <CORE/UTIL/comparisonchain.h>
namespace core {
namespace util {
namespace parser {
/**
*
*/
template < typename tId >
inline Tokenizer< tId >::Tokenizer(
const typename Tokenizer< tId >::tTokenizerList &tokenizers)
... |
#pragma once
/* This file will contain all the datapoints required for the webcam */
#include <iostream>
#include <string>
#include <vector>
struct note
{
std::string name;
int webcam, x, y, r;
note(const std::string&, int, int, int = 0, int = 3);
friend std::ostream& operator<<(std::ostream& os, cons... |
#include <iostream>
using namespace std;
int main()
{
int qntRounds, qntAmigos;
cin>>qntAmigos;
int lista[qntAmigos+1];
cin>>qntRounds;
for(int i = 1; i <= qntAmigos; i++){
lista[i] = 0;
}
for(int i = 0; i < qntRounds; i++){
int round;
cin>>ro... |
#ifndef __CCB_NAMED_NODE_H__
#define __CCB_NAMED_NODE_H__
#include "base/CCRef.h"
#include "2d/CCNode.h"
#include "base/CCMap.h"
namespace cocosbuilder {
class CCBNamedNode : public cocos2d::Ref
{
public:
/**
* @js ctor
*/
CCBNamedNode();
/**
* @js... |
#include <Fsl.h>
using namespace Fsl;
#include <Fel.h>
using namespace Fel;
#include <SnesApu.h>
using namespace SnesApu;
#include <Windows.h> // BOOO
class OutputDevice
{
public:
OutputDevice(Apu *apu, IAudioDriver *driver)
{
this->apu = apu;
const int bufferSize = driver->GetSampleRate() * 2;
left = new s... |
//
// Created by Alex Shaver on 8/30/17.
//
#include "Axle.h"
#include <iostream>
namespace {
const std::string RegistrationName{"Axle"};
RegisterInFactory<Alpha, Axle> registerMe{RegistrationName};
}
void Axle::print() {
std::cout << "Printing Axle" << std::endl;
}
|
/**
* @file Nfcemudevice.cpp
* @author Lukas Schuller
* @date Tue Sep 24 23:56:13 2013
*
* @brief
*
*/
#include "NfcEmuDevice.h"
#include <unistd.h>
#include <boost/timer/timer.hpp>
#include "Util.h"
#include "Debug.h"
#include "pthread.h"
using namespace std;
using namespace boost::asio;
namespace N... |
#include "SunFlowerIcon.h"
SunFlowerIcon::SunFlowerIcon(QGraphicsScene *sunFlowerIconScene) : sunFlowerIconScene{sunFlowerIconScene}
{
isSelected=false;
isSelectable=false;
//set picture
setPixmap(QPixmap(":/images/dark sunflower icon.png"));
//add to scene
sunFlowerIconScene->addItem(this);
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.