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 |
|---|---|---|---|---|---|---|---|---|
cc4a69de9cca77f1883c2e0ff69c8fb52557378f | 165f8e14a2000db0885fa871cac23f6c128b8b5a | blackkama/joblab | /d25.cpp | C++ | cpp | 391 | no_license | #include <iostream>
#include <climits>
using namespace std;
int sumAB(int a,int b)
{
int s=0; //иницилизация
s=a+b;
return s;
}
int main()
{
int n,m;
cout<<"Введите n=___ "<<"\b\b\b";
cin>>n;
cout<<"Введите m=___ "<<"\b\b\b";
cin>>m;
cout<<"Получите результат= "<<sumAB(n,m)<<endl;
system(... |
d260c40e4b7a9d3fb0c6e14545b0d70a77bacede | fd25f26a9657722aaf48782260bdec53c9b415f3 | bkahlert/seqan-research | /raw/pmsb13/pmsb13-data-20130530/sources/caivjx2geotu92t0/2013-04-12T09-35-55.973+0200/sandbox/my_sandbox/apps/graph_example/graph_example.cpp | C++ | cpp | 984 | permissive | #include <iostream>
#include <seqan/graph_types.h>
#include <seqan/graph_algorithms.h>
using namespace seqan;
int main() {
typedef unsigned int TCargo;
typedef Graph<Directed<TCargo> > TGraph;
typedef VertexDescriptor<TGraph>::Type TVertexDescriptor;
TGraph g;
TVertexDescriptor vertZero = a... |
b82f72cf84c224b081c6bf2c123d7de005f56347 | fc2e4f2e89a7c07870b6ba5eedacaa37356b3019 | IAmAnubhavSaini/cryptoAlgorithm-nt5src | /Source/XPSP1/NT/printscan/wia/test/bmpinfo/bmpinfodlg.cpp | C++ | cpp | 8,142 | no_license | // BMPInfoDlg.cpp : implementation file
//
#include "stdafx.h"
#include "BMPInfo.h"
#include "BMPInfoDlg.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
/////////////////////////////////////////////////////////////////////////////
// CBMPInfoDlg dialog
CBMPInfoDlg:... |
0e783e65a864d0749cdd9ae626020fa564d4897d | 58f742175fd35e8276beb195bd8db5aa86aef8f0 | UTennessee-JICS/HPC-BLAST | /api/traceback_stage.cpp | C++ | cpp | 16,012 | no_license | // Copyright 2016 UTK JICS AACE
//
// 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 i... |
8c2ba93bcca23b05862ddb81f3ec205cedc24e27 | 5f453564fe9f7af4386ec2f890e499870b45f7a7 | maciejnalewajka/CPP_exercises | /Zestaw_01/Zad 9.cpp | C++ | cpp | 467 | no_license | #include<iostream>
using namespace std;
znaczki(){
int n;
string s="",ss="", wy="";
cout << "Podaj szerokość podstawy: ";
cin >> n;
cout << "Podaj znak: ";
cin >> s;
int o = (int)(n/2);
while(o>=0){
int k = n-(o*2);
for(int j=0;j<k;++j){
ss +=s;
}
for(int j=0;j<o;++j){
wy +=... |
320c3fa80cd2f78e866a5e232447f78beeb8fb2b | d76dde49d6c70bd5173ee7a69b8b0005dedf4dc3 | raven1989/practice | /sortedSequenceToBSTree.cpp | C++ | cpp | 2,768 | no_license | /*************************************************************************
> File Name: sortedSequenceToBSTree.cpp
> Author: ma6174
> Mail: ma6174@163.com
> Created Time: 2014年05月29日 星期四 17时03分43秒
> Description: 1. Given a singly linked list where elements are sorted in ascending order, convert it to a height ... |
d9cef785b309ad4674addbf9df9a6310a490181a | d3f8546907d06c775e25438fab94836dba8a80de | howardchina/ACM-ICPC-solved-problem | /vjudge/UVALive/7234/5079579_AC_3ms_0kB.cpp | C++ | cpp | 621 | no_license | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
const int maxn = 1000011;
int a[maxn];
int main()
{
// freopen("data.in", "r", stdin);
int T;
scanf("%d", &T);
while(T--){
int n; scanf("%d", &n);
for(int i = 1; i <= n; i++){
scanf("%d", &a[i... |
8afbdc04a9193f252fe88b32a305848942b20816 | 43c6bb5639d103fdfebf0cc41db750a45a02dc4b | swapnilghule/DSA-Questions | /Array/5.Move all negative element/NegArrayMove.cpp | C++ | cpp | 523 | no_license | #include<bits/stdc++.h>
using namespace std;
void NegativeMove(int a[],int n)
{
int j=0;
for(int i=0;i<n;i++)
{
if(a[i]<n)
{
if(i!=j)
{
swap(a[i],a[j]);
j++;
}
}
}
}
int main()
{
int t,n;
cin>>t;
w... |
af8068ec4203875c245a11b4eaaad81b6a7d33ed | 5787e9efa2baaf3b4bc2c5f8ca6cd1ea2b4add63 | PixelExperience/frameworks_av | /services/mediametrics/AudioPowerUsage.cpp | C++ | cpp | 23,796 | permissive | /*
* Copyright (C) 2020 The Android Open Source 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 app... |
5fdb799cf46a443057f8a6ee0c8c12ef7467df77 | a8df483065d8d94ac79eed5e32e1839d6441cef1 | alannguyencs/algorithms | /algorithms with C++/zfunction_detail.cpp | C++ | cpp | 4,411 | no_license | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<string> vs;
#define Rep(i,n)... |
8fc66a237cc853f7938f502c5f441d8c6e5dab0c | 7b6557d5bf915b50315c8cd13317c5290eda8efd | yinyongliang/SopCastComponent | /sopcast-sdk/src/main/cpp/lib-native.cpp | C++ | cpp | 765 | permissive | #include "android/log.h"
#include "librtmp/rtmp.h"
#include <jni.h>
#include "string.h"
#define TAG "Rtmp_publish"
#define LOGI(...) __android_log_print(ANDROID_LOG_INFO, TAG, __VA_ARGS__)
#define LOGE(...) __android_log_print(ANDROID_LOG_ERROR, TAG, __VA_ARGS__)
const char* clazz_name = "com/laifeng/sopcastsdk/rtmp/... |
a9595f1c6432bcc5fd68b142bea84687e6f48f72 | 0d472b4b12fa972b38718ae078c283abf47bc894 | codewizardpl/epol_chess | /src/GameLogic.cpp | C++ | cpp | 1,899 | no_license | #include "GameLogic.hpp"
#include "Board.hpp"
#include "Player.hpp"
#include "Figure.hpp"
#include "Move.hpp"
#include <iostream>
void
GameLogic::startGame(Board& board, Player& white, Player& black) {
while (1) {
makeMove(board, white);
makeMove(board, black);
}
}
void GameLogic::makeMove(Board& board, P... |
0c471c399e33967a8ad4ec88eef50dc877d342e4 | 67d00ad003ef2e5c9360e26a9d046f80e993e6ef | AyushKumarJain/UdacityNanoDegreeSensorFusion | /Lidar/Code/SFND_Lidar_Obstacle_Detection/src/quiz/ransac/ransac2d.cpp | C++ | cpp | 5,217 | no_license | /* \author Aaron Brown */
// Quiz on implementing simple RANSAC line fitting
#include "../../render/render.h"
#include <unordered_set>
#include "../../processPointClouds.h"
// using templates for processPointClouds so also include .cpp to help linker
#include "../../processPointClouds.cpp"
pcl::PointCloud<pcl::PointX... |
2596ff9b295bc0e03dd94e2b9f3724585caf584e | 05f0ce11fd358763a681ba96f18e3d8add614fa2 | PhoenixDD/LeetCode | /418-Sentence Screen Fitting.cpp | C++ | cpp | 1,966 | no_license | /*
Calculate when a word repeats at the start of a row, keep storing the number of times (rowTimes) the entire sentence repeats at each row.
Get the number of remaining rows, get the number of rows the word repeats itself.
number times the sentence repeated between last occurence of word and current = rowTimes[currentR... |
a0f15572238dde858f586ad25b8ffe39d75a62f1 | 532d0c756151a1328944fb43fe92f1c425145594 | CarolyneHauck/Estruturas-de-dados | /Exercícios/exemplo2_3.cpp | C++ | cpp | 1,391 | no_license | // Exemplo 2.3
#include <stdio.h>
#include <stdlib.h>
typedef struct lista {
int info;
struct lista* prox;
} Lista;
Lista* lst_cria(void);
Lista* lst_insere(Lista*, int);
void lst_exibe(Lista*);
Lista* lst_retira(Lista*, int);
int main() {
Lista* lst; /* Declara uma lista */
lst = lst_cria();
lst = lst_insere(l... |
dc36597e5f54658b2927960293bd64aa89a2ced9 | 52ba6a143357b272764f8f22ccfc3cf48cfa43c1 | whye/hackerrank | /30 Days of Code Challenges/Day 14: Scope.cpp | C++ | cpp | 1,042 | no_license | //https://www.hackerrank.com/challenges/30-scope
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
class Difference {
private:
vector<int> elements;
public:
int maximumDifference;
// Add your code here
Difference(vector<in... |
1eec6ebc668b3ad2cba61af37854a92b37ccfe74 | fa379a549de475036ae9192a5c4bf22c0a658d92 | anujLeetcode/practice | /wordBreak2.cpp | C++ | cpp | 1,730 | no_license | /*
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences.
Note:
The same word in the dictionary may be reused multiple times in the segmentation.
You may assume t... |
b41403609fe24f6623d8ade7ee9479a19a3555e2 | c3ed140faeb78e1f82ae3184c715f4127162a135 | sakiib/OnlineJudge-Solutions | /LOJ Solutions/loj 1188-2.cpp | C++ | cpp | 1,342 | no_license | #include<bits/stdc++.h>
using namespace std;
int k;
int l=0,r=-1;
int ara[100010];
int cnt[100010],ans=0;
int res[100010];
struct query {
int l,r,id;
}Q[100010];
bool comp(query a,query b) {
int block_a=a.l/k; int block_b=b.l/k;
if(block_a==block_b) return a.r<b.r;
return (block_a<block_b);
}
void ad... |
2f842d309b247e531553ddaccddaa06f933c2bfe | 3c54bf719c759fe6ff7b9a0d14343dbd27390e64 | cpetig/midgard | /gtk_sound/src/sound_gtk.cc | C++ | cc | 538 | no_license | // generated 2001/8/25 19:23:22 CEST by thoma@Tiger.
// using glademm V0.6.2_cvs
//
// newer (non customized) versions of this file go to sound_gtk.cc_new
// This file is for your program, I won't touch it again!
#include <gtk--/main.h>
#include "main_window.hh"
int main(int argc, char **argv)
{
// if (argc!=2... |
c42bd2986eeb54eab34a9c631828702bf626c7ac | 467be447c34ee30357292d16e170bbbb8635ade7 | uel-dataexchange/Opencascade_uel | /inc/Handle_ExprIntrp_StackNodeOfStackOfGeneralRelation.hxx | C++ | hxx | 921 | no_license | // This file is generated by WOK (CPPExt).
// Please do not edit this file; modify original file instead.
// The copyright and license terms as defined for the original file apply to
// this header file considered to be the "object code" form of the original source.
#ifndef _Handle_ExprIntrp_StackNodeOfStackOfGe... |
11e826d3734a4b903d172dafd79c494305f55931 | c40f4448107d9dc698df964b3b5089738158e543 | aliosmanulusoy/Probabilistic-Volumetric-3D-Reconstruction | /contrib/brl/bpro/core/vil_pro/processes/vil_mask_image_using_ids_process.cxx | C++ | cxx | 2,426 | no_license | // This is brl/bpro/core/vil_pro/processes/vil_mask_image_using_ids_process.cxx
#include <iostream>
#include <string>
#include <bprb/bprb_func_process.h>
//:
// \file Mask all ids except the given one in an image using another id image (should be exactly same size)
#include "../vil_math_functors.h"
#include <vil/vil_... |
2b44c517448db1f6c161388084eeae181e3b070d | 6c90c13c35fc6fee96a884470ed23ffd0423cd91 | PengShiqiu/linux_unzip | /src/linux_utils.cpp | C++ | cpp | 4,695 | no_license | #include "linux_utils.h"
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <memory>
#include <vector>
#include <dirent.h>
#include <fcntl.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
extern "C" {
#include "unzip.h"
}
const uint32_t kMaxF... |
65149465c99c34bfd96e09140dbde35dc199153c | 3c673432abb121e658c74707c2d1004bd360ac9e | metaflow/contests | /codeforces/force/760/E.cpp | C++ | cpp | 858 | permissive | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>; using vvi = vector<vi>;
using ii = pair<int,int>; using vii = vector<ii>;
using l = long long; using vl = vector<l>; using vvl = vector<vl>;
using ll = pair<l,l>; using vll = vector<ll>; using vvll = vector<vll>;
using lu = unsigned long long;
usin... |
feb851b5e23fc3a74586eb300712a39a041d0887 | f85dd3b84e88ca77dafff790efdf5272f10ca310 | iridium-browser/iridium-browser | /third_party/tflite/src/tensorflow/core/kernels/data/batch_dataset_op.cc | C++ | cc | 11,980 | permissive | /* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... |
528bc125a5944b23f70a04f85d30a56f1117e1dc | 9923adf5a0f9412fb9dd04b8964a87238befb061 | jatropj/plume-sph | /src/plume/neighs.cc | C++ | cc | 26,993 | no_license | /*
* neighs.cc
*
* Created on: Apr 30, 2015
* Author: zhixuanc
*/
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
using namespace std;
#include <hashtab.h>
#include <thashtab.h>
#include <bucket.h>
#include <particle.h>
#include <particler.h>
#include "constant.h"
#include "sph_... |
45cf812a43d54740f571763cebd34fbc80ac6307 | a8cd8e37ce6ae8f33ee68b644858b5f392fca652 | FoxFurry/UTM-CC-LABS | /lab2/main.cpp | C++ | cpp | 1,678 | no_license | #include <iostream>
#include <chrono>
#include <random>
#include <algorithm>
#include <cstring>
#include "sortings.h"
#define MIN_GEN_SIZE 1000
#define MAX_GEN_SIZE 10000
#define MIN_GEN_VAL 10
#define MAX_GEN_VAL 1000
#define SIZE_DISTRIBUTION std::uniform_int_distribution<int>{MIN_GEN_SIZE, MAX_GEN_SIZE}(mersenne_... |
2a648c2f27495527febe82404d71cc3d57951db2 | f3b6350fd82347cb191695741f55fb6fad709242 | MatheusXimeness/Data-Structure | /trabalho2/MyTesteGame.cpp | C++ | cpp | 1,983 | no_license | //
// Created by okabe2008 on 10/30/20.
//
#include <iostream>
#include "Screen.h"
#include "Snake.h"
#include "Game.h"
using namespace std;
void print(const Screen &s) {
for (int j = 0; j < s.getWidth() + 2; j++) cout << "-";
cout << endl;
for (int i = 0; i < s.getHeight(); i++) {
cout << "|";
... |
7d12c020745145f83b725be272cd95922c6b390d | ff7deea0dedbbaf2f86e889203640b349651072e | BTS-SNIR-1ereAnnee/snake-poo-part2-CampLSNIR | /src/classes/snake.cpp | C++ | cpp | 1,433 | no_license | #include "Point.h"
#include "snake.h"
#include "Board.h"
#include <iostream>
using namespace std ;
snake::snake()
{
for(int x = 0; x < longeur; x++)
{
serpent[x].setPoint(0,x);
}
}
snake::snake(int x,int y)
{
for(int d = 0; d < longeur; d++)
{
serpent[d].setPoint(x,d+y);
}
}... |
77b51290ed617416b81ab49d2896cbde6b8ab928 | 0cfc191f33bee3534d526b9ac185ef9ee169411d | jamescookmd/cquery | /src/position.cc | C++ | cc | 3,692 | permissive | #include "position.h"
namespace {
// Skips until the character immediately following |skip_after|.
const char* SkipAfter(const char* input, char skip_after) {
while (*input && *input != skip_after)
++input;
++input;
return input;
}
} // namespace
Position::Position() {}
Position::Position(int16_t line, in... |
907d6f1432050bc5b1a43e5834d41c817973be59 | c7012b970caab848cfcf37a83a3ad25d041fb819 | honggosanjaya/honggosanjaya | /ProjectAkhir Bahasa C++/CountingGames.cpp | C++ | cpp | 8,164 | no_license | #include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include <string.h>
#include <conio.h>
#include <time.h>
#include <stdlib.h>
#include <fstream>
#include <cctype>
int counter=0;
using namespace std;
void clrscr(){
system("@cls||clear");fflush(stdin);
}
class hitung{
friend void set_nama(h... |
3b3ba7f6659eccd71b00a900005108823e94c50a | a28c9bc9c5267eb6fd44e4fc88beec57ca7c9f1a | cp-shen/my_tiny_renderer | /src/Color.cpp | C++ | cpp | 1,122 | permissive | #include <algorithm>
#include <my_tiny_renderer/Color.hpp>
Color::Color() : _value(0.f)
{ }
Color::Color(glm::vec3 rgb) : Color()
{
Set(rgb);
}
glm::vec3 Color::Value() const
{
return _value;
}
png::rgb_pixel Color::Pixel() const
{
return png::rgb_pixel(_value.r * 255, _value.g * 255, _value.b * 255);
}... |
2c72d95773ef2cdde9ea4f96bd6b4d1e2103487c | 63f567458da42234d9d6a0a21d013ced55b63780 | niuxu18/logTracker-old | /second/download/curl/gumtree/curl_new_hunk_828.cpp | C++ | cpp | 81,286 | no_license | " used. This is because undoing a GET doesn't make sense, but you\n"
" should then instead enforce the alternative method you prefer.\n"
"\n"
" -H, --header <header>\n"
, stdout);
fputs(
" (HTTP) Extra header to include in the request when sending HTTP\n"
" t... |
ef9b1ae102399c479670213bcff4297b64f029da | 6bb6fa82f377b4eccacf3f3c9d41e3daecf42cf8 | ImageGuidedTherapyLab/ExLib | /staple/crkit_build/crkit/release-1.5.2/tools/code/crlExtractROI.cxx | C++ | cxx | 2,202 | no_license |
/* Facilitate the selection of a region of interest from the data. */
#include "itkImageFileWriter.h"
#include "itkImageFileReader.h"
#include "itkRegionOfInterestImageFilter.h"
#include "itkImage.h"
int main( int argc, char ** argv )
{
// Verify the number of parameters in the command line
if( argc != 9 )
{... |
9378c2f1fa7f17485f1ea1b34423799bbdd84c37 | 29514aca42e93d7eda706887e55d5c6150c4f423 | axelxod/braincoin | /src/qt/optionsmodel.cpp | C++ | cpp | 14,444 | permissive | // Copyright (c) 2011-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Brain developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#if defined(HAVE_CONFIG_H)
#include "config/brain-config.h"
#endif
#include "... |
1f30123264a040d9dc1591c88dcb85d8515a1b75 | 81791763b0f5ccdc0c1dd45723a384e024fc64f1 | repitah/SmarterFridge | /Software/Thermometer/Thermistor_attempt2.cpp | C++ | cpp | 2,921 | no_license | #include <avr/sleep.h>
#include <avr/power.h>
#include <avr/wdt.h>
volatile int f_wdt=1;
boolean led_state=false;
word Analog0 = 0; // first analog sensor
short temp = 0; // second analog sensor
/*
Thermistor Specifications:
T0 = 25^C
R0 = 1000 ohm
K = 3700
Voltage divider Specifications:
Vin = 5V
|
R = 10k... |
fad8f3be23af6fc22db9d7a3f9978355c26e094f | daddbdafb269fc33d4364652367cf711ccdae7fb | liqiushui/leetcode | /cplusplus/leetcode_solution/leetcode_solution/S63.hpp | C++ | hpp | 733 | no_license | //
// S63.hpp
// leetcode_solution
//
// Created by lunli on 2018/12/13.
// Copyright © 2018年 lunli. All rights reserved.
//
#ifndef S63_hpp
#define S63_hpp
#include "public.hpp"
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
class Solution63 {
public:
int uniquePathsWithObstacl... |
59210abe82e133d260cf1823c7629c9a58fcf9a7 | 81be57518d41bca81ba93f97bde83cbebc5e2158 | Dyna-CoRE/dart | /dart/dynamics/FreeJoint.hpp | C++ | hpp | 13,233 | permissive | /*
* Copyright (c) 2011-2017, The DART development contributors
* All rights reserved.
*
* The list of contributors can be found at:
* https://github.com/dartsim/dart/blob/master/LICENSE
*
* This file is provided under the following "BSD-style" License:
* Redistribution and use in source and binary forms, w... |
a45e873b8ac2da1625a0cd1aa74e77c1378a351d | 0a0abade337301f93eaa02fdcfb8d6755830533e | libpronet/libpronet | /src/pronet/rtp_msg_server/msg_db.cpp | C++ | cpp | 6,282 | permissive | /*
* Copyright (C) 2018-2019 Eric Tung <libpronet@gmail.com>
*
* 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 app... |
fe16d574e603bce6a95e789f2c3243bbce555c6f | 83c2c224f4d5c8dfa9000345be4292925df2f8ee | Francisco-Ibarra07/FusionAD | /src/modules/control/src/lat_controller.cpp | C++ | cpp | 11,820 | permissive | #include "control/lat_controller.h"
namespace fusionad{
namespace control{
namespace lat_controller{
stanley::stanley()
{
}
stanley::~stanley()
{
}
float stanley::computeHeadingError(const float &vehHeading, const float &pathHeading)
{
//Follows the convention of left turn is positive
float ... |
1106ceaa0c2a8d6a647874811a281c0a48a6e0f9 | 05c7c8512d4d491f3c1ee6179f7163fd19648b1c | adityanjr/code-DS-ALGO | /Olympiad Solutions/DMOJ/dmpg17s1.cpp | C++ | cpp | 407 | permissive | // Ivan Carvalho
// Solution to https://dmoj.ca/problem/dmpg17s1
#include <iostream>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> E(N);
for(int i=0;i<N;i++) cin >> E[i];
sort(E.begin(),E.end());
int resp = abs(E[1] - E[0]);
for(int i=2;i<... |
062fe169b23459687c22ed94261f4f38880557b6 | cc023341e4568bfcd83baf8b38ba945d1e5270b0 | fsy-juruo/noip2020-JS-Answers | /answers/JS-0445/string/string.cpp | C++ | cpp | 1,123 | no_license | #include<bits/stdc++.h>
using namespace std;
char ch[1048580];
int len;
int numf[1048580],numb[1048580];
void init(){
int times[1026];
memset(times,0,sizeof(times));
for(int i=1;i<=len;i++){
times[ch[i]]++;
if(times[ch[i]]%2)
numf[i]=numf[i-1]-1;
else
numf[i]=numf[i-1]+1;
}
for(int i=len;i>=1;i--){
t... |
f1fb51f0d086485f31f245ac113f7bb463989f8c | f90217c6cc9a2ad82b5616ca991d15291912f627 | RajaKunalPandit1/HACKEREARTH-HACKERRANK-QUESTIONS | /Tree: Preorder Traversal.cpp | C++ | cpp | 522 | no_license | Output Status:
Compiler Message
Success
/* you only have to complete the function given below.
Node is defined as
class Node {
public:
int data;
Node *left;
Node *right;
Node(int d) {
data = d;
left = NULL;
right = NULL;
}
};
*/
... |
48c4cd8449f5c956dccfd214921fec0e7a2ac87a | 4e9419b035521973d4708d293fd73cf8ee4ee0e2 | Allamrahul/CPP_Udemy | /Classes_Objects/oops.cpp | C++ | cpp | 3,729 | no_license | #include <iostream>
#include<vector>
#include<string>
#include <cctype>
#include <cstring> // for c style string functions
#include <cstdlib> // for character based functions
#include <cmath>
#include <stack>
using std::string;
using std::vector;
using std::cout;
using std::cin;
using std::endl;
class Player {
pr... |
a90f0ef3701f699184c0f18242c6b97e4cd23ad4 | 21ee88a46fe7be5b0fcd621110dec38a1972e0e1 | vespa-engine/vespa | /searchlib/src/tests/tensor/hnsw_saver/hnsw_save_load_test.cpp | C++ | cpp | 6,470 | permissive | // Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/searchlib/tensor/hnsw_graph.h>
#include <vespa/searchlib/tensor/hnsw_identity_mapping.h>
#include <vespa/searchlib/tensor/hnsw_index_saver.h>
#include <vespa/searchlib/tensor/hnsw_index_loader.hpp>
... |
760f3158e2bf9150095264d12ffb7c354230aa2c | b4786d0c36792e58d22d80faca035bee801a81a4 | sbxlmdsl/librime | /src/rime/dict/vocabulary.cc | C++ | cc | 2,983 | permissive | //
// Copyright RIME Developers
// Distributed under the BSD License
//
// 2011-07-24 GONG Chen <chen.sst@gmail.com>
//
#include <algorithm>
#include <sstream>
#include <utility>
#include <rime/dict/vocabulary.h>
namespace rime {
bool Code::operator< (const Code& other) const {
if (size() != other.size())
retur... |
0e6a984f90c29ebd8f991f5054f62bbaf656c01c | 448ce619d53f28b915338dca5b8717b3ceffb208 | Creeper20428/Data | /VMachine/VMachine/VMachine_UpdatePartPageInvalidations.cpp | C++ | cpp | 656 | no_license | // VMachine
// Update the partPageInvalidations array
//
// Copyright (c) 2006, Paul Baker
// Distributed under the New BSD Licence. (See accompanying file License.txt or copy at
// http://www.paulsprojects.net/NewBSDLicense.txt)
#include "Root.h"
#include "VMachine.h"
void VMachine::UpdatePartPageInvalidations(void)... |
e44f2dfdfa5f6940c19551098cffd490d30b6aba | b37ebcf785b9459a8ec92b549954e7adf5c71294 | karunmatharu/Android-4.4-Pay-by-Data | /art/runtime/entrypoints/portable/portable_dexcache_entrypoints.cc | C++ | cc | 2,456 | permissive | /*
* Copyright (C) 2012 The Android Open Source 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 app... |
389b0407846d292e1337544289fe04071f68d8c5 | bb909f4aa99f24bae15a04b9bae22cdd99b87b03 | roxlu/filament | /third_party/spirv-tools/source/opt/local_single_block_elim_pass.cpp | C++ | cpp | 9,097 | permissive | // Copyright (c) 2017 The Khronos Group Inc.
// Copyright (c) 2017 Valve Corporation
// Copyright (c) 2017 LunarG 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... |
0baacbe1ddcf0b2999b369b53ec0b6302c4469e3 | 2c8b937d00fc436f8631c2e68285e27819a5e134 | ErickLin/competitive-programming | /TopCoder/just_brackets_old_2.cpp | C++ | cpp | 1,273 | no_license | #include <iostream>
#include <stack>
#include <vector>
using namespace std;
#define forf(i, n) for (int i = 0; i < n; i++)
#define forb(i, n) for (int i = n - 1; i >= 0; i--)
typedef vector<int> vi;
class JustBrackets {
public:
struct letter {
char c;
int imbalance;
int max_ahead_imbalance;
};
... |
932aadc0be04e4f4c670136aadf8bca47e0ddde7 | 37138f529d36aab2c3818dd52fdc1d00e0db4c3e | ajsewell/Final-Project | /Test.cpp | C++ | cpp | 8,487 | no_license | // Project Name: Final Project
// Name: Allysa Sewell
// Date: 6/9/18
// Class: CS 172
#include <iostream>
#include <iomanip>
#include <fstream>
#include "Ecosystem.h"
#include "Species.h"
#include "IndependentSpecies.h"
#include "PredatorPrey.h"
using namespace std;
//displays the genetic makeup of a p... |
036550513adf4eaf42aa85c58a767db3433d0672 | 397eb71269b9c73d386b4f91a84173d8fc40400f | VestasWey/mysite | /lcpfw/net/third_party/quiche/src/quic/core/quic_stream_id_manager.cc | C++ | cc | 9,733 | permissive | // Copyright (c) 2018 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 "quic/core/quic_stream_id_manager.h"
#include <cstdint>
#include <string>
#include "absl/strings/str_cat.h"
#include "quic/core/quic_connect... |
37c2c56d3adf949d831028e51273c27960ec8bff | 8e4257e1884bbe0cff2369327052ae1ded1d9925 | sachingoel0101/sampling-k-means | /Serial_heuristic.cpp | C++ | cpp | 2,372 | no_license | #include <bits/stdc++.h>
#include "Heuristic.h"
using namespace std;
// this is the first step we do on the multiset. Perform a kmeans++ on it. The heuristic function is actually mean_d2_on_sample
vector<Point> Heuristic::d2_on_sample (vector<Point> &sampled_set, int k) {
// here, we have a memory resource, namel... |
de1dde344518e3e5a410c77b7f376a029f733e90 | 9cff18fc5bf01c6b1899323aa7994375783d09e9 | hackerwin7/uva_acm | /KakutaniConjecture_hdu_1279.cpp | C++ | cpp | 653 | no_license | #include<stdio.h>
int N=0;
int num=0;
int main()
{
while(scanf("%d",&N)!=EOF)
{
while(N--)
{
scanf("%d",&num);
int print_num=0;
while(num>1)
{
if(num%2==1) {printf("%d",num);print_num++;num = num * 3 + 1;break;}
else... |
d4d5528e377d658867e9fa16199cdcecb7a116a1 | 2abd886d14225a735e63a2e8af843a6d629ddddd | niloo9876/PIM-ORC | /orc-parser/reader.cc | C++ | cc | 4,499 | no_license | #include "orc/OrcFile.hh"
#include "orc/ColumnPrinter.hh"
#include "orc/Statistics.hh"
#include "pim-snappy/pim_snappy.h"
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <unistd.h>
#include <pthread.h>
#include <iostream>
#define MIN(X, Y) ((X) < (Y) ? (X) : (Y))
using namespace orc;
struct thr... |
9faae866d2e27072c4a05217adc747fd5605015e | 9d723e73de86af74285c8160001f906da23312ea | wangyx/coolfluid3 | /test/UI/Graphics/GraphicalUintTest.cpp | C++ | cpp | 5,959 | no_license | // Copyright (C) 2010-2011 von Karman Institute for Fluid Dynamics, Belgium
//
// This software is distributed under the terms of the
// GNU Lesser General Public License version 3 (LGPLv3).
// See doc/lgpl.txt and doc/gpl.txt for the license text.
#include <QDoubleSpinBox>
#include <QHBoxLayout>
#include <QtTest>
#... |
8002e1c1303772dd708b05f9219d7c9cd05536f9 | 51b5d0187e5242ef97dbc9c681e8efb85d4c3cc4 | kawanon868/verification_color_sensor | /src/Clock.cpp | C++ | cpp | 846 | no_license | //
// Clock.cpp
//
// Copyright (c) 2015-2016 Embedded Technology Software Design Robot Contest
//
#include "./../include/Clock.h"
using namespace ev3api;
//=============================================================================
// Constructor
Clock::Clock(void)
:mStartClock(getTim())
{}
//===================... |
9101fdb0eb595666f1f83344af7d357e4de971fc | 12af6549f5ad0bbdd01c0c2ccf9258a57e2f2720 | sawjlab/HallCEpics | /apps/vmec8App/src/vmec8Main.cpp | C++ | cpp | 405 | no_license | /* vmec8Main.cpp */
/* Author: Marty Kraimer Date: 17MAR2000 */
#include <stddef.h>
#include <stdlib.h>
#include <stddef.h>
#include <string.h>
#include <stdio.h>
#include "epicsExit.h"
#include "epicsThread.h"
#include "iocsh.h"
int main(int argc,char *argv[])
{
if(argc>=2) {
iocsh(argv[1]);
... |
81fd7e86cf7d21528c7153d2e65770498eeefbb9 | 8529c88b3975bdc771c2b4e4c3e4a3996a6e2aaa | DOGEBC/DOGEBC_DOGEBLACKCOIN | /src/qt/addressbookpage.cpp | C++ | cpp | 12,509 | permissive | #include "addressbookpage.h"
#include "ui_addressbookpage.h"
#include "addresstablemodel.h"
#include "optionsmodel.h"
#include "bitcoingui.h"
#include "editaddressdialog.h"
#include "csvmodelwriter.h"
#include "guiutil.h"
#ifdef USE_QRCODE
#include "qrcodedialog.h"
#endif
#include <QSortFilterProxyModel>
#include <Q... |
3065dfea9c5247526249a27e9074ddbaf24ed23b | 6239ed9a0997da0350e6967c9218a4154b1eda44 | mendola/drosynth | /include/vca.hpp | C++ | hpp | 234 | no_license | #pragma once
class VCA {
public:
void SetGainIn(const float gain);
void SetVolume(const float volume);
void OperateOnSignal(float** out, unsigned int num_samples);
private:
float gain_ = 0;
float volume_ = 1.0;
}; |
36f74552a311fd3c0b3fe30ca616894a9ab95cae | 856774a234e1a8a9b5d0b2c837f05fb3b64ff24c | alod83/IS-MOOS | /Thirdparty/newmat/myexcept.cpp | C++ | cpp | 13,233 | no_license | //$$myexcept.cpp Exception handler
// Copyright (C) 1993,4,6: R B Davies
#define WANT_STREAM // include.h will get stream fns
#define WANT_STRING
#include "include.h" // include standard files
#include "boolean.h"
#include "myexcept.h" /... |
59e00146f89f80b5bbec38a3912d160d234f6382 | 85217fe8002717fbaa1b6b2f17a3edfdbf2df9ad | MengjiaoH/VolumeRendering | /src/loadTexture3D.cpp | C++ | cpp | 1,354 | no_license | #include "loadTexture3D.h"
GLuint loadTexture3D(Data data){
std::cout << std::endl;
int maxDepth = data.depth;
std::cout << " ========== Load Volume As 3D Texture ========== " << std::endl;
std::cout << " Data Depth is: " << maxDepth << std::endl;
char* data_ptr = (char*) data.raw_data_ptr;
i... |
e51c1d3d31236e5d0d389de07a327a4155b140a9 | 4b06272b3eabeaff1e367d25a331afa9da2beca3 | pocokb/automatas-feladat-generalo | /program/Forma/Forma/Tests.cpp | C++ | cpp | 16,841 | no_license | #include "stdafx.h"
#include "Tests.h"
#include "DFA.h"
#include "NFA.h"
#include<iostream>
#include"conversions.h"
#include"CFGenerator.h"
#include"DFABuilder.h"
using namespace std;
void Tests::DFACounter() {
cout << "Test counter" << endl;
for (size_t i = 0; i < 5; i++) {
auto arr = dfabuilder::counter();
... |
a69be30a07463d7983784a3383ed0eeb8c6b9e42 | c1c5bcd0557a398e2c758484c483ea1a56cc455a | abadiag/Textfy | /TextfyLib/templates_factory.cpp | C++ | cpp | 1,645 | no_license | #include "pch.h"
#include "templates_factory.h"
#include <codecvt>
#include <fcntl.h>
#include <io.h>
void templates_factory::process_documents()
{
ifstream fin;
for (temp_factory_tupple* temp : f_templates_tupple)
{
fin.open(temp->path_temp, ios::in);
#pragma warning(suppress : 4996)
std::wbuffer_convert<std::... |
aa3bea440b06b494ddd5e5a92c7d8c6497677e55 | fecaa7ac3d3bae79821e968b53650459cff069cb | pointspy/omim | /generator/regions/country_specifier.cpp | C++ | cpp | 3,545 | permissive | #include "generator/regions/country_specifier.hpp"
namespace generator
{
namespace regions
{
void CountrySpecifier::AdjustRegionsLevel(Node::PtrList & outers)
{ }
PlaceLevel CountrySpecifier::GetLevel(Region const & region) const
{
auto const placeType = region.GetPlaceType();
auto const placeLevel = GetLevel(pla... |
ba1ca260a2c4af30b6dfeb75f0d91960b619a9ef | 2005009049cfda2b3f6e3b1286019d52d2f173d2 | ryanToth/Blackberry-Z10-Pokedex-App-SE2250-Final-Project | /x86/o-g/.moc/moc_pokemonlist.cpp | C++ | cpp | 2,478 | no_license | /****************************************************************************
** Meta object code from reading C++ file 'pokemonlist.h'
**
** Created by: The Qt Meta Object Compiler version 63 (Qt 4.8.5)
**
** WARNING! All changes made in this file will be lost!
*********************************************************... |
ed2d29da04b388537497dbea70331cf87b462b42 | e480568fc369a50f875a76775eeb141b3313a7f1 | patanjalic/patanjali-java-world | /cppworld/algos/weakPointerDemo.cpp | C++ | cpp | 472 | no_license | /*
* weakPointerDemo.cpp
*
* Created on: Mar 8, 2015
* Author: Admin
*/
#include <iostream>
#include <memory>
std::weak_ptr<int> gw;
void f()
{
if (auto spt = gw.lock()) { // Has to be copied into a shared_ptr before usage
std::cout << *spt << "\n";
}
else {
std::cout << "gw is expired... |
53d1c2f1aa417e92f13df4afe31b689dd06103c6 | a4cfd3e9ae42229f5e572f328eae52bb96c52ac9 | buzztiaan/dobbscoin-source | /src/init.cpp | C++ | cpp | 42,851 | permissive | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "txdb.h"
#include "walletdb.h"
#include "bitcoinrpc.h"
#include "net.h"
#... |
6407be45b41ef48cf4f2f30e5ff501f0a0e1fbfa | 213fe4da2cf003976ed72c6f49bdb8031365ae9a | ginagerace/RicohetRobots | /ggerac3Prog5.cpp | C++ | cpp | 25,151 | no_license | /* ------------------------------------------------
ggerac3Prog5.cpp
Program #5: Ricochet Robots: Allow solving the sliding robots puzzle
Class: CS 141
Author: Gina Gerace
Lab: Tues 11am
System: C++ Windows Dev-C++
Grading Rubric:
55 Execution points
2 Displays header in... |
e5c32d502ead4efba81b44742bddce9ad6b951e3 | efb0a175dbc48ffe055578387751227be063d382 | mohamedelraghy/Problem-Solving | /UVA/5.Mathematics/Number Theory/406 - Prime Cuts.cpp | C++ | cpp | 1,391 | no_license | #include <bits/stdc++.h>
using namespace std;
#define P(x) cout << #x << " = { " << x << " }\n"
#define INF 1000000000
// shortcuts for "common" data types in contests
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
// common memset setting
// memse... |
afd8b360a6cc211025296b9716d2379178138e6b | 938cf3e15cc8fb1992ea4b6308e8819efb238350 | athiselvam/or-tools | /examples/cpp/jobshop.cc | C++ | cc | 7,630 | permissive | // Copyright 2010-2017 Google
// 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 wri... |
8a258c9bf1ebc3eb51ae893b04f860c654c14695 | a2fe2abb83dc0d5b7f2f3f9ac689c3c5118099df | zeroam/TIL | /cpp_tutorial/cpp_prime_plus/ch13/dma/usedma.cpp | C++ | cpp | 667 | permissive | // usedma.cpp -- 상속, 프렌드, 동적 메모리 대입
#include <iostream>
#include "dma.h"
int main()
{
using std::cout;
using std::endl;
baseDMA shirt("Portabelly", 8);
lacksDMA balloon("red", "Blimpo", 4);
hasDMA map("Mercator", "Buffalo Keys", 5);
cout << "baseDMA 객체를 출력한다:\n";
cout << shirt << endl;
cout << "lacksDMA 객체를 ... |
fecb4906c511007b3cb8b6590fb61793b4b6c6ea | 31b8f0f0ed9a093be518832369eff900eb2fb87d | MrTwinkleSharma/cpp_Program | /selection.cpp | C++ | cpp | 748 | no_license | #include<stdio.h>
#include<conio.h>
int minimum(int arr[],int k,int n);
int main(){
int n,i;
printf("Enter the number of elemensts in an array\n");
scanf("%d",&n);
int arr[n];
printf("enter elemnts of array\n");
for(i=0;i<n;i++){
scanf("%d",&arr[i]);
}
int temp=0,ref=0;
for(i=0;i<n-1;i++){
ref = minimum(... |
c0d08f5de0c6fb3fb4d6dbe1e1c67dffde44316b | 132ebcfb32b740ff0000c157b2cafa35b57d50dd | mutual-ai/CMake | /Source/CPack/cmCPackCygwinSourceGenerator.cxx | C++ | cxx | 6,000 | permissive | /*============================================================================
CMake - Cross Platform Makefile Generator
Copyright 2000-2009 Kitware, Inc., Insight Software Consortium
Distributed under the OSI-approved BSD License (the "License");
see accompanying file Copyright.txt for details.
This softwa... |
7c04d1885b73c59686b0311b6c6ff7936871f9a4 | a3de898e1918bdc6d48e1bcca755ac183460ea77 | JaikrishnaNemallapudi/nn-hal | /Intel_movidius_nn_hal/graph_compiler_NCS/stage_softmax.cpp | C++ | cpp | 4,818 | permissive | /*
* Copyright (c) 2018 Intel Corporation
*
* 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... |
37aba169698977d975c455c01f14a4ae3b663c06 | 50370d6dcfd6eae6a53fd7d3c88b8eaf4a476e33 | thatmooglie/epilepsy-detection | /java/app/src/main/cpp/sortIdx.cpp | C++ | cpp | 9,585 | permissive | /*
* Academic License - for use in teaching, academic research, and meeting
* course requirements at degree granting institutions only. Not for
* government, commercial, or other organizational use.
*
* sortIdx.cpp
*
* Code generation for function 'sortIdx'
*
*/
/* Include files */
#include "rt_nonfinite.h"
... |
a956b973ff951e191dc5dad7bd21f418a794b228 | 6edc2896289306cf149abe1f7748fe86451e975c | laferenorg/CppGame | /src/Bullet.cpp | C++ | cpp | 1,172 | permissive | /* C++ */
#include <iostream>
#include <string>
/* SDL2 */
#include <SDL2/SDL.h>
#include <SDL2/SDL_image.h>
/* Header */
#include <header/Load.hpp>
#include <header/Settings.hpp>
#include <header/Bullet.hpp>
#include <header/Soldier.hpp>
extern Soldier* player;
extern std::vector<Soldier*> enemy_group;
Bullet::Bul... |
b1b5a355a87db53888cff17ade84a6574b665ec5 | e96d6fb378d2a73829507e48bcad4302de65ba3a | fwzhuangCg/face-reconstruction-from-one-frontal-image | /src/parameter.cpp | C++ | cpp | 25,179 | no_license | #include "Parameter.h"
#include "mesh.h"
#include "input_image.h"
#include "model_image.h"
#include "face3d_shape.h"
#include "face3d_texture.h"
#include "illumination_parameter.h"
#include "common.h"
#include "opengl_common.h"
#include "common_function.h"
#include <opencv2/opencv.hpp>
using namespace cv... |
6a52bbd0264341ad8244d8edb2babcffb0fd73e9 | b9650c7ed534c595e260e3458cbd3b0a2d63365f | chen-huicheng/cpp-coder | /interview/zhongxing/2.cpp | C++ | cpp | 1,003 | no_license | // #include<bits/stdc++.h>
// using namespace std;
// long long mergenprops(vector<int> &a){
// int n=a.size();
// vector<vector<long long>> dp1(n,vector<long long>(n));
// vector<vector<long long>> dp2(n,vector<long long>(n));
// for(int i=2;i<n;i++){
// for(int j=0;j<n-i;j++){
// f... |
437520011e7e4d1f3c049ecef9c76f774607abcf | 7a19fba841b48f26c3dcee2bacb92f5405950653 | stanleysilvadasan/odeint-v2 | /boost/numeric/odeint/stepper/base/explicit_error_stepper_fsal_base.hpp | C++ | hpp | 10,984 | no_license | /*
[auto_generated]
boost/numeric/odeint/stepper/base/explicit_error_stepper_fsal_base.hpp
[begin_description]
Base class for all explicit first-same-as-last Runge Kutta steppers.
[end_description]
Copyright 2009-2011 Karsten Ahnert
Copyright 2009-2011 Mario Mulansky
Distributed under the Boost Software Lice... |
792a3b9ad2604d5d7e3b17fa65ba106c8584d7e1 | bdf12f94a08e3fde71cf305ddafe817b6edbd694 | cleancoindev/The-Legend-of-Zelda-Hyrule-Conquest | /Project/Dev_class11_handout/Motor2D/S_InGameMenu.cpp | C++ | cpp | 5,379 | permissive | #include "j1App.h"
#include "j1Render.h"
#include "S_InGameMenu.h"
#include "j1Player.h"
#include "j1Window.h"
#include "j1Camera.h"
#include "j1HUD.h"
#include "j1Pathfinding.h"
#include "Gui.h"
#include "GuiButton.h"
#include "j1GameStartMenuBack.h"
#include "j1Audio.h"
#include "ParticleManager.h"
S_InGameMenu::S_I... |
a7cd357478532c1ab185723e7d4c0a5edd82de0c | 925828d3ea9e9fa086a4391753d459e1170729e6 | myworldgithub/Gold-block-chain | /src/qt/sendcoinsentry.cpp | C++ | cpp | 4,175 | permissive | #include "sendcoinsentry.h"
#include "ui_sendcoinsentry.h"
#include "guiutil.h"
#include "bitcoinunits.h"
#include "addressbookpage.h"
#include "walletmodel.h"
#include "optionsmodel.h"
#include "addresstablemodel.h"
#include <QApplication>
#include <QClipboard>
SendCoinsEntry::SendCoinsEntry(QWidget *parent) :
Q... |
b01003bc2c8a63785d4d48afe6378d568b3718a6 | 7bc7ef3dbcb575ee2728a9c894b159da3cae5ac2 | martell/ellcc | /libecc/src/c++/libcxx/utils/google-benchmark/src/csv_reporter.cc | C++ | cc | 3,107 | permissive | // Copyright 2015 Google Inc. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable... |
33fe8087e47c763e3dd819a55e232ade0bd9b67b | 141d8ae66bb74928e0c38efccf61d3f93a30668f | portsip/resiprocate | /resip/stack/EventStackThread.cxx | C++ | cxx | 6,203 | permissive | #include <climits>
#include "resip/stack/EventStackThread.hxx"
#include "resip/stack/SipStack.hxx"
//#include "resip/stack/SipMessage.hxx"
//#include "rutil/SelectInterruptor.hxx"
//#include "resip/stack/FdPoll.hxx"
#include "rutil/Logger.hxx"
#define RESIPROCATE_SUBSYSTEM Subsystem::SIP
using namespace resip;
/***... |
ac542ee0532b395d418c7db70f27cab271eaa0e8 | 758083e1464ee40c31cb1f1179850b61c74fddf7 | fernandoibarra015/MiniGames_HTML | /Examen Lab II/ListaEmpleados.cpp | C++ | cpp | 3,459 | no_license | #include "ListaEmpleados.h"
#include <iostream>
using namespace std;
ListaEmpleados::ListaEmpleados():primero(nullptr), ultimo(nullptr)
{}
bool ListaEmpleados::estaVacia()
{
return primero == nullptr;
}
void ListaEmpleados::agregarEmpleado(int _codigo, string _nombre, float _salario, bool _activo, Empleado* _sigui... |
d5ea4106bfde74012957366dc481f0ff73a2f935 | e8f89f018def018ee8d32d3a3f1e43b236541725 | ssrtkn/SpaceShooter | /Render/EntitySky.cpp | C++ | cpp | 3,314 | no_license |
#include "EntitySky.h"
#include "Root.h"
#include "SceneManager.h"
#include "RenderSystem.h"
#include "AssetManager.h"
#include "Effect.h"
using namespace Render;
void EffectSky::buildFX()
{
if( !mEffect ) return;
mTechNoFog = mEffect->GetTechniqueByName("SkyTechNoFog");
mTechFog = mEffect->GetTechn... |
d88590da888282cb05caab6a21286358e483b013 | 09b31f6bb7388c09f2bd483a36b4154da9817057 | stden/olymp | /ru-olymp-train-winter-2007/Submits/070119p/17_50_38_08_A_5629.CPP | C++ | cpp | 3,520 | no_license | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define eps 1e-9
int main( void )
{
freopen("triangle.in", "rt", stdin);
freopen("triangle.out", "wt", stdout);
double AX1, AX2, AX3, AY1... |
37a56ebcbb402bd4b6b49bbb553853e2eab46c8c | e82a2fa20df3fe523429f788ce28c56ab2ef3159 | SnowCherish/chromium | /extensions/shell/browser/shell_speech_recognition_manager_delegate.cc | C++ | cc | 4,132 | permissive | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "extensions/shell/browser/shell_speech_recognition_manager_delegate.h"
#include "base/bind.h"
#include "content/public/browser/browser_thread.h"... |
85f1eec70aaff534aa3a170594d84e1a90b31988 | c20cd52dc166e1b581017c996329f483a270aa28 | lukaszlaszko/cpp-dotenv | /src/listeners/line/UnresolvableListener.cpp | C++ | cpp | 1,620 | permissive | #include "UnresolvableListener.h"
using namespace cppdotenv;
using namespace std;
UnresolvableListener::UnresolvableListener(const string& key, SymbolsTable& symbols_table):
key(key),
symbols_table(symbols_table)
{
}
void UnresolvableListener::enterLine(LineParser::LineContext* ctx)
{
// Clear the st... |
5380cd5c2ebc74081a764f6b79316bdd58980b0d | 63fa1e093a21a53ec379edcc2e65f0bc6865f106 | nekomiao123/myprogram | /data/huffman/Huffman.cpp | C++ | cpp | 6,927 | no_license | #include<iostream>
#include<stdlib.h>
#include<string.h>
#include <algorithm>
#define MINDATA -10000
#define ERROR -1
#define SIZE 10
using namespace std;
typedef struct Haff* HaffNode;
struct Haff{
int weight;//权重，记录字符出现次数
char data;//存字符本身
HaffNode lchild;//左孩子
HaffNode rchild;//右孩子
};
typedef struct HNode *H... |
f3a7dd9fc0ba33a8446374bbb279db39ab991511 | 3043a8a737e54d52e0aa460c5578de206f31e485 | PaulPopa/Games | /C++ Games/MyGame/Src/Map/Map.cpp | C++ | cpp | 4,344 | no_license | #include "Map.h"
#include "App.h"
#include "Helpers.h"
Vector2f Map::m_mapZero;
Map* g_map;
std::map<std::string, std::pair<int, int> > Map::m_mapIntervals;
std::map<std::string, sf::Sprite> Map::m_squaresSprites;
std::map<std::string, sf::Texture> Map::m_squaresTextures;
Map::Map() :
m_lastPosition(100, 100)
{
g_m... |
19b0cace1c67ab6901ea3d0efd0861d3f133df45 | 1b93b3f0766b766add166083fa4ab2653666cc8c | dpilger26/NumCpp | /include/NumCpp/Functions/clip.hpp | C++ | hpp | 3,006 | permissive | /// @file
/// @author David Pilger <dpilger26@gmail.com>
/// [GitHub Repository](https://github.com/dpilger26/NumCpp)
///
/// License
/// Copyright 2018-2023 David Pilger
///
/// Permission is hereby granted, free of charge, to any person obtaining a copy of this
/// software and associated documentation files(the "Sof... |
9085200a83061adebf8c899d56324080c50b991e | 041d7865b9ec490783f074fe302937c448185cf0 | priscyLove/payroll-in-cpp | /AddCommissionedEmployee.cpp | C++ | cpp | 494 | no_license | #include "BiWeeklySchedule.h"
using namespace std;
class AddCommissionedEmployee : public AddEmployee
{
public:
double salary;
double rate;
AddCommissionedEmployee(string name, string address, double salary, double rate, DB* db)
: AddEmployee(name, address, db), salary(salary), rate(rate){};
void makeCla... |
c991b10fc77d12ba0e6cc216cf392fb783635a80 | b8dfc51377f66d40fafd496126af10bea6249f5b | Codeon-GmbH/mulle-clang | /test/OpenMP/single_ast_print.cpp | C++ | cpp | 2,776 | permissive | // RUN: %clang_cc1 -verify -fopenmp -ast-print %s | FileCheck %s
// RUN: %clang_cc1 -fopenmp -x c++ -std=c++11 -emit-pch -o %t %s
// RUN: %clang_cc1 -fopenmp -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s
// RUN: %clang_cc1 -verify -fopenmp-simd -ast-print %s | FileCheck %s
// RUN: %clan... |
4830c7b500e0268b8fdc083f9e753af569dc4607 | 533fe48edcd9c03e176e119ae619fcf2e3a3e95d | elliotwoods/VVVV.Nodes.OpenGL | /VVVV.Lib.OpenFrameworks.Interop/AssemblyInfo.cpp | C++ | cpp | 1,332 | no_license | #include "stdafx.h"
using namespace System;
using namespace System::Reflection;
using namespace System::Runtime::CompilerServices;
using namespace System::Runtime::InteropServices;
using namespace System::Security::Permissions;
//
// General Information about an assembly is controlled through the following
// set of ... |
d6ca260c26ab02c909699d5a19d988789ee8ffa0 | 7d40d716ba5426762475663dfe079086c9718d4c | Daniel-Stahl/Lab-6-COSCI-136 | /main.cpp | C++ | cpp | 5,577 | no_license | #include <string>
#include <iostream>
#include "Warehouse.hpp"
using namespace std;
void MainMenu();
int main() {
MainMenu();
}
void MainMenu() {
Warehouse warehouse;
int userChoice;
do {
cout << "Main Menu\n 1) Create Order\n 2) Recieve Delivery\n 3) Print orders & inventory\n 4) Exit... |
0ecd358e762b98941e30ce336d87014201ea692b | 628076969692606db0b287904dbc962802da0846 | MartianRover/kmail | /src/editor/warningwidgets/incorrectidentityfolderwarning.cpp | C++ | cpp | 2,404 | permissive | /*
SPDX-FileCopyrightText: 2017-2022 Laurent Montel <montel@kde.org>
SPDX-License-Identifier: GPL-2.0-or-later
*/
#include "incorrectidentityfolderwarning.h"
#include <KLocalizedString>
IncorrectIdentityFolderWarning::IncorrectIdentityFolderWarning(QWidget *parent)
: KMessageWidget(parent)
{
setVisible... |
907d4f1de06c99aeed573a883f495156e33010b6 | f7daea4aa24fd901acf7a8afbf134eab544efa31 | yft1996/IMAGE | /src/Features2d/sift.cpp | C++ | cpp | 42,791 | no_license | /*M///////////////////////////////////////////////////////////////////////////////////////
//
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
// By downloading, copying, installing or using the software you agree to this license.
// If you do not agree to this license, do not download, instal... |
ab24ee20ed801041fb7ab864da1cdc6ba57f8cf1 | 9a303a6758f8c975816d87dfa7785d2fb8cc1966 | ArielZimbrao/MaratonaProgramacao | /URI - Resolvidos/C++/URI-1146.cpp | C++ | cpp | 265 | no_license | #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int n,m,cont=0;
do{
scanf("%d",&n);
for(int i = 1; i <= n; i++){
if(i == n){
printf("%d\n", i);
}
else{
printf("%d ", i);
}
}
}while(n!=0);
} |
1361e2800d55e37c37c8fb8b86ab7bd6b43acffb | d439ab61a93a9112b509e1f8a3e822057cb712d9 | fazlerahmanejazi/Competitive-Programming | /Codeforces/495/C.cpp | C++ | cpp | 1,037 | no_license | #include <bits/stdc++.h>
using namespace std ;
#define inf 0x3f3f3f3f
#define INF 1000111000111000111LL
#define mod 1000000007
#define pi acos(-1.0)
#define eps 1e-8
#define endl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
#define all(cc) (cc).begin(),(cc).en... |
729ef1c01f97e66462b4f235d2ccf05a32ea0459 | e848dd3e634b6d693f96fc0047bf8408b24b80c6 | kousukeiwakiri/W14_Robot | /W14 code/W14-I1/Talk.cpp | C++ | cpp | 1,547 | no_license | #include "StdAfx.h"
#include "Talk.h"
CTalk::CTalk(void)
{
//発話関連の初期化
talkData = AquesTalkDa_Create();
}
CTalk::~CTalk(void)
{
// 発話関連の解放
AquesTalkDa_Release(talkData);
}
void CTalk::TalkLanguage(int talk_number)
{
if(AquesTalkDa_IsPlay(talkData) == 1) {
AquesTalkDa_Stop(talkData);
}
switch(talk_number)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.