blob_id stringlengths 40 40 | language stringclasses 1
value | repo_name stringlengths 5 117 | path stringlengths 3 268 | src_encoding stringclasses 34
values | length_bytes int64 6 4.23M | score float64 2.52 5.19 | int_score int64 3 5 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | text stringlengths 13 4.23M | download_success bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|
fcdd360cd290c522f8fb161f32aa8dd1c817b296 | C++ | Nealoth/List | /main.cpp | UTF-8 | 281 | 2.859375 | 3 | [] | no_license | #include <iostream>
#include "List.h"
using namespace custom_std;
int main() {
List<int> list;
list.push_back(1);
list.push_back(2);
list.push_back(3);
std::cout << list.at(1) << std::endl;
std::cout << list.size() << std::endl;
return 0;
}
| true |
de219a4f321a4e7fe0cc4790e81f629f08221fa5 | C++ | FusixGit/hf-2011 | /Protect/Rookit/Hook/HookApi/HookApi/HookApi.cpp | GB18030 | 1,333 | 2.53125 | 3 | [] | no_license |
#include <windows.h>
#include "HookApi.h"
CHOOKAPI HookItem ;
// MessageBoxAԭ
typedef int (WINAPI* PFNMessageBoxA)( HWND hWnd, LPCSTR lpText, LPCSTR lpCaption, UINT uType ) ;
// ԶMessageBoxA
// ʵֶԭʼMessageBoxA롢ļأȡ
int WINAPI NEW_MessageBoxA( HWND hWnd, LPCSTR lpText, LPCSTR lpCaption, UINT uType )
{
/... | true |
3f29f425bc60a6d3822cc9d215bf9d3086c48cf7 | C++ | woswos/e3-obfuscation-wars | /benchmark-server/old-versions/benchmark-server-0.6.1 - Experimenting with auto return type/benchy/src/gate/gate.h | UTF-8 | 4,388 | 2.53125 | 3 | [] | no_license | #ifndef GATE_API_H
#define GATE_API_H
#include "base.h"
class GateApi : public Scheme
{
private:
public:
/*******************/
/* Supported Gates */
/*******************/
void Init(){
// generate default gate bootstrapping parameters
int32_t minimum_lambda = 100;
TFheGateBoot... | true |
539ac77a95f5ab1f6acf3bc158d022b4a999102b | C++ | Ge-yuan-jun/coursera-peking-university | /C程序设计进阶/week6/lecture1/cursorForDimensionArray.cpp | UTF-8 | 589 | 3.21875 | 3 | [] | no_license | /**
* @Author: geyuanjun
* @Date: 2016-06-20 13:55:16
* @Email: geyuanjun.sh@superjia.com
* @Last modified by: geyuanjun
* @Last modified time: 2016-06-20 14:00:58
*/
//多维数组名做函数参数
#include<iostream>
using namespace std;
int maxValue(int (*p)[4]){
int max = p[0][0];
for(int i = 0; i < 3; i++){
fo... | true |
e0a2c62d9be418559994897871b11fb2b6259ada | C++ | RashakDude/codechef_ps | /Beginner/FLOW016.cpp | UTF-8 | 288 | 3.1875 | 3 | [] | no_license | #include <iostream>
using namespace std;
long gcd (long a ,long b){
if(b==0) return a;
else return gcd(b,a%b);
}
int main(){
int num;
cin >> num;
while(num--){
long x,y;
cin >> x >> y;
cout << gcd(x,y) << " " << x*y/gcd(x,y) << endl;
}
} | true |
28cae45013818bd1e17e81433e4cb85ad5241f6e | C++ | walkccc/LeetCode | /solutions/1502. Can Make Arithmetic Progression From Sequence/1502.cpp | UTF-8 | 590 | 2.796875 | 3 | [
"MIT"
] | permissive | class Solution {
public:
bool canMakeArithmeticProgression(vector<int>& arr) {
const int n = arr.size();
const int max = *max_element(arr.begin(), arr.end());
const int min = *min_element(arr.begin(), arr.end());
const int range = max - min;
if (range % (n - 1) != 0)
return false;
const... | true |
a52841e0d7ad4acd10340f1617f164ae6697132f | C++ | vikasbhalla05/Data-Structures-using-Cpp | /DeletionInLinkedList.cpp | UTF-8 | 487 | 3.59375 | 4 | [] | no_license | // to delete the nth node
// put (n-1)th temp = nth temp
void deleteAtHead(node* &head){
node* todelete=head;
head= head->next;
delete todelete;
}
void deleteNode( node* &head, int val){
node* temp=head;
while(temp->next->data!=val)
{
temp=temp->next;
}
node* todelete=temp->next;
temp->... | true |
5e963970358823bc5836077286847fd1f8cd7949 | C++ | rulo7/3DFreeGlutSimpleAnimationObject | /Lapiz_3D.cpp | UTF-8 | 3,150 | 2.984375 | 3 | [] | no_license | /**
*
* Autores: Raul Cobos y Alvar Soler
* Funciones de la clase Lapiz.
* */
#include "Lapiz_3D.h"
#include "Lista.h"
#include <cmath>
#include <iostream>
#include <GL/freeglut.h>
#define PI 3.14159265
Lapiz_3D::Lapiz_3D() {
_recorrido.ponDr(new PV3D(0.0, 0.0, 0.0));
this->_direc = 0.0;
this->_eje... | true |
42da35ad558b8415832fe91bf53ff05638fd8b93 | C++ | wgevaert/AOC | /2021/18.cpp | UTF-8 | 6,425 | 2.859375 | 3 | [
"WTFPL"
] | permissive | #include <iostream>
#include <fstream>
#include <chrono>
#include <string>
#include <vector>/*
#include <unordered_map>*/
// Because I'm too lazy to type
typedef uint64_t ull_t;
typedef uint32_t u_t;
typedef int64_t ll_t;
unsigned verb_lvl = 0;
void read_or_die(std::string pattern, std::istream& input) {
for (au... | true |
acf7193369b325fe53ae909d7581c1d62c777305 | C++ | LasseD/uva | /P10842.cpp | UTF-8 | 1,093 | 2.625 | 3 | [] | no_license | int find(int x, int *parents) {
if(parents[x] != x)
parents[x] = find(parents[x], parents);
return parents[x];
}
bool _union(int x, int y, int *parents, int *ranks) {
int xRoot = find(x, parents);
int yRoot = find(y, parents);
if(xRoot == yRoot)
return false;
// x and y are not already in same set.... | true |
892b70cb9fe6f51531e2e91adec432fa3654823c | C++ | T1duS/CompetitiveProgramming | /Olympiad/IOI/14-wall.cpp | UTF-8 | 1,572 | 2.84375 | 3 | [] | no_license | /*
Soln:
Same as IOI official soln
*/
#include "wall.h"
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i ++)
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define pii pair<int,int>
#define F first
#define S second
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
c... | true |
1c154f47146a08948475113db04f2324ce6f5ade | C++ | calvin456/intro_derivative_pricing | /cpp_dsgn_pattern_n_derivatives_pricing/chapter6/exercise6_1/exercise6_1/main.cpp | UTF-8 | 5,640 | 2.78125 | 3 | [
"MIT"
] | permissive | /*
Excercice 6.1 For various cases compare convergence of MC sim w/ and w/o anti-thetic sampling
For definition of antithetic var see notes, Numerical Methods II, Prof. Mike Giles, Oxford
http://people.maths.ox.ac.uk/~gilesm/mc/
For three cases, antithetic method achieves lower se and price computed is more stable ov... | true |
54b5a46468b0039e884e2e30cd59bd026e61b877 | C++ | anwar-hegazy/GoGoGo | /TestCode/GoGoGo-MotorTest2/GoGoGo-MotorTest2.ino | UTF-8 | 1,148 | 2.671875 | 3 | [] | no_license | // the setup function runs once when you press reset or power the board
int in1 = 6;
int in2 = 8;
int stby = 0;
int pwm = 5;
int decoder = 2;
int countLimit = 10000;
int counter=0;
void setup() {
// initialize digital pin 13 as an output.
pinMode(pwm, OUTPUT);
pinMode(in2, OUTPUT);
pinMode(in1, OUTPUT);
p... | true |
54281967c3f2454d634a26b5e076a8339c66ec64 | C++ | dean2727/KattisJourney | /lab7/lawn_mower/C.cpp | UTF-8 | 1,788 | 3.28125 | 3 | [] | no_license | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int nx, ny;
float xi, yi, left, right;
float w;
cin >> nx;
while (nx != 0) {
cin >> ny >> w;
bool horizGap = false, vertGap = false;
vector<float> vertPasses;
while (nx--) {
cin >> xi;
//cout << "xi is "... | true |
6b5bbd7a05a1a94b59857348cd5071bd31d8f66b | C++ | pavel-lebedev96/Translator-Lexical-analysis | /Транслятор/var_table.cpp | UTF-8 | 1,720 | 3.03125 | 3 | [] | no_license | #include "lexemes.h"
#include "var_table.h"
int var_table::hash(std::string l_name)
{
int summ = 0;
for (auto i : l_name)
summ += i;
return summ % table.size();
}
var_table::var_table(const int size)
{
table = std::vector<std::vector<T_lexemes>>(size);
}
bool var_table::add_lexeme(std::string l_name, std::pair<in... | true |
d454e7574ab1ff97cc6dd912bae6a01d660b3a4e | C++ | edwardrowens/jimmyjump | /Core/Box2dMapper.cpp | UTF-8 | 656 | 2.59375 | 3 | [] | no_license | #include "Box2dMapper.h"
b2FixtureDef Box2dMapper::mapToFixture(const ObjectPhysicalProperties::ObjectPhysicalProperties &props) {
b2FixtureDef fixtureDef;
fixtureDef.density = props.density;
fixtureDef.friction = props.friction;
return fixtureDef;
}
b2BodyDef Box2dMapper::mapToBody(const ObjectPhysicalProperti... | true |
34aa1afe6513e1a8fb741a618d8fe0ccbc7b97f0 | C++ | luchenqun/leet-code | /problems/809-expressive-words.cpp | UTF-8 | 2,044 | 3.546875 | 4 | [] | no_license | /*
* [827] Expressive Words
*
* https://leetcode-cn.com/problems/expressive-words/description/
* https://leetcode.com/problems/expressive-words/discuss/
*
* algorithms
* Medium (31.40%)
* Total Accepted: 27
* Total Submissions: 86
* Testcase Example: '"heeellooo"\n["hello", "hi", "helo"]'
*
* 有时候人们会用额外的... | true |
b5811e3302168268191d22ef3e849b2f1679d72d | C++ | Zephyrwind/computational-physics | /EX1-RNG/1.3.cpp | UTF-8 | 2,008 | 3.390625 | 3 | [] | no_license | /* Cláudio Santos nº 42208
MIEF - Modelação em Física e Engenharia
Ex 1.3 - Teste do Qui-Quadrado
Outubro de 2016
*/
#include <math.h>
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
int main()
{
/* Declaraçao de variaveis */
int X0=333331; // seed
int c=3; // multipli... | true |
7fc54271739f50936a79107bcb83640858b33440 | C++ | piyush-taneja/Codes | /c++ codes/labsheet1(1).cpp | UTF-8 | 1,762 | 3.734375 | 4 | [] | no_license | #include<iostream>
using namespace std;
class complex{
double real;
double imaginary;
public:
void enter_data();
void display_data();
void addition(complex c1,complex c2);
void subtraction(complex c1,complex c2);
void multipication(complex c1,complex c2);
void division(complex c1,comp... | true |
a669206068cd8973d85c082bad35a1d57009d09b | C++ | KaranPhadnisNaik/BattleShip-Game | /Player.cpp | UTF-8 | 16,078 | 3.375 | 3 | [] | no_license | #include "Player.h"
#include <iostream>
#include <cctype>
#include <string>
using namespace std;
const int NORTH = 0;
const int SOUTH = 1;
const int EAST = 2;
const int WEST = 3;
const bool PLAYERGRID = true;
const bool OPPONENTGRID = false;
Player::Player()
{
for (int i = 0; i < 11; i++)
{
for (int j = 0; j <... | true |
d3740a83f6173056b0f60d254648cdae831c4d92 | C++ | anderson-pids/ri-autocompletion_algorithms | /ican_implemented/src/trie.hpp | UTF-8 | 2,541 | 2.578125 | 3 | [] | no_license | #pragma once
#include "itemTable.hpp"
#include "trieNode.hpp"
#include <set>
#include <queue>
#include <vector>
namespace trie {
struct ActiveNode_t {
TrieNode_t* node;
mutable int editDistance;
mutable int positionDistance;
ActiveNode_t(TrieNode_t*, int);
ActiveNode_t(TrieNode_t*, int, int);
... | true |
6f50022e472065c6826219ed76f4ff0fc4b15888 | C++ | nabeeljay/cd | /abdul_karim/TAC/parent.cpp | UTF-8 | 4,256 | 2.671875 | 3 | [] | no_license | #include "parent.h"
parent::parent()
{
}
parent::parent(string fileName)
{
populate(fileName);
}
void parent::populate(string fileName)
{
char temp[32];
LOC t1;
int index = 0;
ifstream file(fileName);
if(!file)
{
cerr << "Error opening the input file: " << fileName << endl;
return;
}
while (file)
{
... | true |
4b136184a07751cb2e2bb66076c10ae2ffaa12b2 | C++ | anantatapase/SPOJ | /NICEBTRE.cpp | UTF-8 | 799 | 3.03125 | 3 | [] | no_license | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int i,l;
void print(char s[],int h,int *max)
{
if(i==l-1)
return;
if(h>*max)//can make max global also
*max=h;
if(s[i]=='l')
{
i++; //inserted leaf in tree (virtually) and going to next node in preorder traverasl
return;//left s... | true |
f03e0f46ced7108dbd601a4e8bb1dbb396a68ea7 | C++ | tesion99/LeetCode | /cpp/74_searchMatrix.cpp | UTF-8 | 2,675 | 4.09375 | 4 | [] | no_license | /*
编写一个高效的算法来判断 m x n 矩阵中，是否存在一个目标值。该矩阵具有如下特性：
每行中的整数从左到右按升序排列。
每行的第一个整数大于前一行的最后一个整数。
示例 1:
输入:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
输出: true
示例 2:
输入:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
输出: false
来源：力扣（LeetCode）
链接：https... | true |
1c9d2a488433d3615f067e1ee86b22720af56c92 | C++ | ldaIas/MatrixCalculator | /test.cpp | UTF-8 | 3,114 | 3.765625 | 4 | [] | no_license | #include <vector>
#include <stdio.h>
#include "matrix.h"
#include <string>
using namespace std;
// Print a failure message
void print_fail(string msg){
printf("\033[0;31m%s\033[0m\n", msg.c_str());
}
// Print a success message
void print_success(string msg){
printf("\033[0;32m%s\033[0m\n", msg.c_str());
}
//... | true |
541115f1f07a65dfd4d378dee31a6269deac314e | C++ | bcaso/data_structure | /1_SqList/main.cpp | UTF-8 | 6,299 | 3.671875 | 4 | [] | no_license | /*
* 动态分配的顺序表
* */
#include <iostream>
using namespace std;
#define InitSize 10 //定义线性表的最大长度
typedef struct SqList{
int* data; // Clion 查看动态数组 (int(*)[10])L.data
int MaxSize;
int length;
}DynamicList;
//初始化
void Init(DynamicList& L) {
L.data = (int*)malloc(InitSize * sizeof (int));
//判断是否分配成功
... | true |
87d442a5841b10122f6f840818863ae20aad652b | C++ | CoderDojoWarszawa/Arduino | /10_Servo/10c_Servo_lewo_prawo/10c_Servo_lewo_prawo.ino | UTF-8 | 634 | 2.875 | 3 | [] | no_license | #include <Servo.h>
// GND (czarny, ciemnobrązowy) - GND
// +5V Zasilanie (czerwony) - +5V
// Sygnał sterujący (żółty/pomarańczowy) - 9
Servo serwo; //Tworzymy instancję o nazwie serwo
int pozycja = 0; //Aktualna pozycja serwa 0-180
int zmiana = 1; //Co ile ma się zmieniać pozycja serwa?
void setup() {
serwo.att... | true |
69e07e01c8b6889b0ed3001e7120d30fca145063 | C++ | dradgun/firstweb | /k/chairman.cpp | UTF-8 | 1,684 | 3.171875 | 3 | [] | no_license | #include <iostream>
#include <iomanip>
#include <stdlib.h>
using namespace std;
void randVotes(/* float votes,int chairmanAmount */);
int main() {
int width = 7,count;
int chairmanNumber;
float votesNumber,notVotes;
int chairmanVotes[] = {};
const float numberOfRightStd = 500;
cout << "Enter n... | true |
3361c20e84fe5893eacb57637e2a13ebcbb878fb | C++ | duyanwei/leetcode | /204-CountPrimes/solution.cpp | UTF-8 | 1,759 | 3.796875 | 4 | [] | no_license | /**
* @file solution.cpp
* @author duyanwei (duyanwei0702@gmail.com)
* @brief
* @version 0.1
* @date 2020-03-05
*
* @copyright Copyright (c) 2020
*
*/
#include <iostream>
#include <vector>
class Solution {
public:
int countPrimes(int n) {
int m = n - 1;
int num = 0;
while (m > 2) ... | true |
35d2fe01fff575f1928a3ed117dd334b73a529b9 | C++ | marouaneaba/TP-C-graphique-GTK-MVC-..- | /TP3/src/Produit.cpp | UTF-8 | 400 | 3.28125 | 3 | [] | no_license | #include "Produit.hpp"
#include <iostream>
Produit::Produit(int id,const std::string& description):_id(id),_description(description){
}
int Produit::getId()const{
return _id;
}
const std::string& Produit::getDescription() const{
return _description;
}
void Produit::afficherProduit() const{
std::cout<<"Produi... | true |
35dc91e1178c2cb7757dfc0c2516a6e2f343c58c | C++ | vanbru80/scratch | /codecon/2016Quals/accepted/wrapit.cpp | UTF-8 | 930 | 3.203125 | 3 | [] | no_license | #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <climits>
using namespace std;
void wrapit(string &s, const int len)
{
int start = 0;
int last = -1;
for (int i = 0; i < s.size(); ++i)
{
int nchars = (i-start+1);
if (s[i] == '~')
{
... | true |
75b8ebd4be86eb2a9592f1f57d9da201046d4ca0 | C++ | Bhavyaratra/Hackerrank-practice | /Algorithm/Implementation/Birthday_chocolate.cpp | UTF-8 | 661 | 2.640625 | 3 | [] | no_license | #include <iostream>
#include <vector>
using namespace std;
int main()
{
signed int n,A[100],d,m,sum=0,count=0;
vector<int> v;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>A[i];
}
cin>>d>>m;
for(int k = 0;k<n;k++)
{
for(int i = k ;i<n;i++)
{
for(int j=k,s=0;j<=i;j+... | true |
ec3ed94eed9e6a040e57ed8ab0ab66692d5a4dfc | C++ | lucashuati/maratona | /URI/1063.cpp | UTF-8 | 1,138 | 2.65625 | 3 | [] | no_license | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n,n){
vector<char> ff;
queue <char> fi;
stack <char> p;
for(int i = 0; i < n; i++){
char c,l;
cin >> c;
fi.push(c);
//printf("()%c()",c);
}
for(int i = 0; i < n; i++){
char c;
cin >> c;
//printf("... | true |
aab5c8ff674724d7cea35db55827d08b09d90b79 | C++ | Tavlin/C-_lib_num_int | /main.cpp | UTF-8 | 4,004 | 2.75 | 3 | [] | no_license | #include <math.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "integrals.h"
#include <time.h>
//definition of size_of_list
template <class T, const unsigned int size>
const unsigned int size_of_array(T(&)[size])
{
return size;
}
int main (int argc, char *argv[])
{
printf("I am at the start... | true |
e6192d96a989b9a4178691d3138bc7362f4291d9 | C++ | CodePractice14/008_QtWidgets_Beginners_CPP | /qtwb-08-05_QStackedWidget/dialog.cpp | UTF-8 | 2,015 | 2.546875 | 3 | [] | no_license | #include "dialog.h"
#include "ui_dialog.h"
Dialog::Dialog(QWidget *parent)
: QDialog(parent)
, ui(new Ui::Dialog)
{
ui->setupUi(this);
init();
}
Dialog::~Dialog()
{
delete ui;
}
void Dialog::on_buttonBox_accepted()
{
QMessageBox::information(this,"Hello",ui->txtFirst->text());
accept();... | true |
9d6a04d38f403321a2cbe01b6a5eba96cf5cc700 | C++ | alexandraback/datacollection | /solutions_5640146288377856_0/C++/jibu11/A.cpp | UTF-8 | 448 | 2.6875 | 3 | [] | no_license | #include <stdio.h>
#include <string.h>
int dp[20][20];
int n, c, r;
int calc(int c, int n)
{
if(dp[c][n])
return dp[c][n];
if(c >= n * 2)
return dp[c][n] = calc(c - n, n) + 1;
if(c <= n + 1)
return dp[c][n] = c;
return dp[c][n] = calc(c - 1, n);
}
int main()
{
int k, l;
scanf("%d", &k);
memset(dp, 0, si... | true |
873c6491d8ecbe31a06bf69241ff56de678a52f9 | C++ | mehamasum/competitive-programming | /Data structure/BST/bst_pointer_to_pointer.cpp | UTF-8 | 3,803 | 3.3125 | 3 | [] | no_license | #include <iostream>
#include <cstdlib>
using namespace std;
#define FREOPEN freopen("input.txt","r",stdin);
// NODE DEFINITION
struct bst_node
{
int key;
struct bst_node * left, * right ;
};
typedef struct bst_node node;
// FUNCTION FOR SEARCHING A KEY
bool search(node** root, int num)
{
no... | true |
bb7a765135ba6a1f96ce78c42d56604dc78c7009 | C++ | zlubsen/Nova-platform | /src/actuators/NovaServo.cpp | UTF-8 | 1,485 | 3.109375 | 3 | [] | no_license | #include <Arduino.h>
#include "NovaServo.h"
NovaServo::NovaServo(int pin) : NovaServo(pin, 0, 180) {
}
NovaServo::NovaServo(int pin, int min, int max) {
_pin = pin;
setAllowedRange(min, max);
}
void NovaServo::setAllowedRange(int min, int max) {
_min = min;
_max = max;
}
int NovaServo::getMinimum() {
retu... | true |
a2b523eaa5ad7fff83ef4f16c6e114eb2faa98cc | C++ | foomango/Career | /sort/insertion_sort.cc | UTF-8 | 1,640 | 3.296875 | 3 | [] | no_license | /*
* =====================================================================================
*
* Filename: insertion_sort.cc
*
* Description: insertion sort
*
* Version: 1.0
* Created: 04/10/2013 10:21:56 AM
* Revision: none
* Compiler: g++
*
* Author: WangFen... | true |
b0b96f172a2f93f53278e25e56d607c87a7108a8 | C++ | eriytt/helo | /EventQueue.h | UTF-8 | 2,543 | 3.453125 | 3 | [] | no_license | #ifndef EVENTQUEUE_H
#define EVENTQUEUE_H
#include "Utils.h"
template <typename T>
class EventQueue
{
public:
typedef unsigned int EventID;
public:
class Event
{
public:
virtual void operator()(T actual_time, T event_time, EventID id) const = 0;
virtual void dispose(bool handled) const {delete this;}... | true |
317bee56e3604bec088f9cc7f835072ee9decf5c | C++ | yannjor/tower-defence | /src/gui/gui.cpp | UTF-8 | 569 | 3.03125 | 3 | [] | no_license | #include "gui.hpp"
Gui::Gui() { visible_ = true; }
void Gui::Show() { visible_ = true; }
void Gui::Hide() { visible_ = false; }
void Gui::Add(const std::string& name, GuiEntry entry) {
entries_.insert({name, entry});
}
GuiEntry& Gui::Get(const std::string& name) { return entries_.at(name); }
bool Gui::Has(const s... | true |
9584c92f8cec3defddca74d422d5775461cc1042 | C++ | gyjhl/01-C-HelloWorld | /01 C++书写HelloWorld/4.2.2 do__while循环语句.cpp | GB18030 | 670 | 3.46875 | 3 | [] | no_license | #include<iostream>
#include<string>
#include<ctime>
using namespace std;
/*
int main() {
//, ˮɻָһ3λ, ÿλϵֵ3֮͵
//do whileе3λˮɻ
//1, ȴӡеλ
int num = 100;
do
{
//2, еλҵˮɻ
int a = 0;
int b = 0;
int c = 0;
a = num % 10; //ֵĸλ
b = num / 10 % 10; //ֵʮλ
c = num / 100; //ֵİλ
if(a*a*a+b*b*b+c*c*c==num)
... | true |
f3effaa50d3ceb590d30c6b4d595ee56147222bf | C++ | exatamente/EstruturaDeDados | /ControleDeEstoque/headers/LDDE.h | ISO-8859-1 | 1,141 | 3.265625 | 3 | [] | no_license | #pragma once
#include "IStructure.h"
#include "No.h"
class LDDE
{
private:
No* first;
No* last;
int n;
Stock sentinela;
public:
LDDE();
// Deixe para o fim (deve copiar as listas)
LDDE(const LDDE&);
// Este operador faz a cpia da lista em caso de atribuies
LDDE& operator= (const LDDE& ot... | true |
f010b7dfdaa8eeb75c97d8c2381ee4d64cd4075e | C++ | Windowline/Google-kickstart-2021 | /Round_B/Bike_Tour.cpp | UTF-8 | 566 | 2.765625 | 3 | [] | no_license | #include <iostream>
#include <vector>
#include <stdio.h>
#include <algorithm>
using namespace std;
int N;
int solve(vector<int>& p) {
int ans = 0;
for (int i = 1; i < p.size() - 1; ++i) {
if (p[i] > p[i-1] && p[i] > p[i+1])
++ans;
}
return ans;
}
int main() {
int TC;
scanf(... | true |
9a0c3b05b1f465744d638cb0e1a25e50a9c86348 | C++ | taschetto/computerGraphics | /ElNacho/ElNacho3D/Nacho.h | UTF-8 | 466 | 2.96875 | 3 | [
"MIT"
] | permissive | #pragma once
#include "Maze.h"
#include "Direction.h"
class Nacho
{
private:
Maze* maze;
size_t x;
size_t y;
size_t oldx;
size_t oldy;
float radius;
void SetX(size_t);
void SetY(size_t);
public:
Nacho(Maze*);
virtual ~Nacho();
size_t GetX();
size_t GetY();
size_t GetOldX();
size_t GetO... | true |
09b262ad22ac6de77b09ddf327aff73e32b09ea6 | C++ | asegura4488/Cplusplus | /struct/struct_1/src/struct.cxx | UTF-8 | 435 | 3.28125 | 3 | [] | no_license | /**************************
***Structure in C++, First part
---Ph. D. Alejandro Segura
**************************/
#include <iostream>
#include <vector>
#include <typeinfo>
using namespace std;
int main(){
struct Personaje {
//it's not possible to add initial value
int edad;
double t... | true |
ffbbd73da7218645b17242bda667306dcf553708 | C++ | erikjber/plsomlib | /cpp/plsomlib/neighbourhood/GaussianNeighbourhoodFunction.h | UTF-8 | 1,182 | 3.171875 | 3 | [
"Unlicense"
] | permissive | /**
* Created by Erik Berglund on 2018-04-11.
*/
#ifndef CPP_GAUSSIANNEIGHBOURHOODFUNCTION_H
#define CPP_GAUSSIANNEIGHBOURHOODFUNCTION_H
/**
* Implementation of the NeighbourhoodFunction interface that
* calculates the neighbourhood scaling according to a Gaussian function.
*
* The neighbourhood scaling is defi... | true |
49f797e1089664755fab0368b0ee497d216b7701 | C++ | Ian95Song/DIP-Homework | /06/Network.h | UTF-8 | 5,233 | 2.703125 | 3 | [] | no_license | /**
* Copyright 2019/2020 Andreas Ley
* Written for Digital Image Processing of TU Berlin
* For internal use in the course only
*/
#ifndef NETWORK_H
#define NETWORK_H
#include "Tensor.h"
#include <vector>
#include <memory>
#include <istream>
#include <random>
#include <ostream>
namespace dip6 {
class Parametr... | true |
dc973690bec2b9451d77abc44bcc6471c1aeda36 | C++ | kaba2/pastel | /pastel/math/matrix/random_matrix/random_rotation_matrix.h | UTF-8 | 568 | 2.546875 | 3 | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | // Description: Uniform random rotation matrix
#ifndef PASTELMATH_RANDOM_ROTATION_MATRIX_H
#define PASTELMATH_RANDOM_ROTATION_MATRIX_H
#include "pastel/math/matrix/matrix.h"
#include "pastel/math/matrix/random_matrix/random_orthogonal_matrix.h"
#include "pastel/math/matrix.h"
namespace Pastel
{
//! R... | true |
b9ab6f502f6c0303f3ed4f6a561a4f779866a115 | C++ | namtrungit/BigO | /green/lecture_10/lesson_8/lesson_8.cpp | UTF-8 | 515 | 3.21875 | 3 | [] | no_license | #include<iostream>
using namespace std;
struct Position {
int x;
int y;
int value;
};
int main() {
int n, m, k;
cin >> n >> m;
cin >> k;
Position array[k];
for(int i=0; i<k; i++) {
Position p;
cin >> p.x >> p.y >> p.value;
array[i] = p;
}
int count = 0;
for(int i=0; i<k; i++) {
i... | true |
0b899e4a471aaab8ae1183979168bce80309c65a | C++ | bgonzalo/progcomp | /bgonzalo_prob12455.cpp | UTF-8 | 1,208 | 3.140625 | 3 | [] | no_license | //https://github.com/morris821028/UVa/blob/master/volume124/12455%20-%20Bars.cpp
#include <stdio.h>
int main() {
int t, w, n, i, j, p;//sea t, w, n, i, j, p tipo int
scanf("%d", &t);//asignar elvalor del input a t
while(t--) {//mientras t sea distinto de 0. le resta 1 a t despues de ver si se cumple ... | true |
1a47cc271ed6c8382e34fdaffcfa696a8090f5c7 | C++ | RahulKushwaha/Algorithms | /LeetCode/254. Factor Combinations.cc | UTF-8 | 1,190 | 2.984375 | 3 | [] | no_license | class Solution {
public:
vector<vector<int>> getFactors(int n) {
vector<vector<int>> output;
if(n <= 1)
{
return output;
}
vector<int> factors;
getFactors(2, sqrt(n), n, 1, factors, output);
return output;
}
... | true |
d13b5f7bdbcb737ad43ad8dd75d8e42c9a2fae19 | C++ | florianne1212/CPP_piscine_42 | /Day_08/ex01/span.cpp | UTF-8 | 3,483 | 2.71875 | 3 | [] | no_license | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* span.cpp :+: :+: :+: ... | true |
37cccedf6a8081e6fd9ad004072780ecfe6a5eb3 | C++ | NoPayneNoGame/SFML_GameEngine | /src/player.cpp | UTF-8 | 2,616 | 3.078125 | 3 | [
"MIT"
] | permissive | #include "player.h"
Player::Player() :
m_window(Game::instance()->getWindow())
{
m_fovAngle = 90;
}
Player::Player(sf::RenderWindow& window, const std::string& texture, int moveSpeed, Bullet* bullet) :
m_window(Game::instance()->getWindow())
{
if(!m_texture.loadFromFile(texture))
std::cerr <<... | true |
dd3669e14f064c0a35cc167dc1886c277b236286 | C++ | eientei/Radiorandom | /src/Generic/FileSystem/Create/Create.h | UTF-8 | 472 | 2.53125 | 3 | [] | no_license | #ifndef GENERIC_FILESYSTEM_CREATE
#define GENERIC_FILESYSTEM_CREATE
/// @file
#include <string>
#include <stdio.h>
#include <Generic/Generic.h>
/// Filesystem checks class
class Generic::FileSystem::Create {
private:
std::string filepath; ///< Default path test to
public:
Create() {}
/// Usual constructo... | true |
65ca37d185eb00a25f9ed4cf22e17d6406e2dfb1 | C++ | finch185277/leetcode | /076-100/090.cpp | UTF-8 | 537 | 2.84375 | 3 | [] | no_license | class Solution {
public: // by @yuruofeifei
vector<vector<int>> subsetsWithDup(vector<int> &nums) {
std::sort(nums.begin(), nums.end());
std::vector<std::vector<int>> ret = {{}};
int index = 0, size = 0;
for (int i = 0; i < nums.size(); i++) {
index = i >= 1 && nums.at(i) == nums.at(i - 1) ? siz... | true |
8cdfaa82666c3c587244c83f9754080802c40f5f | C++ | renestadler/AdventOfCode-2020 | /day15.cpp | UTF-8 | 1,071 | 2.984375 | 3 | [] | no_license | #include <regex>
#include <unordered_map>
#include <algorithm>
#include <stack>
#include <map>
#include "day15.h"
using namespace std;
long Day15::part_one(vector<int> input) {
map<int, int> elems;
int lastNum = 0;
for (int i = 0; i < 2020; i++)
{
if (i < input.size()) {
if (i != 0)
elems[lastNum] = i;
... | true |
d4dd972cd9e9084d7eda684dcf91c1aea9afc14c | C++ | Nouser/AnimatronicEarl | /Earl_Arduino_Test.ino | UTF-8 | 2,484 | 3.171875 | 3 | [] | no_license | #include <Servo.h>
Servo leftShoulder;
int lsPos = 25;
Servo rightShoulder;
int rsPos =0;
Servo leftElbow;
int lePos =0;
Servo rightElbow;
int rePos =0;
Servo leftHand;
int lhPos =0;
Servo rightHand;
int rhPos =0;
int ledBasicRed = 9;
int ledBasicGreen = 8;
int ledAdvancedGreen = 10;
int ledAdvancedRed = 11;
boolean ... | true |
d17f5227341d79cf22b7c14b48d162c073672258 | C++ | sebkrueger/ArduinoStairways | /examples/n01_pwm.cpp | UTF-8 | 3,284 | 3.578125 | 4 | [] | no_license | /*
n01_pwm
Use a button on port 2 to trigger LED feade in on 3 Ports (9-11) in a row
The circuit:
LEDs attached from pin 9-11 to ground
pushbutton attached from pin 2 to +5V
10K resistor attached from pin 2 to ground
created 12 December 2015
by Sebastian Krüger
This example code is in the publi... | true |
7951731a85e30411babfa26d7d2dba68381ea041 | C++ | neilforrest/protohaptic | /Rotate.cpp | UTF-8 | 8,955 | 2.640625 | 3 | [] | no_license | // ProtoHaptic
// ===========
// Author: Neil Forrest, 2006
// File: Rotate.cpp
// Classes: CRotate
// Purpose: Represents a rotation transformation
#include "stdafx.h"
#include "ProtoHaptic.h"
#include "Rotate.h"
#include "math.h"
#include <gl/gl.h>
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FI... | true |
9266099a501c53746f95d5ec03126ce0a24c1907 | C++ | dabaopku/project_pku | /Project/C++/POJ/1606/1606.cpp | UTF-8 | 1,031 | 3.078125 | 3 | [] | no_license | #include "iostream"
#include "stdio.h"
using namespace std;
void solve(int a,int b,int n,int &x,int &y)
{
int x1,x2,y1,y2;
y1=-1;
while((n-b*y1)%a) y1--;
x1=(n-b*y1)/a;
x2=-1;
while((n-a*x2)%b) x2--;
y2=(n-a*x2)/b;
if(x1-y1<y2-x2){
x=x1;y=y1;
}
else {
x=x2;y=y2;
}
}
void pour(char fi... | true |
25e31de001875d1a70dc583bede61f5d0a2dae63 | C++ | minicho/TIZEN5- | /basic/src/tabTestFormFactory.cpp | UTF-8 | 2,901 | 2.53125 | 3 | [] | no_license | #include <new>
#include "tabTestFormFactory.h"
#include "AppResourceId.h"
#include "CalendarViewerForm.h"
#include "MainForm.h"
#include "ChatMain.h"
#include "ChatForm.h"
#include "EventListForm.h"
#include "CreateEventForm.h"
#include "EventDetailForm.h"
#include "EditEventForm.h"
#include "SetRecurrenceForm.h"
usin... | true |
f3b1143bfe68c3a05125604bb91fe3e83d00690b | C++ | th0masdw/Pacman_Engine | /Source/Engine/Scenegraph/GameScene.cpp | UTF-8 | 2,114 | 2.6875 | 3 | [] | no_license | #include "MiniginPCH.h"
#include "GameScene.h"
#include "Engine/Components/ColliderComponent.h"
#include "Engine/Managers/PhysicsManager.h"
GameScene::GameScene(const std::string& name)
: m_Name(name)
{
}
GameScene::~GameScene()
{
for (GameObject* pObject : m_pObjects) {
delete pObject;
}
}
void GameScene::Fl... | true |
7d853eebd3380ef6a4c93c6fd50078ebc557f336 | C++ | dmncie/QtSelfTraining | /1/PersonList.cpp | UTF-8 | 1,080 | 3.1875 | 3 | [] | no_license | #include "PersonList.h"
#include <iostream>
PersonList::PersonList():
index{0}
{}
void PersonList::addPerson(Person person) {
person.setId(index++);
people.push_back(person);
emit personAdded(person, people.size());
}
void PersonList::updatePerson(int id, Person person) {
auto it = find_if(begin... | true |
df9affb459502109ae8c876b0bfdd3ebb11b6d9e | C++ | rae/pac | /pacman/Node.h | UTF-8 | 1,651 | 3.09375 | 3 | [] | no_license | //
// Node.hpp
// pathFinder
//
// Created by Reid Ellis on 2017-04-14.
// Copyright © 2017 Tnir Technologies. All rights reserved.
//
#ifndef Node_hpp
#define Node_hpp
#include <list>
struct Node;
struct Map;
class SceneNode;
typedef std::list<Node *> NodeList;
struct Node {
// position of the node
int x;
... | true |
756bcca6f80aefa8725ac26fb3988e296ba3ba7d | C++ | PeterLaptik/OdtCreator | /class/src/OdtImages.cpp | UTF-8 | 3,429 | 2.515625 | 3 | [
"BSD-3-Clause"
] | permissive | #include "../include/OdtCreator.h"
#include"../include/OdtXmlNodes.h"
#include <wx/filefn.h>
// Inserts an image-file into the document
// Inserts nothing if the file does not exist
// @inPath - path to file
// @width - picture width
// @height - picture height
void OdtCreator::InsertPicture (const wxString &inPath, i... | true |
ac9d5f50cdad0c2d91c49467a189ad3594fa3857 | C++ | BarIfrah/Hulda-FinalProject | /src/Music.cpp | UTF-8 | 4,731 | 2.53125 | 3 | [] | no_license | #include <Music.h>
#include <Macros.h>
//-----------------------------------------------------------------------------
Music::Music()
{
loadSounds();
setSounds();
}
//-----------------------------------------------------------------------------
Music& Music::instance()
{
static Music instance;
return instance;
}
... | true |
fa20593be17c0918877063de6364da9633acc6ec | C++ | snow-cube/Luogu_OJ_code | /P1328.cpp | UTF-8 | 667 | 2.78125 | 3 | [] | no_license | #include <iostream>
using namespace std;
int main() {
int a[200] = {0};
int b[200] = {0};
int table[5][5] = {
{0, 0, 1, 1, 0},
{1, 0, 0, 1, 0},
{0, 1, 0, 0, 1},
{0, 0, 1, 0, 1},
{1, 1, 0, 0, 0}
};
int N, Na, Nb;
cin >> N >> Na >> Nb;
for (int i = 0; i < Na; i++) {
cin >> a[i];
... | true |
0374420021a318f6ec291002d11568ba8c3c9be1 | C++ | Ponuyashka7316/CrazyTanks2_ | /CrazyTanks2_/Tank.cpp | UTF-8 | 347 | 2.828125 | 3 | [] | no_license | #include "stdafx.h"
#include "Tank.h"
void Tank::setHealth(int value)
{
if (value >= 0 && value < 1000)
this->health = value;
else
this->health = 1;
}
int Tank::getHealth() const
{
return health;
}
void Tank::decreaseHealth()
{
health--;
}
Tank::Tank()
{
value = '+';
};
Tank::Tank(char ch)
{
value = ... | true |
3eb1f0b6c3e9ff46adf8ae195db9fc59d309a15d | C++ | jyhsia5174/algo | /leetcode/1007.cpp | UTF-8 | 971 | 2.609375 | 3 | [] | no_license | class Solution {
public:
int minDominoRotations(vector<int>& A, vector<int>& B) {
n = A.size();
for(int i = 1; i <= 6; i++){
cnt[i] = 0;
top[i] = 0;
bot[i] = 0;
}
for(int i = 0; i < n; i++){
top[A[i]]++;
bo... | true |
f18fc4278c73e5171f8d23db158d396958b5564d | C++ | pratikmankawde/Graphics | /Fabrik IK/Elements/Joint.h | UTF-8 | 676 | 2.53125 | 3 | [] | no_license | /*
* Joint.h
*
* Created on: 05-Feb-2017
* Author: PprrATeekK
*/
# include "Vec3.h"
#ifndef JOINT_H_
#define JOINT_H_
namespace elements {
class Joint {
private:
Vec3<float> mPosition;
Vec3<float> mApex;
public:
Joint(const Vec3<float> aPosition) {
mPosition = aPosition;
... | true |
688e1a80647be557c7b819968c3b32b8c2ba2989 | C++ | WhiZTiM/coliru | /Archive/09c750ef92adb379e560eeaac4d561f9/main.cpp | UTF-8 | 161 | 2.953125 | 3 | [] | no_license | int x;
constexpr int blah(int n) {
return n == 0? 42 : x++;
}
#include <iostream>
int main() {
blah(0);
blah(1);
blah(2);
std::cout << x;
} | true |
d0f1c006ec14b603b311a79f7ddac84800036de1 | C++ | dennissoftman/ScienceCraft | /shadermanager.cpp | UTF-8 | 4,536 | 2.515625 | 3 | [] | no_license | #include "shadermanager.hpp"
#include <fstream>
#include <cassert>
#include <glm/gtc/type_ptr.hpp>
Shader::Shader()
: Shader("", "", "")
{
}
Shader::Shader(const std::string &v_path, const std::string &f_path, const std::string &g_path)
{
if(v_path.length() == 0 || f_path.length() == 0)
{
fprintf... | true |
5846bf228cd55412d06509b65efb24d40ec60790 | C++ | wlasser/oonline | /OOCommon/OOHashTable.cpp | UTF-8 | 3,546 | 2.59375 | 3 | [] | no_license | /*
This file is part of OblivionOnline Server- An open source game server for the OblivionOnline mod
Copyright (C) 2008 Julian Bangert
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as
published by the Free Software Foundation, ... | true |
f2a787e618d48de169aa35294c33c2365a82d8c6 | C++ | naddu77/ModernCppChallenge | /070_Approval_system/070_Approval_system.cpp | UTF-8 | 1,500 | 3.796875 | 4 | [] | no_license | // 070_Approval_system.cpp : 이 파일에는 'main' 함수가 포함됩니다. 거기서 프로그램 실행이 시작되고 종료됩니다.
// Note
// - Chaining을 간단하게 구현
#include "pch.h"
#include <iostream>
#include <string>
#include <string_view>
struct Expense
{
double amount;
std::string description;
Expense(double const amount, std::string_view desc) :
amount(amoun... | true |
6b688106b27b210c85d5d0f10b1f13f159ae3a41 | C++ | SinisSem/MCSAS-old | /mcsas/mcsas.h | WINDOWS-1251 | 8,500 | 2.671875 | 3 | [] | no_license | #ifndef __mcsas_h__
#define __mcsas_h__
#include <vector>
using namespace std;
#define REAL float
namespace MCSAS
{
/* -------------------------------------------------------------------------------------------------------------------------------*/
// , GPU
struct KernelGPUChain
{
unsigned int Links... | true |
b3417abc85b370e5d06f732ae74e14c53cc91258 | C++ | psr2016/psr | /old/firmware/libs/controllib/pid.cpp | UTF-8 | 2,274 | 2.703125 | 3 | [] | no_license | /*
* pid.cpp
*/
#include "pid.h"
Pid::Pid(float kp, float ki, float kd, float kff, float dt, float saturation)
: m_Kp(kp), m_Ki(ki), m_Kd(kd), m_Kff(kff), m_dt(dt), m_saturation(saturation)
{
m_derivative_low_pass = new LowPassFilter(dt);
reset();
}
Pid::Pid()
: m_Kp(0), m_Ki(0), m_Kd(0), m_Kff(0)... | true |
61668f08b77087e74d1280e8931ecfde09164fb8 | C++ | takjn/KurumiWatch | /KurumiWatch/Common.ino | UTF-8 | 1,333 | 2.671875 | 3 | [
"MIT"
] | permissive |
unsigned char key_read(void) {
if (digitalRead(KEY_SELECT_PIN) == 0) {
digitalWrite(24, LOW);
while (digitalRead(KEY_SELECT_PIN) == 0);
digitalWrite(24, HIGH);
tick_counter = 0;
return KEY_SELECT;
} else if (digitalRead(KEY_PREV_PIN) == 0) {
while (digitalRead(KEY_PREV_PIN) == 0);
tick_... | true |
6425f2244424ba804c570152d0210418e67bf35c | C++ | samiqss/Data-Structures | /csci260/Lab4/mainTile.cpp | UTF-8 | 904 | 3.109375 | 3 | [] | no_license | /**********************************************************/
/***** Lab 3 mainTile ****************************/
/***** CSCI 260 ****************************/
/***** Sept 25 2017 ****************************/
/**********************************************************/
#include "herr... | true |
b8bcd4dd3ee7a09fd602b06365c882252f59ceb1 | C++ | Andrew-Hany/DataStructure_algortihms | /algorithms/practise Problems/Buy_fruits.cpp | UTF-8 | 2,161 | 3.375 | 3 | [] | no_license | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | true |
d64dc006aaef1ef5b527ad56ce6271a3d82454bd | C++ | DcmTruman/my_acm_training | /HDU/2089/18998709_AC_0ms_1208kB.cpp | UTF-8 | 1,446 | 2.96875 | 3 | [] | no_license | #include<stdio.h>
#include<string.h>
using namespace std;
int dp[10][10];
int digit[10];
void init()
{
//十位加个位dp，百位加十位dp，千位加百位dp
dp[0][0]=1;
for(int i=1;i<=7;i++)
{
for(int j=0;j<10;j++)//枚举第i位数上的数字、
{
for(int k=0;k<10;k++)//枚举第i-1位上的数字、
{
if(!(j==... | true |
929be0dd820beceabdc515fc105793f1cfebe1b5 | C++ | raphaellmsousa/cppForProgrammers | /3_print_variables.cpp | UTF-8 | 198 | 2.875 | 3 | [] | no_license | /*
C++ for programers from Udacity
*/
#include <iostream>
using namespace std;
int main()
{
int integer = 384;
cout << "The value of the integer is: " << integer << "\n";
return 0;
}
| true |
761b40dba407604a1cd86bb7f13c695346247c2c | C++ | David-Wong-Cascante/JuniorEngine | /Junior_Core/Src/Include/Space.h | UTF-8 | 1,213 | 2.9375 | 3 | [
"BSD-3-Clause"
] | permissive | #pragma once
/*
* Author: David Wong
* Email: david.wongcascante@digipen.edu
* File name: Space.h
* Description: The class where all levels reside
* Created: 18-Dec-2018
* Last Modified: 19 Apr 2019
*/
#include "GameSystem.h"
namespace Junior
{
// Forward Declarations
class Level;
class Space : public GameSystem
... | true |
dc65a923261c73e86624a3e5a83f3ce3210d10c8 | C++ | EpicDevClub/excel-cpp | /2. Simple Aithmetics/Arithmetic Operations/Arithmetic Operations.cpp | UTF-8 | 704 | 4.28125 | 4 | [] | no_license | //This is a program to demonstrate simple arithmetic operations
#include<iostream>
#include<conio.h>
int main()
{
//declare variables
int a,b;
//ask user to enter two numbers
std::cout << "Enter two numbers" <<std::endl; //endl is used to go to new line
std::cin>>a>>b;
//add two numbers
int ... | true |
beadcf76a422d44d98667ea1956632f2f2aad2db | C++ | 15831944/Fdo_SuperMap | /源代码/Thirdparty/UGC/inc/Algorithm/UGRectUInt.h | GB18030 | 2,175 | 2.59375 | 3 | [
"Apache-2.0"
] | permissive | /*! \file UGRectUInt.h
* \brief 4 byte unsinged int rect
* \author ugc team
* \attention
* Copyright(c) 1996-2004 SuperMap GIS Technologies,Inc.<br>
* All Rights Reserved
* \version $Id: UGRectUInt.h,v 1.2 2007/09/29 06:06:07 guohui Exp $
*/
/*! ˵
* 2007.09.29 guohui ͷļϸע
*/
#ifndef UGRECTUINT_H
#... | true |
8019610441c6b854f7bf9c80b5444f3975e80d45 | C++ | jzwdsb/algorithms | /Areas_on_the_cross_section_diagram.cpp | UTF-8 | 795 | 2.78125 | 3 | [] | no_license | //
// Created by manout on 18-1-16.
//
#include <stack>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
pair<int, vector<int>> Areas_on_the_cross_section_diagram(const string& line)
{
int sum = 0;
vector<int> ans;
stack<int> s1;
stack<pair<int, int>> s2;
for (int i = 0; i < line.le... | true |
492ee8926cc1a38a8274ed7a639e838d65fed9d9 | C++ | anilharish/LCPP | /Chapter1/test9main.cpp | UTF-8 | 285 | 3.234375 | 3 | [] | no_license | #include<iostream>
#include "test9add.h"
int main()
{
int a,b;
std::cout << "Please enter two numbers you wish to add, press enter after each number" << std::endl;
std::cin >> a >> b;
std::cout << "The addition of the two numbers is: " << add(a,b) << std::endl;
return 0;
}
| true |
4cee24fa160ebc934234c7fbe4f4a7f240704c66 | C++ | PanzerKadaver/B4-nibbler | /old/Nibbler3.0/Land.cpp | UTF-8 | 1,616 | 2.703125 | 3 | [] | no_license | //
// Land.cpp for Land in /home/alois/rendu/nibbler/nibbler
//
// Made by alois
// Login <alois@epitech.net>
//
// Started on Tue Mar 18 01:11:32 2014 alois
// Last update Tue Apr 1 20:16:16 2014 Nathan AUBERT
//
//
#include <iostream>
//
#include "Land.hpp"
Land::Land(int size) : width(size), height(size)
{
i... | true |
04d0ec2696c6e098d6f86795b041673f1a26e10c | C++ | DBurrSudz/DataStructuresImplementations | /binarytreePointers.cpp | UTF-8 | 3,324 | 4.28125 | 4 | [] | no_license | #include <iostream>
#include <queue>
template <typename T>
class BTPointers{
private:
struct Node{
T key; //Value inside a node
Node* left; //Pointer to left subtree
Node* right; //Pointer to the right subtree
};
Node* root;
... | true |
f90fd007ac8e455e9a16749066719e66fd425611 | C++ | 20172104255/Cdate0604 | /Cdate0604/Cdate0604.cpp | GB18030 | 1,429 | 3.546875 | 4 | [] | no_license | // Cdate0604.cpp : ̨Ӧóڵ㡣
//
#include "stdafx.h"
#include<iostream>
using namespace std;
class Cdate
{
private:
int year;
int month;
int day;
public:
void init(int y, int m, int d);
void display();
void nextday();
};
void Cdate::init(int y, int m, int d)
{
year = y;
month = m;
day = d;
}
void Cdate::nextday()... | true |
5c1e852b241fefbe0b0433598e3216a6332b61a2 | C++ | HonghuiLi/Playground | /C++1x/src/charpter2-TheBasics/4-Modularity/main.cpp | UTF-8 | 1,755 | 3.609375 | 4 | [] | no_license | // main.cpp
#include <iostream>
#include <stdexcept> // std::out_of_range
#include "Vector.h"
using namespace std;
void modularity() {
Basic::Vector v(3);
cout << v.sqrtSum(3) << "\n";
}
// Exceptions report errors found at run time.
void exceptionFun(Basic::Vector& v) {
try { // exceptions here are handle... | true |
d10dec75a319a5e94e5ea68d7d99e12e7d435991 | C++ | Kreyl/KeyLock | /HackerTool/HackerTool_fw/inc/led.h | UTF-8 | 759 | 2.609375 | 3 | [] | no_license | /*
* led.h
*
* Created on: 03.11.2011
* Author: g.kruglov
*/
#ifndef LED_H_
#define LED_H_
#include "stm32f10x.h"
#include "stm32f10x_gpio.h"
#include "stm32f10x_tim.h"
#include "delay_util.h"
#define LED_BLINK_DELAY 144
class Led_t {
private:
uint32_t Timer;
GPIO_TypeDef* IGPIO;
uint16_t IPi... | true |
857aad6b67167102a34e309b16ff0612b0536078 | C++ | Struti/GrafBead | /Classes/Shader.h | UTF-8 | 918 | 2.59375 | 3 | [] | no_license | #pragma once
#include <string>
#include <iostream>
#include <sstream>
#include <fstream>
#include "GLIncludes.h"
namespace ti
{
enum class ShaderType : unsigned int
{
VERTEX,
FRAGMENT,
TESSCONT,
TESSEV,
GEOMETRY
};
int operator+ (ShaderType val);
class Shader
{
public:
Shader();
~Shader();
... | true |
08c5c6e18c73b94d5e4901163a0d4d325e72a49a | C++ | bilalozcan/OOP | /smart-array/smartArray.h | ISO-8859-9 | 5,151 | 3.265625 | 3 | [] | no_license | /*18120205035
*Bilal ZCAN
*dev9 template class almas */
#pragma once
#include <vector>
#include <iostream>
#include<string>
using namespace std;
template<typename T>
struct Pair
{
T eleman;
unsigned adet;
}; // histogramda her bir elemandan kacar adet oldugunu gosterebilecek veri tipi */
//ndex operatrnde eleman... | true |
d0942aa6dab1e3512e285749d096a17942e597b3 | C++ | nickel8448/cpp | /src/leetcode/graph/reconstrust_itenary.cpp | UTF-8 | 2,058 | 3.515625 | 4 | [] | no_license | /**
* @file reconstrust_itenary.cpp
* @author Rahul Wadhwani
* @brief
* @version 0.1
* @date 2020-06-04
*
* @copyright Copyright (c) 2020
* Apporach: hierholzer's algorithm to construct a eucledian path of the itenary
* Status: Completed
*/
#include <algorithm>
#include <functional>
#include <iostream>
#incl... | true |
be3e61017d93b22b263674ab402c022216f0106a | C++ | BOTSlab/bupimo_src | /homing_algs/old_src/img/drawKeys.cpp | UTF-8 | 1,076 | 2.953125 | 3 | [] | no_license | #include "ImgWindow.h"
#include "ImgOps.h"
#include "SiftExtractor.h"
void drawKeys(string name, vector<Keypoint*> &keys, Img &src,
ImgWindow &window) {
// Create a copy of the input image and draw dots at the locations of
// the keypoints.
Img* drawImg = new Img(src);
window.addImg(name,... | true |
d0f006d1ac91ec44013414a0dfdaba992ae90168 | C++ | autyinjing/Cpp-learning | /C++ Primer plus/2_begin/example/carrots.cpp | UTF-8 | 790 | 2.90625 | 3 | [] | no_license | /*
* =====================================================================================
*
* Filename: carrots.cpp
*
* Description:
*
* Version: 1.0
* Created: 2014年08月20日 10时46分21秒
* Revision: none
* Compiler: gcc
*
* Author: Aut(yinjing), linuxeryinjing... | true |
2b191155d20441004566d957dd7559047c37a5cd | C++ | wspires/Lin-Lab | /Lin Lab/exp_eval/Expression_Evaluator.hpp | UTF-8 | 1,907 | 2.515625 | 3 | [] | no_license | //
// Expression_Evaluator.hpp
// Lin Lab
//
// Created by Wade Spires on 1/22/12.
// Copyright (c) 2012 __MyCompanyName__. All rights reserved.
//
#ifndef EXPRESSION_EVALUATOR_HPP
#define EXPRESSION_EVALUATOR_HPP
#include "All_Functions.hpp"
#include "All_Operators.hpp"
// c++ headers
#include <string>
#includ... | true |
566d9ad5877cbbd34332d51aaae36c5aab47a73a | C++ | katy1819/Bioinformatika | /Bioinform3/Bioinf/Main.cpp | WINDOWS-1251 | 584 | 2.84375 | 3 | [] | no_license | #include <string>
#include <iostream>
using namespace std;
void main()
{
setlocale(LC_ALL, "Russian");
string s1, s2, s3;
int n, g = 0;
cout << " : " << endl;
getline(cin, s1);
n = s1.length();
for (int i = n - 1; i > -1; i--)
{
s2 += s1[i];
}
cout << " : " << s2 << endl;
for (int j = 0; j < n; j++)
{
... | true |
3783eeb7c5e9e295c5243b8c89b4ba2110dac15b | C++ | mrezvani110/ktruss | /Graph.h | UTF-8 | 2,539 | 2.953125 | 3 | [] | no_license |
#ifndef GRAPH_H
#define GRAPH_H
#include "BipartiteTriangleGraph.h"
#include "SimpleTriangleGraph.h"
#include "EvaluationResults.h"
class BipartiteTriangleGraph;
class SimpleTriangleGraph;
/*
struct Key
{
int source;
int destination;
bool operator==(const Key &other) const
{
return ((source... | true |