blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 2 247 | content_id stringlengths 40 40 | detected_licenses listlengths 0 57 | license_type stringclasses 2
values | repo_name stringlengths 4 111 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringlengths 4 58 | visit_date timestamp[ns]date 2015-07-25 18:16:41 2023-09-06 10:45:08 | revision_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | committer_date timestamp[ns]date 1970-01-14 14:03:36 2023-09-06 06:22:19 | github_id int64 3.89k 689M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 25
values | gha_event_created_at timestamp[ns]date 2012-06-07 00:51:45 2023-09-14 21:58:52 ⌀ | gha_created_at timestamp[ns]date 2008-03-27 23:40:48 2023-08-24 19:49:39 ⌀ | gha_language stringclasses 159
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 7 10.5M | extension stringclasses 111
values | filename stringlengths 1 195 | text stringlengths 7 10.5M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
12c57202b5091ee496dfc614cae57af0fb374699 | 389c5a4865d2a13126db7eec15dde7cfc778c168 | /Labs/lab2/word.cc | 049d949befc17748f24be4153757934ef2f6bfd7 | [] | no_license | obakanue/cpp-edaf50 | 3e693497557bc170106d0e732ba956d641f46425 | 243e8da41dc2c721f7646b1518105151f09e8eba | refs/heads/master | 2021-01-06T18:21:17.254251 | 2020-03-09T21:31:57 | 2020-03-09T21:31:57 | 241,436,713 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 727 | cc | word.cc | #include <string>
#include <vector>
#include "word.h"
using namespace std;
Word::Word(const string& w, const vector<string>& t) {
this->word = w;
this->trigrams = t;
}
string Word::get_word() const {
return this->word;
}
unsigned int Word::get_matches(const vector<string>& t) const {
auto matches = 0;
... |
95e874c7c86ecb5767b7a926f07d36a972c19d09 | 464d6cb42fb8981595cbf7260069cd1e6a67fe2f | /DP/Standard Seen Problems.cpp/Box Stacking.cpp | c60962a5cfb0c79af115fb53dea2d6091f0f540a | [] | no_license | rahul799/leetcode_problems | fd42276f85dc881b869072b74654f5811c6618ea | cc7f086eb9ac9bbd20ea004c46d89aa84df10d36 | refs/heads/main | 2023-04-14T05:09:31.016878 | 2021-04-20T19:46:52 | 2021-04-20T19:46:52 | 359,933,382 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,717 | cpp | Box Stacking.cpp |
You are given a set of N types of rectangular 3-D boxes, where the ith box has height h, width w and length l. You task is to create a stack of boxes which is as tall
as possible, but you can only stack a box on top of another box if the dimensions of the 2-D base of the lower box are each strictly larger than those o... |
23d19ef554b962f3f1bf2afb164e31281f8212b3 | be86675778e8a4872eb28eaece3623c6ed8b4a38 | /uva 10405.cpp | 1bcd62dfd25346a3eca92b7cb8745c09d5a3d528 | [] | no_license | notanchowdhury/Uva-Online-Judge | bfc97d9030c930671660717e535054ac7da853ca | 5da3a0d3db0d5dfdc69dca68bad6f129b0962624 | refs/heads/master | 2022-03-29T13:46:28.497497 | 2019-11-20T10:51:37 | 2019-11-20T10:51:37 | 197,809,019 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 867 | cpp | uva 10405.cpp | #include<cstdio>
#include<iostream>
#include<string.h>
using namespace std;
#define MAXC 1008
char A[MAXC],B[MAXC];
int lenA,lenB;
int dp[MAXC][MAXC];
bool visited[MAXC][MAXC];
int calcLCS(int i,int j)
{
if(A[i]=='\0' or B[j]=='\0') return 0;
if(visited[i][j])return dp[i][j];
int ans=0;
if(A[i]==B[j... |
6ed041f51e04fabc9abcf936d980d4eaccf405cc | 4f62ade008f32e00485ba487a914bcdecb892057 | /calculator.cpp | 014ccd9503e9cf37a05c26984c38eedfb0501cce | [] | no_license | nunanas21/CIS108lab2 | bbbcf5cc42652edf44d660a3211733fe9cbdb397 | 772d96c4847f21be584ec317bf6c96353c3df4d4 | refs/heads/master | 2020-04-19T08:14:15.036012 | 2019-05-09T00:54:15 | 2019-05-09T00:54:15 | 168,070,091 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,286 | cpp | calculator.cpp | #include "calculator.h"
#include <cmath>
namespace calculator
{
double current_value = (0.0);
void memory_store(double);
double memoryStore;
void memory_recall(double);
double memoryRecall;
double memory_clear;
double currentValue()
{
return current_value;
}
double add(double left,... |
9191880319f322a81958c6b3dc7c0d3f36627dfa | b7d4fc29e02e1379b0d44a756b4697dc19f8a792 | /deps/boost/libs/icl/test/fastest_partial_icl_quantifier_cases.hpp | 862e6ce66cb9d9ff92111b7ba62274fd99c11c5b | [
"GPL-1.0-or-later",
"MIT",
"BSL-1.0"
] | permissive | vslavik/poedit | 45140ca86a853db58ddcbe65ab588da3873c4431 | 1b0940b026b429a10f310d98eeeaadfab271d556 | refs/heads/master | 2023-08-29T06:24:16.088676 | 2023-08-14T15:48:18 | 2023-08-14T15:48:18 | 477,156 | 1,424 | 275 | MIT | 2023-09-01T16:57:47 | 2010-01-18T08:23:13 | C++ | UTF-8 | C++ | false | false | 4,526 | hpp | fastest_partial_icl_quantifier_cases.hpp | /*-----------------------------------------------------------------------------+
Copyright (c) 2008-2009: Joachim Faulhaber
+------------------------------------------------------------------------------+
Distributed under the Boost Software License, Version 1.0.
(See accompanying file LICENCE.txt or copy at
... |
6334c26fd858cd135792a7d7544bf64b39220149 | 9777b8f325e8602d7d2be295238a740390ab8661 | /MPU_6050.ino | c2033f45e1478a0f9f9dce107c2494ec17524dad | [] | no_license | PrzemekMi/MPU-6050-Angle-Gauge | afc7c6eb239e655e8d1b3ea8bcebbdb226b1c6e2 | 142854828e259a7465e92b41dcd5e1be43b0d63a | refs/heads/master | 2020-03-07T00:54:02.513255 | 2018-03-28T16:41:27 | 2018-03-28T16:41:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,062 | ino | MPU_6050.ino | #include <Wire.h>
#include <MPU6050.h>
MPU6050 mpu;
void setup() {
Serial.begin(115200);
Serial.println("Initialize MPU6050");
while (!mpu.begin(MPU6050_SCALE_2000DPS, MPU6050_RANGE_2G))
{
Serial.println("Could not find a valid MPU6050 sensor, chceck wiring!");
delay(500);
}
mpu.calibrateGyro();... |
587cce253fb71bb6bc50b2ceaeccfd78ad045c70 | 02fefdf8f7362035767933f8c639727fefb5f137 | /radiobutton.h | 8580da297c060b5b470b374f91ab13dc8621b8ec | [] | no_license | mitchworsey/8TilePuzzle | fb2c64bec6cd96519f73e5a50512f6602c224d87 | 676f2527baf827f61e01ee91d6fd6873b72f67af | refs/heads/master | 2021-01-10T20:50:52.606467 | 2015-03-04T14:01:59 | 2015-03-04T14:01:59 | 31,659,343 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 296 | h | radiobutton.h | #ifndef RADIOBUTTON_H
#define RADIOBUTTON_H
#include <QWidget>
#include <QRadioButton>
#include <QString>
class RadioButton : public QWidget{
//Q_OBJECT
private:
QRadioButton *qrb;
std::string s;
public:
RadioButton(std::string);
bool isChecked();
std::string getName();
};
#endif
|
9b1f90a6713a270ae4c34804227aaa106a62054a | cb8c337a790b62905ad3b30f7891a4dff0ae7b6d | /st-ericsson/multimedia/audio/afm/nmf/hst/bindings/shm/shmout/inc/shmout.hpp | bcbf44143077327292d6b32022e04757d68e5377 | [] | no_license | CustomROMs/android_vendor | 67a2a096bfaa805d47e7d72b0c7a0d7e4830fa31 | 295e660547846f90ac7ebe42a952e613dbe1b2c3 | refs/heads/master | 2020-04-27T15:01:52.612258 | 2019-03-11T13:26:23 | 2019-03-12T11:23:02 | 174,429,381 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,879 | hpp | shmout.hpp | /*****************************************************************************/
/*
* Copyright (C) ST-Ericsson SA 2009,2010. All rights reserved.
* This code is ST-Ericsson proprietary and confidential.
* Any use of the code for whatever purpose is subject to
* specific written permission of ST-Ericsson SA.
*
*/
... |
e7ed5ee648ec5f59f29e02ad87c396a4f977f85d | 3998f24b410d0b523b216831e876fde87d78ad54 | /指针/指针热身1.cpp | 367732278930130ebd978150d5139a390d63a0db | [] | no_license | HugeMan-Lee/C | 293e81192520ff1700ada2d5971b463965f7b40d | 3af547f68caf3c27ed8a02438a3c0317f00b58f3 | refs/heads/master | 2022-12-13T13:15:24.112996 | 2020-06-12T06:07:04 | 2020-06-12T06:07:04 | 296,282,126 | 0 | 0 | null | 2020-09-17T09:36:09 | 2020-09-17T09:36:08 | null | GB18030 | C++ | false | false | 525 | cpp | 指针热身1.cpp | # include <stdio.h>
int main(void)
{
int * p; //p是变量名；int * 表示表示p变量存放的是int类型变量的地址
//不表示定义一个叫* p的变量
//p是变量名，p的数据类型是int * 类型；
//所谓int * 类型：就是存放int变量地址的类型
int i = 3;
int j;
p = &i;
// p = i; //error 类型不一致，p只能存放int类型变量的地址，不能存放int类型变量的值
// p = 55; /... |
7fe1db01ef40a89b74317b0778bb174e9845be96 | 6f9805642bac90fb4db1d8c2b216279618b2f6d8 | /src/rtmp/rtmp.h | 7fb4087250571271ea70b87a11ca069541ad62ec | [
"MIT"
] | permissive | commshare/RtspServer-1 | 3762ba1e85ce69b7f1758fc043b71f0f88178ac8 | a31b54c33fd1aabc433811afe54c312ba55b3e11 | refs/heads/master | 2020-06-06T20:34:19.033164 | 2019-06-22T16:52:27 | 2019-06-22T16:52:27 | 192,846,698 | 1 | 0 | null | 2019-06-20T04:10:11 | 2019-06-20T04:10:10 | null | GB18030 | C++ | false | false | 6,646 | h | rtmp.h | #pragma once
#include <memory>
#include <string>
#include <cstdlib>
#include "rtmp/comm.h"
#include "zlm/Buffer.h"
#define PORT 1935
#define DEFAULT_CHUNK_LEN 128
#if !defined(_WIN32)
#define PACKED __attribute__((packed))
#else
#define PACKED
#endif //!defined(_WIN32)
#define HANDSHAKE_PLAINTEXT 0x03
#define RAND... |
9035c5c1dfa0bac4d408cd155e4c036b5e3e8e1a | 087db87afc8cafcd21cfdaeeebaf31d7fafb6511 | /libsponge/tcp_helpers/tuntap_adapter.hh | b6506a55eb3a2efd61b1242cd4d348d868198dd4 | [] | no_license | ViXbob/CS144-Lab-Assignment | beb95b2b46206c6922aa9b4d2966c1957336ffdf | 77ded007a0367e61507fe272c219b710c65904be | refs/heads/master | 2023-07-12T07:39:35.171677 | 2021-08-31T11:13:26 | 2021-08-31T11:13:26 | 395,590,005 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,346 | hh | tuntap_adapter.hh | #ifndef SPONGE_LIBSPONGE_TUNFD_ADAPTER_HH
#define SPONGE_LIBSPONGE_TUNFD_ADAPTER_HH
#include "tcp_over_ip.hh"
#include "tun.hh"
#include <optional>
#include <unordered_map>
#include <utility>
//! \brief A FD adapter for IPv4 datagrams read from and written to a TUN device
class TCPOverIPv4OverTunFdAdapter : public T... |
7d69ee49fc92b66961409b7e4efc69a8a0e59822 | 6360ba1826780966347255ae49d89e312bae3078 | /Trim_Behind/Trim_Behind.cpp | b1da4be165d288825998c7be97f3fb8883645799 | [] | no_license | HopeLi/trim_behind | 0697304328f10a829928c5761a67ae21668bc385 | f16e89955f769333fe5375d7eb3cc876a20658e9 | refs/heads/master | 2016-09-15T23:27:28.475334 | 2012-09-02T10:41:43 | 2012-09-02T10:41:43 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,763 | cpp | Trim_Behind.cpp | // Trim_Behind.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <iostream>
#include <getopt.h>
#include <string>
#include <boost/algorithm/string.hpp>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
string delimiter = ":"; //default delimiter is ':'
//phase command line
static str... |
e64bbb30ecdc7718b53e32e374cac8c3c4405428 | 268ef75668b1be37167ef59addfc1bd11f8be0f6 | /Algorithms/Game Theory/Tower Breakers, Revisited!/solution.cpp | 64d746277a85a96ca2ee3e4ddda02be62b498bf6 | [
"MIT"
] | permissive | satyampandeygit/ds-algo-solutions | 2756e3aa00d50e84308c07a1d71bacc73049a333 | 4f04b25503be3d3fbc9037313acbf48b90505d44 | refs/heads/main | 2023-02-09T03:48:58.290364 | 2021-01-04T19:50:04 | 2021-01-04T19:50:04 | 322,667,019 | 1 | 0 | MIT | 2020-12-18T17:52:30 | 2020-12-18T17:52:29 | null | UTF-8 | C++ | false | false | 1,913 | cpp | solution.cpp | /*
Imagine each tower as a Nim pile which has a Nimvalue equal to the number of prime factors of hi.
Reducing a tower to its divisor is the same as taking away a non-zero prime factor from it.
Thus, this game is the same as a Nim game and our answer is the XOR of all Nim piles.
If the Nim sum is 0, t... |
60bc63a78423998ed56785fdc13a1be81dee6011 | e783616ef24e17252960c0b02c9d60a775007178 | /hls_old/hls/systolic_array.cpp | c5db44bbf2c78e60bd6ed2adea98b5341560f903 | [] | no_license | dhm2013724/systolic_array_hls | 0450a7149d139951fb834fe884c7b824f216d240 | ddadd9169c55146c3d278976f60f922f1ed888b0 | refs/heads/main | 2023-04-07T00:08:58.097791 | 2021-04-15T13:12:38 | 2021-04-15T13:12:38 | 341,474,501 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 134,293 | cpp | systolic_array.cpp |
#include "systolic_array.h"
//////////////////////////////////////////v14 start////////////////////////////////////////
typedef struct {
int K_MIN;
bool write_back;
bool init;
} cwrap_s;
template<int MIN_R,int MID_C>
void compute_pe(hls::stream<int> &A_in, hls::stream<int> &B_in, hls::stream<int> &C_in, hls::str... |
231eb08fd72acbe4b7392d05e509b0b13d2bf519 | b86886c28d2a8ccaf8a35af78556f60bb95ad563 | /File.h | 724e965a6c66b379a0d9b06b7fb0f7262fd8d7d3 | [
"MIT"
] | permissive | gochaorg/zipsfx-cpp | 5b6b00351d6996a8c98e3c7d59cc409f662b3add | bcfa69f3bf5009f1e4c3e426feb176268312d340 | refs/heads/master | 2021-01-24T11:03:07.046126 | 2016-10-07T19:15:26 | 2016-10-07T19:15:26 | 70,267,214 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 947 | h | File.h | /*
* File: File.h
* Author: User
*
* Created on 14 Январь 2012 г., 23:35
*/
#ifndef _FILE_H
#define _FILE_H
#include <sys/stat.h>
#include <libgen.h>
#include <vector>
#include "String.h"
class RandomAccessFile;
#include "RandomAccessFile.h"
#include "IOError.h"
class File {
protected:
String name;
pub... |
38e4ab4c88e88d4bfec3bb28659c455b7cf8a68a | 59bde1cf03f3bc8d4e3a068a27f75a5f8a8a2aa5 | /test/dxtionary_bind_test.cpp | 6472e5a9573f3847594091d59e569907de33c2c6 | [] | no_license | hpb-htw/dxtionary-db | 708caa28c8dd321c7d5e223f55312d8e41d3b143 | 51da97f240b312dcde4169d153e6da6c387f4de5 | refs/heads/master | 2021-07-10T01:13:30.079606 | 2021-03-15T14:00:04 | 2021-03-15T14:00:04 | 235,292,070 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,768 | cpp | dxtionary_bind_test.cpp | #include <iostream>
#include "gtest/gtest.h"
#include "dxtionary_bind.h"
using namespace std;
ostringstream output;
int callback(void* NotUse, int argc, char** argv, char** azColName)
{
cout << argc << ' ';
for(int i = 0; i < argc; ++i)
{
output << azColName[i] << " = " << (argv[i] ? argv[i] : "NULL") << endl;
... |
d8d19698e3ca850f104d249f5baab0a194f90558 | ba51a4d94fefb4d840765b482af3728075382db3 | /runner/src/include/kourt/runner/logging.h | 73bee59a77c943d556da61156daf01915914c71f | [] | no_license | lfyuomr-gylo/kourt | c8a86febf88bae3df1d7cba9fcd4d9278645798e | 187c2ac88a276dbce17ebd5d7701e694af3720d0 | refs/heads/master | 2022-04-02T17:25:55.743671 | 2020-02-04T19:23:32 | 2020-02-04T19:23:32 | 163,358,699 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,988 | h | logging.h | #ifndef RUNNER_SRC_LOGGING_H_
#define RUNNER_SRC_LOGGING_H_
#include <ctime>
#include <cstdio>
#include <string>
#include <stdexcept>
enum class LoggingLevel {
kTrace = 10,
kDebug = 20,
kInfo = 30,
kWarn = 40,
kError = 50
};
const char *LoggingLevelToString(LoggingLevel level);
bool IsLoggingLevelActive(L... |
531b1414d2922311ec1e29c7b4986ab30a896888 | f5df78bad31c0d8c4923878727e9222c52ca1974 | /Scranton_IEEE_Micromouse-2016-04-04/Scranton IEEE Micromouse/nav.cpp | ad6ce4238ba2cc0bdbabce0e6e1f3651fdecc30f | [] | no_license | cameron-klales/microMouseSAC16 | d0578c6d3a2dd9b31fdcda0c4f4f009901f626bb | 604010ffe216e51b5d7f36cf5ab4d62c33a6cde2 | refs/heads/master | 2021-01-10T12:56:06.605702 | 2016-04-09T06:31:14 | 2016-04-09T06:31:14 | 54,745,657 | 0 | 0 | null | 2016-04-04T18:32:11 | 2016-03-25T20:26:29 | C | UTF-8 | C++ | false | false | 13,088 | cpp | nav.cpp | #include "nav.h"
#include "queue.h"
#include "motor.h"
#include "Arduino.h"
#define DEBUG
extern "C"
{
int nav_is_pos_in_bounds(struct nav_array *array, pos_t *position)
{
return (position->column >= 0) && (position->row >= 0) && (position->column < array->columns) && (position->row < array->rows);
}
int nav_is... |
85c0a9b055e0b22b526c1c9cd6bd2e413c1f4c48 | e1221f0b590a608478a3677798c9736c8b74c907 | /Black-Hole/black_hole.cpp | aa8e00ddb0d63585788f1426b2e2fb771e2de464 | [] | no_license | CyserixXx/SourceParts_Entity | a1486a6601aea6753dfa0d8038975acb76d4d51d | d9e8def3c86105878d4279dbaa10ecc482ce2f00 | refs/heads/master | 2021-01-22T02:28:54.208371 | 2013-01-23T22:11:33 | 2013-01-23T22:11:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,062 | cpp | black_hole.cpp | /* (c) Magnus Auvinen. See licence.txt in the root of the distribution for more information. */
/* If you are missing that file, acquire a complete release at teeworlds.com. */
#include <engine/config.h>
#include <game/generated/protocol.h>
#include <game/server/gamecontext.h>
#include "black_hole.h"
/*... |
c74defcb4489d5b4f036445b831aa771503e9d2f | 12440c14338552847954cece4afe6659b764bca9 | /comp4/ps0/main.cpp | f6a6dc94de98a19068ebd2e8a1234abfb4a6b7cd | [] | no_license | alex-a-pereira/school-cs | d22442710f6ec5f7f3101c8611a3d02c33fbaf28 | d33ee8012a5f0c0fe40bbd3a3e55fdd24dc61870 | refs/heads/master | 2020-04-19T20:58:39.658440 | 2019-03-05T14:13:02 | 2019-03-05T14:13:02 | 168,429,197 | 0 | 0 | null | 2019-01-30T23:50:45 | 2019-01-30T23:05:26 | null | UTF-8 | C++ | false | false | 2,516 | cpp | main.cpp | #include <SFML/Graphics.hpp>
using namespace std;
using namespace sf;
int main()
{
RenderWindow window(sf::VideoMode(200, 200), "SFML works!");
window.setFramerateLimit(60);
RectangleShape background(Vector2f(200, 200));
background.setFillColor(Color(43, 53, 52));
CircleShape circle_frame(100.f);
circle_frame... |
1f374a487404d5e4debfbc2f0443ab9c8ae3b5e5 | c60583df124939d7faf1a01447f1e28e1b2bd9b5 | /스타듀 밸리/tree3.cpp | ba4ccbf4893436cdc821764f0e1be26933e753cf | [] | no_license | parkSee/stardewValley | cee55876f9723b71e56fbf711dc40f3ea2603bd3 | 843cd9992b4607fb0cb165ba5dae64ed232e866a | refs/heads/master | 2021-07-16T01:20:15.500751 | 2017-10-23T12:34:01 | 2017-10-23T12:34:01 | 106,686,250 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 82 | cpp | tree3.cpp | #include "stdafx.h"
#include "tree3.h"
tree3::tree3()
{
}
tree3::~tree3()
{
}
|
93c821c3ace82e5c211284c1348a51aba48d07b0 | 1f1e344a8eb537db075a08a82301f961bfc55d37 | /Polinomios/Polinomio.cpp | f43e26b77ffc7638943aa494820cf111262a1193 | [] | no_license | Alan-Poisot/Practicas | b21a7b8da70f5888dcf231273a52dd6a9b2e2619 | 056a90a4a6cc2f79df57b11c671384f4e92b712e | refs/heads/master | 2023-01-28T03:54:37.217895 | 2020-12-08T07:43:40 | 2020-12-08T07:43:40 | 298,356,867 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,091 | cpp | Polinomio.cpp | #include "Polinomio.h"
Polinomio::Polinomio() {
int n=0;
double c;
while (n<1) {
cout << "Introduzca el grado del polinomio:";
cin >> n;
}
orden=n;
for (int i = 0; i < n+1; ++i) {
cout << "Introduzca el coeficiente de x^"<<n-i<<":";
cin >> c;
... |
6775284ee54237d35f6816969ab0954b4b50b3e0 | 8f11b828a75180161963f082a772e410ad1d95c6 | /packages/estimation/include/modules/RangeEstimationModule.h | c2cb2ca3b0451b7f7e96ecb77e5f1d6f380b5c2c | [] | no_license | venkatarajasekhar/tortuga | c0d61703d90a6f4e84d57f6750c01786ad21d214 | f6336fb4d58b11ddfda62ce114097703340e9abd | refs/heads/master | 2020-12-25T23:57:25.036347 | 2017-02-17T05:01:47 | 2017-02-17T05:01:47 | 43,284,285 | 0 | 0 | null | 2017-02-17T05:01:48 | 2015-09-28T06:39:21 | C++ | UTF-8 | C++ | false | false | 1,018 | h | RangeEstimationModule.h | /*
* Copyright (C) 2011 Robotics at Maryland
* Copyright (C) 2011 Eliot Rudnick-Cohen <erudnick@umd.edu>
* All rights reserved.
*
* Author: Eliot Rudnick-Cohen <erudnick@umd.edu>
* File: packages/estimation/include/modules/RangeEstimation.h
*/
#ifndef RAM_ESTIMATION_RANGEMODULE
#define RAM_ESTIMATION_RANGEMODU... |
34180a75cb8bf57c7162238f53ecd6ccf05d7e90 | fccd69cc574da2f1f2588079acf616b6d39ac3dc | /HPSExchangeProgressDialog.cpp | abd69e761026554614518394a688dea65a5322e2 | [
"MIT"
] | permissive | PMK3D/bim_viewer_tutorial | 9707d85c025cf9e2f231b9979e5fdc82afeeaefe | 9005094a4cb3d32c1a398f82188c3201ab8600df | refs/heads/main | 2023-06-05T03:51:05.273961 | 2021-06-25T15:15:33 | 2021-06-25T15:15:33 | 380,277,323 | 0 | 0 | MIT | 2021-06-25T15:18:09 | 2021-06-25T15:18:08 | null | UTF-8 | C++ | false | false | 6,854 | cpp | HPSExchangeProgressDialog.cpp | #include "stdafx.h"
#include "HPSExchangeProgressDialog.h"
#include "afxdialogex.h"
#include "CHPSView.h"
#include <mutex>
#ifdef USING_EXCHANGE
#include "sprk_exchange.h"
#endif
std::mutex mtx;
namespace
{
bool isAbsolutePath(char const * path)
{
bool starts_with_drive_letter = strlen(path) >= 3
&& isalpha(p... |
be25dbb0871d07d8d596a51d8262ea570b55345e | dda4724fb249d3fab65231c26c6cac18c3e813be | /Nokia5110 Graphical Display/Nokia5110 Graphical Display/Nokia5110 Graphical Display.h | 531256bc5874b0c029e4177a10da630136614b30 | [] | no_license | MiladHajiShafiee/avr-example-projects | a7904dd1530985fb81abaf460f1fed363a6749d8 | ce2f7fee7ec9f55c5b2a4146e92455ef60262b39 | refs/heads/main | 2023-03-24T14:19:57.936691 | 2021-03-15T16:52:48 | 2021-03-15T16:52:48 | 348,051,690 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 586 | h | Nokia5110 Graphical Display.h | /*
* Nokia5110_Graphical_Display.h
*
* Created: 2018/08/24 8:53:06 صـبـح
* Author: Milad
*/
#ifndef NOKIA5110 GRAPHICAL DISPLAY_H_
#define NOKIA5110 GRAPHICAL DISPLAY_H_
#define F_CPU 8000000UL
#include <util/delay.h>
#include <string.h>
#include "AnimKid.h"
#include "SPI.h"
#include "Font.h"
class NokiaDi... |
ea84d2e6a723e598cbaa69cd0eb90d781e97f199 | 21b7d8820a0fbf8350d2d195f711c35ce9865a21 | /Card Game.cpp | dfdc5e8621807906ce1e86c4fb8d6d33056dae83 | [] | no_license | HarshitCd/Codeforces-Solutions | 16e20619971c08e036bb19186473e3c77b9c4634 | d8966129b391875ecf93bc3c03fc7b0832a2a542 | refs/heads/master | 2022-12-25T22:00:17.077890 | 2020-10-12T16:18:20 | 2020-10-12T16:18:20 | 286,409,002 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 411 | cpp | Card Game.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
map<char, int> m;
m['6']=6;
m['7']=7;
m['8']=8;
m['9']=9;
m['T']=10;
m['J']=11;
m['Q']=12;
m['K']=13;
m['A']=14;
char t; string c1, c2;
cin>>t;
cin>>c1>>c2;
if(c1[1]==t && c1[1]!=c2[1]) cout<<"YES";
els... |
c58876076319ef4803591eaafc6b988c9962d3ca | 881a639922b568785674fe25ebfec5258c22c057 | /RayTracer.cpp | ab8dd9926bc90e51cae206b774abf2ae79f08b7e | [] | no_license | fxthomas/renderboy | 571e310616e94d53003521087b85c501154b3b43 | 557f63eb7558707dd73daf95aa0972d5de3a399b | refs/heads/master | 2021-01-19T05:29:22.212588 | 2013-02-08T14:12:52 | 2013-02-08T14:13:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 16,501 | cpp | RayTracer.cpp | // *********************************************************
// Ray Tracer Class
// Author : Tamy Boubekeur (boubek@gmail.com).
// Copyright (C) 2010 Tamy Boubekeur.
// All rights reserved.
// *********************************************************
#include "RayTracer.h"
#include "Ray.h"
#include "Scene.h"
#define ... |
60b9227038d8266fb5d72f460a3f5bbe29330db1 | 880557ea1db4b385e7dca82afb82818e7e47f5dd | /tests/physicsTests/physicsWorldTests.cpp | c640926a06c26706cbe1bc8ade3492ba629f5dc4 | [] | no_license | fscur/phi | 45db0903463add36108be948381511a7f74f4c8d | 4b147bbd589b0bec89f59fa3ed843b927b6b0004 | refs/heads/master | 2021-01-20T11:44:18.781654 | 2017-02-22T13:53:22 | 2017-02-22T13:53:22 | 82,651,381 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,067 | cpp | physicsWorldTests.cpp | #include <precompiled.h>
#include <phi.h>
#include <gtest\gtest.h>
#include <core\node.h>
#include <physics\physicsWorld.h>
using namespace phi;
class physicsWorldWithCubeFixture :
public testing::Test
{
public:
physicsWorld* physicsWorld = nullptr;
node* cubeNode = nullptr;
public:
void SetUp()
... |
fa8050af8a8a79d63a0ccde62c744b3e57e8101b | b40ebc7b656076cc75ca57c5ff44e487c855e6ec | /ClothDemo/include/Spring.h | 1976d1caf284eb62b8945c5184f1eaba05955242 | [] | no_license | pxk5958/QUIX-Engine | 9c6a462cd162f847c0190155fe7802ec4764638e | 5f4ca058d39a3c86c4b2dc39eaf6c5783e9e1be8 | refs/heads/master | 2020-05-20T18:42:31.378816 | 2017-03-10T13:02:56 | 2017-03-10T13:02:56 | 84,506,353 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 931 | h | Spring.h | #ifndef SPRING_H
#define SPRING_H
class Spring
{
public:
Spring(float _stiffness, float _damping, Particle* _start, Particle* _end, float length)
{
stiffness = _stiffness;
damping = _damping;
restLength = length;
start = _start;
end = _end;
}
~Spring();
void applyForce()
{
Vector3 dir = start->... |
a5bfcb224b11604eb2b10993e63916e42ec0de5f | 74548248cdf4aa7ab9213b9b801ee2dde669a9ad | /part-4/9/2.cpp | fd3d616cee5d7fd389b842dbdaf6ed156e59324c | [] | no_license | f2rkan/intro-to-Programming-w-c-plus-plus | e92e9da15d70b10030ba1ff73c2884df8b25e8d6 | 263637d797e385290daf2f6806a82149f5e87c1e | refs/heads/main | 2023-06-14T16:57:10.772542 | 2021-07-03T11:11:56 | 2021-07-03T11:11:56 | 382,592,830 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 844 | cpp | 2.cpp | #include<iostream>
const int Max = 10;
int main(void)
{
using namespace std;
double donation[Max];
double value, total = 0;
int index = 0;
cout << "donation " << index + 1 << ": ";
cin >> value;
while(cin.good() && index < Max)
{
donation[index] = value;
... |
b2dc0d501d2d30cfa6b17c3e2a0f045709f6cd89 | 44125a330e13a988b9d01aded6cdf59b1b0411fa | /56 Merge Intervals/56 LL.cpp | 222d7eacf49b1a62351f4a2fb4247d0334987cf1 | [] | no_license | LindongLi/Leetcode | 38da93d85b2722358faf10ab1b3f48159400fa11 | 3cb38b21cd19467c758bc248527360e3202152e9 | refs/heads/master | 2021-01-10T22:14:00.186644 | 2015-10-16T03:01:35 | 2015-10-16T03:01:35 | 35,410,660 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,366 | cpp | 56 LL.cpp | #include <vector>
#include <iostream>
using namespace std;
struct Interval
{
int start;
int end;
Interval() : start(0), end(0) {}
Interval(int s, int e) : start(s), end(e) {}
};
/*
https://leetcode.com/problems/merge-intervals/
Given a collection of intervals, merge all overlapping intervals.
For example,
Given ... |
5f7102ef71cc067f2d75475b3373b779a1553f07 | c4ec391748dc6a684de66d817305d6021a820fb1 | /src/Cipher.h | a0d5cf0778b228b6921aea5256fbd3a47a78bb82 | [] | no_license | lucinda27/Final-project1 | 6bfc8f107d1823b2f730b3fd36f9ad509a7570b4 | 486a9e1af6686b6ddb82baccdf1e33793d45ea2a | refs/heads/main | 2023-05-07T11:41:49.541397 | 2021-06-03T06:57:44 | 2021-06-03T06:57:44 | 367,151,139 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 479 | h | Cipher.h | #ifndef Cipher_H
#define Cipher_H
#include <string>
using namespace std;
class Cipher
{
private:
int count1=0;
int count2=0;
int l;
int length;
public:
Cipher();
void setPlaintext(const string ptext);
string noSpace();
int setLength();
string lowerCase... |
7a350d48ac52bec9a6bd6fcaa6197d49d3d503fc | b58b041560d9383893536f9f05a0275c74a6efeb | /include/cpp-sort/detail/low_comparisons/sort12.h | a795bc0139ed0711b57e4fe060e33607a7ff2d41 | [
"MIT",
"BSL-1.0",
"Apache-2.0",
"LicenseRef-scancode-public-domain",
"LLVM-exception",
"Zlib",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | afakihcpr/cpp-sort | 314fa90342983f195edb5e70783d4d8c70883cbb | 8e4d3728f26d654899f54dc261e3765fdd782acb | refs/heads/master | 2023-08-26T11:36:42.195133 | 2021-07-27T14:31:38 | 2021-07-27T14:31:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,965 | h | sort12.h | /*
* Copyright (c) 2015-2017 Morwenn
* SPDX-License-Identifier: MIT
*/
#ifndef CPPSORT_DETAIL_LOW_COMPARISONS_SORT12_H_
#define CPPSORT_DETAIL_LOW_COMPARISONS_SORT12_H_
////////////////////////////////////////////////////////////
// Headers
////////////////////////////////////////////////////////////
#include <func... |
d6195b06cbb9cbacc370ffa50ba5f9aec3f32015 | 195f0527395e43b1bdfc2707c776c6f6fa263d33 | /modules/gui/src/main.cpp | abf285937f7fdbe75d352ddb32cec6358684a087 | [] | no_license | smanthe/camera_calibration_tool | 6f52a484d1d35767167e9ed92791ee9f5bcde627 | 7d9c693929b6332c3b70ccb4a1cb63eb2b79c0a0 | refs/heads/master | 2022-02-23T13:19:33.473194 | 2022-02-22T07:09:58 | 2022-02-22T07:09:58 | 53,418,496 | 5 | 1 | null | 2017-06-24T16:59:30 | 2016-03-08T14:27:29 | C++ | UTF-8 | C++ | false | false | 364 | cpp | main.cpp | /*
* main.cpp
*
* Created on: 30.12.2013
* Author: Stephan Manthe
*/
#include "CalibrationWidget.h"
#include <QApplication>
#include <QtGui>
int main(int argc, char* argv[])
{
setenv("LC_ALL", "C", 1);
QApplication app(argc, argv);
CalibrationWidget calibWidget;
calibWidget.show();
cal... |
15bf307b3165a3d6be17ad4b0a40dde630f54868 | ec8364edc6db44b15a38b2baf34899f74c6e8d39 | /include/winrt/Windows.Services.Maps.0.h | 8eca935abf54793e2aa5ebe5632367db3f6845f6 | [] | no_license | adrianstephens/win_arty | 2ff906a5b0c4b080ddc366c75098d12c56967da4 | 3fef806596e11ab66d33cb2649aee22071daba66 | refs/heads/master | 2020-03-11T17:16:46.134747 | 2018-04-19T03:12:22 | 2018-04-19T03:12:22 | 130,142,466 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,088 | h | Windows.Services.Maps.0.h | #pragma once
// generated by isopod tools
#include "pre_include.h"
namespace iso_winrt {
// forward types
namespace Windows { namespace Services { namespace Maps {
enum class MapRouteOptimization : int {
Time = 0,
Distance = 1,
TimeWithTraffic = 2,
Scenic = 3,
};
enum class MapRouteRestrictions : unsigned {
No... |
7852de8046f1d601f0c109c575f11f47f9706937 | 41d88e239eb01ece403bec3049f80b87e178b0c0 | /Pod/AnimationBundle.cpp | c003d513a1e40f54643c555b9c41b148d98397dc | [] | no_license | phucgo240699/Pod | c88ae6bd317ae42dabb4beb3bb0efcf88ec8dcf3 | f79580657c7ff2518dda1f53c3e7ae0eadded9c8 | refs/heads/master | 2023-07-04T14:47:34.183545 | 2021-07-31T05:06:45 | 2021-07-31T05:06:45 | 322,143,610 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,627 | cpp | AnimationBundle.cpp | #include "AnimationBundle.h"
AnimationBundle* AnimationBundle::instance;
AnimationBundle* AnimationBundle::getInstance()
{
if (AnimationBundle::instance == nullptr) {
instance = new AnimationBundle();
}
return instance;
}
void AnimationBundle::load()
{
fstream fs;
fs.open(FilePath::getInstance()->animation_bu... |
32a35b0913edd051cb21b70629a2b605bab78bc5 | 44d47822748b60c9aa88a90e458a7090e4ccacf5 | /src/constraint.cpp | d3745c6a2b5b40efc68a831abc80906334e701b8 | [
"MIT"
] | permissive | ctriley/optimystic | c22272fe0204daa0126e3b736620ffa0e4ba9277 | ed65c0c3a5b42ec7577aab0ac243538985095c90 | refs/heads/master | 2021-07-14T22:17:46.988382 | 2021-03-04T19:15:21 | 2021-03-04T19:15:21 | 235,645,961 | 1 | 0 | MIT | 2020-03-04T23:40:50 | 2020-01-22T19:10:19 | CMake | UTF-8 | C++ | false | false | 1,154 | cpp | constraint.cpp | //
// Created by connor on 9/20/19.
//
#include "constraint.hpp"
#include <utility>
namespace optimystic {
#ifdef GUROBI
Constraint::Constraint(std::shared_ptr<GRBConstr> constr): _grb_constr(std::move(constr)) {}
std::shared_ptr<GRBConstr> Constraint::getGRBConstr() {
return _grb_constr;
}
#elif defined... |
07a432a2c57c73cbaf725a5ba720507cf75dd545 | 49df3f33b58159b410ff82bfa04a1a8eacf5e737 | /test/lib/opengl/test_shader.cpp | a7692ad1cc09ae52bb1a299a99a2d65fd6258553 | [] | no_license | scryver/scrutils | 17d6a6d04a6e203ff28bcdb91284d266ffde286b | c004145af13d8c4c7f7d55edaac240e5387509a8 | refs/heads/master | 2021-01-22T06:23:01.926616 | 2017-04-28T23:28:14 | 2017-04-28T23:28:14 | 81,754,682 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 20,041 | cpp | test_shader.cpp | #include <gtest/gtest.h>
#include "glmock.hpp"
#include "Scryver/OpenGL/Shader.hpp"
#include "Scryver/Math/Matrix4.hpp"
using Scryver::OpenGL::Shader;
using Scryver::OpenGL::shader_t;
using Scryver::OpenGL::uniform_t;
using Scryver::Math::Matrix4f;
const std::string brokenFile = "build/test/files/broken.glsl";
const... |
c4632f8e686ab3974f6ecae42a74df75966effd0 | 741da9d97b90ffb3d111aebfc71f9ae52ab79711 | /src/2DLineDrawings.cpp | b10a9ba88cce75fbaef5bc0ab9ef0201988be377 | [] | no_license | Joren-S/CG-Engine | 9918a4f2e17de2db2924f3613d50413702f01198 | d265d5871958c236aafcb586a516e5c814e28707 | refs/heads/master | 2021-09-15T05:54:14.262618 | 2018-05-27T13:21:13 | 2018-05-27T13:21:13 | 126,495,055 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,422 | cpp | 2DLineDrawings.cpp | //
// Created by joren on 21/04/2018.
//
#include "../headers/2DLineDrawings.h"
LineDrawing2D::LineDrawing2D(const ImageInfo *imgInfo) {
info = imgInfo;
}
img::EasyImage LineDrawing2D::LinesToImage(const LinesList2D &lines) {
// Variables
double x_min, x_max, y_min, y_max,
x_range, y_range;
... |
90b887c29bbe3cc7c259384bb71ed9dd139ac9db | efef070fea2d91ad8a698ad792bd46035f3a6b9c | /Tutorials/t76STLset.cpp | a982bac76eb4b559ee61c7fbaec38822af9ec893 | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | Aaryan-R-S/Cpp-Tutorials | 904782e611b00034379cdc6b41b08e32760d9f65 | 4bedec0971e043f9a4a91af7867d7775d3bb33b0 | refs/heads/master | 2023-04-22T21:21:55.294778 | 2021-05-09T11:41:21 | 2021-05-09T11:41:21 | 365,734,054 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 366 | cpp | t76STLset.cpp | #include<iostream>
#include<set>
#include<string>
using namespace std;
// no duplicate values
// sorted by default
// order of sorting can also be given
// logathmic complexity as it works on special type of tree
int main()
{
set<int> s1 = {1,9,7,4,5,6,3,2,4,5,6,5};
for (const auto&e: s1)
{
cout<<... |
341fd5ef7b843e8ab3315dcda79286ac2c1d33da | 1f515c64253d340a22436628623d68fd13ec3513 | /blingfirecompile.library/inc/FARSNfa_ar_judy.h | b4d3ba92ff01d90dfc352225f57845a534f18d9e | [
"LicenseRef-scancode-generic-cla",
"MIT"
] | permissive | microsoft/BlingFire | 92467240018cdbed9a3288b7f8d33f04bc9b28c5 | 5dad17aa31dd87c9992d9570ab0dd20e84246fa6 | refs/heads/master | 2023-08-20T23:43:13.448077 | 2023-06-27T13:00:11 | 2023-06-27T13:00:11 | 175,482,543 | 574 | 81 | MIT | 2023-06-27T13:00:13 | 2019-03-13T19:04:41 | C++ | UTF-8 | C++ | false | false | 3,165 | h | FARSNfa_ar_judy.h | /**
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License.
*/
#ifndef _FA_RSNFA_AR_JUDY_H_
#define _FA_RSNFA_AR_JUDY_H_
#include "FAConfig.h"
#include "FARSNfaA.h"
#include "FAArray_t.h"
#include "FAArray_cont_t.h"
namespace BlingFire
{
class FAMultiMap_ju... |
018fecd4df16d9629db6e18137131e6fa725cb50 | 8ca37e18b25d0b9cbf1ebe003f460ca3098e64ee | /homework5_4/main.cpp | 1506fc75a9e17c7df0b2ba4a04e4bfb13677b3bd | [] | no_license | FredyJMartinez/Coding-Problems- | b87d7ce83eb13f0338779fbf133326559cb9101f | 3948f356e2246d824b29ffa00ce94a05fd8ce61a | refs/heads/master | 2020-03-25T15:57:17.091381 | 2018-08-07T17:50:00 | 2018-08-07T17:50:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 671 | cpp | main.cpp | #include <iostream>
#include <vector>
#include "MinQueue.h"
int main() {
MinQueue a;
std::cout<< " Creating MinQueue object a and enqueuing values" << std::endl;
a.enqueue(5);
a.enqueue(4);
a.enqueue(2);
a.enqueue(6);
a.enqueue(1);
a.enqueue(3);
a.enqueue(-2);
a.displayQueue();
std::cout << " Th... |
18017e8a8fa4788d367ee41dacee35fad4f6694c | 85ea311b64319d745976412914d7dbd7b87d790f | /1052_Linked_List_Sorting.cpp | 22c8f45278f2bd89bac7966a534f1030e984a7bb | [] | no_license | h-hkai/PAT_ADVANCED | 2865418d5770ef46716221da6699d6041e3e306e | 7d3d0b5866eb494e513b131e0596ad8b0160c216 | refs/heads/master | 2023-04-10T13:21:04.301098 | 2021-04-23T13:39:35 | 2021-04-23T13:39:35 | 286,212,040 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,009 | cpp | 1052_Linked_List_Sorting.cpp | #include <bits/stdc++.h>
using namespace std;
struct Node {
int address;
int val;
int next;
};
bool cmp(Node a, Node b) { return a.val < b.val; }
int main() {
int n, head;
cin >> n >> head;
map<int, Node> mp;
for (int i = 0; i < n; ++i) {
int address, val, next;
cin >> ad... |
1143637835e2e799dcd654bcecded2b0be405b38 | 7dd1a7796a6c1e47dfdac036013c193f6bfdd142 | /Essential Math Tutorial 6 Starter/SpriteLib3.0-v2.0/Trigger.h | 0bbf01f0d7861ca56c09d483d7cc5702b9a3148e | [] | no_license | MsMarvel97/Animal-Crossing-Cobalt-Horizons | 434f714aca4c2aa4eeeef6f766ed037918666a99 | d664c54a7b302fe3a1e072ea2a9e60ba9e2abbf1 | refs/heads/main | 2023-01-23T06:21:08.894302 | 2020-12-06T21:57:00 | 2020-12-06T21:57:00 | 311,548,613 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,233 | h | Trigger.h | #pragma once
#include <vector>
#include "PhysicsBody.h"
class Trigger
{
public:
//Depreciated use OnEnter and OnExit instead
virtual void OnTrigger();
virtual void OnEnter();
virtual void OnExit();
void SetTriggerEntity(int triggerEnt);
int GetTriggerEntity();
void AddTargetMoveX(float x);
... |
53f91854dd14ec2059c5228288087865a7bf6d65 | 18bff2dd27cfbd0480c2f7b50fd437955fe47b87 | /build-tools/ssgnc-db-split.cc | 1e0363bdc78441e33f31574fadafea419fd6ef59 | [
"BSD-3-Clause"
] | permissive | xen/ssgnc | 44b42c88da32cea2fb0480e24d15facae8bdc75e | f40c581bb148b38b14f660dba8b9fe4653fecf14 | refs/heads/master | 2016-09-06T05:28:53.272911 | 2010-09-24T17:45:09 | 2010-09-24T17:45:09 | 33,755,852 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,282 | cc | ssgnc-db-split.cc | #include "tools-common.h"
namespace {
ssgnc::Int32 num_tokens;
ssgnc::VocabDic vocab_dic;
bool readNgram(ssgnc::ByteReader *byte_reader, ssgnc::Int16 *freq,
ssgnc::StringBuilder *ngram_buf)
{
if (!ssgnc::tools::readFreq(byte_reader, ngram_buf, freq))
{
if (byte_reader->bad())
SSGNC_ERROR << "ssgnc::tools::re... |
2af3a33a52d054963960499907e87f5c2426cf4d | 9abcffbd3b5ce320d193d99c0212776c5cc2b8f1 | /Read.h | ce99bb50d0f46b26d9045a321cd77cec9a33bba1 | [] | no_license | szmflis/OOP-WGGIOS | 0ffd1b3f56a113d4a9f85255dd75a4e08134b4a7 | 3074311a587f34d40386b09b4ee786cef993950e | refs/heads/master | 2023-02-03T23:13:16.728099 | 2020-12-23T18:57:23 | 2020-12-23T18:57:23 | 314,559,108 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 260 | h | Read.h | //
// Created by szymo on 12/22/2020.
//
#ifndef FLISSZYMON_ETAP1_READ_H
#define FLISSZYMON_ETAP1_READ_H
#include <string>
class Read {
public:
Read() = default;
double readNum();
std::string readString();
};
#endif //FLISSZYMON_ETAP1_READ_H
|
5b9d43862a2288895f80af2f3bac3e90e0687e8d | 7d283a9814a0052b99daccafa0825f2d3a2e2840 | /ParticalEffect/Screen.cpp | d5d752d8bfd1aaa47a2efa2fc795d5283e886dfd | [] | no_license | RadiumP/ParticalEffect | 186a2ad1d147cc4c55d0d2550fa950f92c45c014 | 10449c469c3c530bb5992c1af0a35e1f14ff3606 | refs/heads/master | 2021-01-11T18:46:51.528350 | 2017-02-04T23:20:23 | 2017-02-04T23:20:23 | 79,625,606 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,200 | cpp | Screen.cpp | #include "Screen.h"
#include <iostream>
Screen::Screen():
window(NULL), renderer(NULL),texture(NULL), buffer(NULL), buffer2(NULL)
{
}
Screen::~Screen()
{
}
bool Screen::init()
{
if (SDL_Init(SDL_INIT_VIDEO) < 0)
{
return false;
}
// init window
window = SDL_CreateWindow("Particle", SDL_WINDOWPOS_U... |
bf005e2a9330253cdd58f8518cd08a3fdc710375 | c2fe43fd81fb705e9d764fee57eeb8bc7e25a9db | /pl0-Lexer/pl0-Lexer/Token.h | bd15d381b1318dc8b2377eda32e907e27265df13 | [] | no_license | qmpzqaz/pl0-Lexer | 014ff03fa230c28995d29ad994927beb889de7f6 | fb3a100ea5fc6a28c9efb488234f4c8e6b454448 | refs/heads/master | 2021-01-10T04:52:29.952477 | 2016-03-26T12:11:41 | 2016-03-26T12:11:41 | 54,768,060 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 771 | h | Token.h | #pragma once
#include "Tag.h"
#include <string>
class Token {
public:
Token();
Token(std::string, Tag, int);
virtual ~Token();
Tag tag();
int lineno();
void set_tag(Tag);
std::string name();
virtual std::string ContentToString();
private:
std::string name_;
Tag tag_;
int l... |
aacd18612ac9a1917960bad6cf5b9d3217a0e277 | c0361e6cc93bea1a8b7fcdc43db80a8c46b929c8 | /server/server.cpp | 7689920b374d31fc767617839c7ab16b3a4f54c5 | [] | no_license | zoujiaqing/DistributedLevelDB | 2b51304fb11e1e6eb83071e44c803172727760cb | 43d03acc0bda64e7111865496873ce3a360a47dc | refs/heads/master | 2021-01-21T00:16:19.094563 | 2013-12-23T17:17:29 | 2013-12-23T17:17:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,763 | cpp | server.cpp | //server.cpp
#include "include/server.h"
server::server(const uint16_t port, const char* ip)
{
try
{
//socket construction:
if ((socket_fd=socket(AF_INET, SOCK_STREAM, 0))==-1)
throw SOCKET_CONSTRUCT_ERROR;
/* setsockopt: Handy debugging trick that lets
* us rerun the server immediately aft... |
1d14b70498f0e8b343fa79fb2a301a38036b41cd | 07faf13693a4770e4a1a0b951b397c976d4f529c | /Ouroboros/Source/test_services.h | 15cbc5e94ef44fc9542746051f0c7f0c48d85302 | [
"MIT"
] | permissive | dismalion/oooii | 5bb3a8b5f9c97c4d280e3380730bd6b170edaaf3 | 0866541aee7bef8fc4a877b8aac8bd7cdebde755 | refs/heads/master | 2021-01-10T13:02:43.269614 | 2014-09-24T05:25:43 | 2014-09-24T05:25:43 | 48,484,964 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,293 | h | test_services.h | // Copyright (c) 2014 Antony Arciuolo. See License.txt regarding use.
// This is an abstraction for the implementations required to run unit tests.
// Libraries in Ouroboros are broken up into dependencies on each other and on
// system resources. For example oBase is dependent on C++11/compiler features
// and... |
4db7caea3f43da951b82fd32d2800f61c9339887 | e6652252222ce9e4ff0664e539bf450bc9799c50 | /d0707/20160707/test/source/tyz-lps/elf.cpp | ffc1afc81594a9b257bd6e6f2df5d6d19a0d43ee | [] | no_license | cjsoft/inasdfz | db0cea1cf19cf6b753353eda38d62f1b783b8f76 | 3690e76404b9189e4dd52de3770d59716c81a4df | refs/heads/master | 2021-01-17T23:13:51.000569 | 2016-07-12T07:21:19 | 2016-07-12T07:21:19 | 62,596,117 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,253 | cpp | elf.cpp | #include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
char s[45];
char ss[45];
long long a[45];
long long t;
char tt[45];
int nex[45];
int n,m,sum;
void get()
{
int j=-1;
for(int i=0;i<m;i++)
{
while(j!=-1&&ss[i]!=ss[j+1]) j=nex[j];
if(ss[i]==ss[j+1]&&i!=0) j++;
nex[i]=... |
7d2988ea4632d49d685e9786674862e95bc974d2 | 4fcf2967da46f37c831b72b7b97f705d3364306d | /problems/acmicpc_14931.cpp | 5a1b059a468c7e5a5f5a6b58384d8b11d07b0064 | [
"MIT"
] | permissive | qawbecrdtey/BOJ-sol | e2be11e60c3c19e88439665d586cb69234f2e5db | 249b988225a8b4f52d27c5f526d7c8d3f4de557c | refs/heads/master | 2023-08-03T15:04:50.837332 | 2023-07-30T08:25:58 | 2023-07-30T08:25:58 | 205,078,469 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 423 | cpp | acmicpc_14931.cpp | #include <stdio.h>
using ll = long long;
int main() {
int n;
scanf("%d", &n);
auto a = new int[n + 1];
a[0] = 0;
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int idx = 0;
ll res = 0;
for(int i = 1; i <= n; i++) {
ll sum = 0;
for(int j = i; j <= n; j += i) {
sum += a[j];
}
if(!idx || res < s... |
b4bded96c8a2f4fae126171d7262bd7d3caf6416 | 95ab8a21dda989fde5b0796d1488c30128a01391 | /CodeForces/C++/1485E.cpp | 9181c0adff3b2d9e9d503f860bad887814f04885 | [] | no_license | neelaryan2/CompetitiveProgramming | caa20ffcdee57fb2e15ceac0e7ebbe4e7277dc34 | 959c3092942751f833b489cc91744fc68f8c65d2 | refs/heads/master | 2021-06-28T14:10:50.545527 | 2021-02-15T17:34:03 | 2021-02-15T17:34:03 | 216,887,910 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,954 | cpp | 1485E.cpp | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "trace.h"
#else
#define trace(args...)
#endif
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
using vpi = vector<pii>;
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define fi firs... |
9db033f4f393fe4a5f597f73dc419eab7843d89d | 174e4d6cdf38d9af67c2c3729ade5f427c9520a5 | /.vs/LandingOnRivalSpace/LandingOnRivalSpace/LandingOnRivalSpace.cpp | d416cf72d96837c1ccd48dfdd06a64248f9c3710 | [] | no_license | TheConfusedOne1/GDW-Group-16_Text-Boardgame | 145e6d8ea5507c44c74fb7e4e369172e0a0c44b7 | 55916e1faf17777565181ac961cc5b55c12c7504 | refs/heads/main | 2023-01-03T05:34:30.735272 | 2020-10-25T22:35:05 | 2020-10-25T22:35:05 | 306,154,210 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 69,559 | cpp | LandingOnRivalSpace.cpp |
void rivalpropertyLanding(int player)
{
switch (player)
{
case 1:
//if statements used to take player's health for landing on rival property
if (hpValues[player1Space] == 10 && propertySpaceOwnership[player1Space] == 3)
{
cout << "Player 1 has landed on an owned... |
06415dda2902aa7db978b93d2bed63ff1f026a3a | 9320d0e01bba4ea3b70b374a26d59703126cf449 | /MayaExporter/CPMMeshExtractor.cpp | 3627ce4d1cd179638725901964b43ce74f03d6fb | [] | no_license | sonmarcho/MayaExporter | 76b1acf35b5aa5b59a410150618aaf5c0a0f9291 | ae4288b0b9dcb418be9d1499a22a60f32a9f4c5e | refs/heads/main | 2023-02-19T14:51:41.076566 | 2021-01-12T22:22:49 | 2021-01-12T22:22:49 | null | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 19,021 | cpp | CPMMeshExtractor.cpp | #include <maya/MGlobal.h>
#include <maya/MPlug.h>
#include <maya/MPlugArray.h>
#include <maya/MFloatArray.h>
#include <maya/MFnSet.h>
#include <maya/MItMeshPolygon.h>
#include <maya/MItDependencyGraph.h>
#include <maya/MFnLambertShader.h>
#include <maya/MFnPhongShader.h>
#include <maya/MFnBlinnShader.h>
#in... |
6318a86b3895e0756bfd511b85fa21e8086b3d9b | 2203ee20758f34cd9252f473b7630de2781ddac9 | /Test/src/main.cpp | 2bb3c556a1968c50cdf8966a56c09d0811b33c72 | [] | no_license | michaelshanta/ESP32-IoT-3-Sensor-Dashboard | 5e36894578eaf083366c3c520d6d3d830316b4ee | d1116b868ef95cbecd1ce60e92027182361cca0c | refs/heads/master | 2022-04-13T00:57:34.150193 | 2020-01-29T11:10:21 | 2020-01-29T11:10:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,389 | cpp | main.cpp | #include <Arduino.h>
#include <WiFi.h>
#include <Wire.h>
#include <Adafruit_BME280.h>
#include <Adafruit_CCS811.h>
#include <Adafruit_Sensor.h>
#include <AWS_IOT.h>
#include <ArduinoJson.h>
#include <Preferences.h>
#include <DNSServer.h>
#include <WiFiManager.h>
#define SEALEVELPRESSURE_HPA (1013.25)
#define uS_TO_S_F... |
12dc80ba2e2e8bd627e09efd51425e5f96c31ea1 | a4de7672f460babe084d08afe08a6453a9d4c64a | /NextPermutation.cpp | 68cf3688ca09012d5f593329d72def3fbe6f1321 | [] | no_license | sulemanrai/leetcode | 3db0dd328ceb44bb43e15b00231c69b1aa437898 | 72ecdee5c6b7326eea90ddac6bb73959fce13020 | refs/heads/master | 2020-03-16T17:29:04.025572 | 2018-09-07T05:43:32 | 2018-09-07T05:43:32 | 132,834,334 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 447 | cpp | NextPermutation.cpp | #include<iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <map>
#include <functional>
using namespace std;
class Solution {
public:
void nextPermutation(vector<int>& nums) {
std::next_permutation(nums.begin(),nums.end());
}
};
int main()
{
//code
vector<int> nums1 = { 1,1,5 };... |
b4e8b4ed2ae0e3ef5dcb6adc126ce395b8d5ea7c | da113e2f5781ea5d8865366d1c0195858c0bf700 | /os_ass3.cpp | 07a3f77411117c18d38874756a5998e1a7880ed0 | [] | no_license | hg31099/Heap-Memory-management-simulator | c82bd29819f4e9a73d1bed40721c1f5ae9aa8435 | 1d753ba8d9b1aa92d4e727f829f061c9075e4a87 | refs/heads/master | 2022-11-11T14:22:03.673685 | 2020-06-28T17:16:28 | 2020-06-28T17:16:28 | 275,632,377 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,837 | cpp | os_ass3.cpp | #include<bits/stdc++.h>
#define heap_size 100
#define magic 515
using namespace std;
int curr=0;
int domalloc(int size,int arr[],int **headptr)
{
int temp;
int temp1,prev,flag,prevcurr;
if(curr==0)
{
if(size<=heap_size)
{
temp=curr+2;
arr[0]=size;
arr[1]=magic;
curr=curr+size+2;
... |
e406943f534ee3c94fa11cc8acbd9e722df3b73c | 954f7327fea0c8fa58a08e31fca0580ff543dab8 | /kernel/network.cc | 8cd4cdcc769bbbe7e15e7d88c16e5488d541bf89 | [] | no_license | Vexal/cs439hp12 | b58b603223cf4a1b51814de5d881be9e4f447020 | 21237aab68f76cab0b273437d21481fdae419407 | refs/heads/master | 2016-09-06T11:53:19.613364 | 2014-12-13T17:34:41 | 2014-12-13T17:34:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 20,435 | cc | network.cc | #include "network.h"
#include "machine.h"
#include "NetworkProcess.h"
Network* Network::KernelNetwork = nullptr;
unsigned char Network::myMac[6] = {0x52,0x54,0x00,0x12,0x34,0x56};
unsigned char Network::myIP[4] = {192,168,7,2};
int Network::debugLevel = 1;
bool hasBroke = false;
void Network::HandleNetworkInterrupt()... |
46429dc6b6f339d03a5892900f37de45e0e0e3fc | 0f14ddf7c637167f3bf9ae0c490f7e33611d37df | /ObjLoader/source/ObjManager.cpp | ebc726f98da78b366fcaf0ec27695bd1dc82f0dd | [
"MIT"
] | permissive | VytasSamulionis/TomorrowGame | 58ad044139111de868684fe4097ce8c805037316 | 91f17410c82dc69dc4f22e5d88ed3d7d7ee08422 | refs/heads/master | 2020-06-01T21:24:59.289089 | 2017-06-12T10:51:55 | 2017-06-12T10:51:55 | 94,084,784 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,687 | cpp | ObjManager.cpp | #include "..\include\ObjManager.h"
ObjManager::ObjManager (RenderDevice* _device):
m_Device (_device) {
try {
for (UINT i = 0; i < 6; i++) {
std::vector<Buffer> renderingBuffers;
Buffer buffer;
buffer.BufferId = INVALID_ID;
buffer.Num =... |
84d5397a39bf813a5d2b2eb3ecfc3414f50fe97b | 5e7452fce4f3112b55f72da92993b60998309d96 | /include/dataflow/domains/interval_domain.h | 79a13793f38be54560db2f44fa0857bf6512ff83 | [
"Apache-2.0"
] | permissive | Xazax-hun/domains | 6d227e0c556b590b698f69577b824737d5848b0a | b26d0e29ea2e0907bb595d059726575aee415ed8 | refs/heads/main | 2022-12-19T17:50:34.192110 | 2022-08-15T04:23:54 | 2022-08-15T04:23:54 | 479,840,519 | 0 | 0 | Apache-2.0 | 2022-06-18T21:38:57 | 2022-04-09T20:49:40 | C++ | UTF-8 | C++ | false | false | 2,887 | h | interval_domain.h | #ifndef INTERVAL_DOMAIN_H
#define INTERVAL_DOMAIN_H
#include <algorithm>
#include <cassert>
#include <fmt/format.h>
#include "include/dataflow/domains/domain.h"
struct IntervalDomain;
bool operator==(IntervalDomain lhs, IntervalDomain rhs) noexcept;
struct IntervalDomain
{
int min, max;
explicit IntervalD... |
70bbbb5265f3330aa3ea6107e3bff7fe4d712bc9 | 7cc5183d0b36133330b6cd428435e6b64a46e051 | /tensorflow/compiler/xla/service/gpu/gpu_device_info_test.cc | 130c99a9af6da9d4c117519265fd92b9f625fa3a | [
"Apache-2.0",
"LicenseRef-scancode-generic-cla",
"BSD-2-Clause"
] | permissive | shizukanaskytree/tensorflow | cfd0f3c583d362c62111a56eec9da6f9e3e0ddf9 | 7356ce170e2b12961309f0bf163d4f0fcf230b74 | refs/heads/master | 2022-11-19T04:46:43.708649 | 2022-11-12T09:03:54 | 2022-11-12T09:10:12 | 177,024,714 | 2 | 1 | Apache-2.0 | 2021-11-10T19:53:04 | 2019-03-21T21:13:38 | C++ | UTF-8 | C++ | false | false | 2,745 | cc | gpu_device_info_test.cc | /* Copyright 2022 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... |
ef635bb62879801d4a02d4ee7ca2d414dbac1b2a | 09eaf2b22ad39d284eea42bad4756a39b34da8a2 | /ojs/ksp/brazil17/s01e04/br17truck/br17truck.cpp | 058755e0a8ff263e8cc9e8ae03c8047157f30568 | [] | no_license | victorsenam/treinos | 186b70c44b7e06c7c07a86cb6849636210c9fc61 | 72a920ce803a738e25b6fc87efa32b20415de5f5 | refs/heads/master | 2021-01-24T05:58:48.713217 | 2018-10-14T13:51:29 | 2018-10-14T13:51:29 | 41,270,007 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 851 | cpp | br17truck.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
double dist[112];
const int M = 1123;
int a[M], b[M], c[M];
const double eps = 1e-11;
int main () {
int i, n, mm, k;
scanf("%d %d", &n, &mm);
for(i = 0; i < mm; i++)
scanf("%d %d %d", &a[i], &b[i], &c[i])... |
655232fb55fa541c47392d4b6195099c08959cea | bca5a1a1ba1f6f33392f38a02f6c84316d45de65 | /New Structure/src/strategy/pathfinding/PairWise/loader.h | b1a5729f59c403d9e9276537a6d4c2d4c0f4caa2 | [] | no_license | StpdFox/HU-TH78-Roborescue | 790a68728b0b4984b5146de7310820d33ebf9062 | 34302ee1f49fe38941fcc8edb3a90d512a8342b6 | refs/heads/master | 2021-05-29T18:50:37.230802 | 2015-04-22T12:46:06 | 2015-04-22T12:46:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 282 | h | loader.h | #ifndef LOADER_H
#define LOADER_H
#include <string>
#include <QString>
#include "map.h"
class Loader
{
public:
Loader();
~Loader();
Map getMap(QString);
private:
int lastX =0;
int lastY =0;
void processLine(QString);
Map product;
};
#endif // LOADER_H
|
ed0b55f8acdf29ff6f4cb203718ffd8f47a1c1ad | 2f250c8031394f145aef82556634b4559a63c02a | /oomact/src/test/SimpleModel.cpp | 8a7da2d3a0e844be2a5cd1e51bb20ab090f90909 | [
"BSD-2-Clause",
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | ethz-asl/oomact | 2defc0fec7b0f8dbe4bed2b9cd5a765e88f1d033 | cf8eade334cd6b35c9041b9ba1661e4a6bb85e02 | refs/heads/master | 2023-05-31T13:19:58.347201 | 2019-04-24T15:09:24 | 2019-04-24T15:09:24 | 79,255,946 | 22 | 12 | NOASSERTION | 2019-04-02T16:16:48 | 2017-01-17T18:04:34 | C++ | UTF-8 | C++ | false | false | 584 | cpp | SimpleModel.cpp | #include <aslam/calibration/test/SimpleModel.h>
#include <cmath>
#include <gtest/gtest.h>
#include <aslam/calibration/model/Model.h>
#include <sm/BoostPropertyTree.hpp>
#include <sm/value_store/ValueStore.hpp>
namespace aslam {
namespace calibration {
namespace test {
SimpleModel::SimpleModel(ValueStoreRef config,... |
1c93459958995ba6d86ca5c8a78f25201221e988 | c2b929ce308af8144b419d9b3f12a7cbe81e0cf1 | /Source/CommonUtilities/VectorOnStack.h | 41e614386c1d3b45d2e1dde90f7c9d5f975ba66c | [] | no_license | ebithril/AI | 8631b2fb1590251a6a250e14457da94a2c283a64 | 998170c54f501dd1cb26d3351cfe7ef133fd9afb | refs/heads/master | 2021-01-10T12:25:36.954599 | 2016-02-19T18:23:02 | 2016-02-19T18:23:02 | 52,106,954 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,151 | h | VectorOnStack.h | #pragma once
#include <assert.h>
#include <memory.h>
namespace CommonUtilities
{
namespace Containers
{
template <typename Type, int MaxSize, typename CountType = unsigned short, bool UseSafeModeFlag = true>
class VectorOnStack
{
public:
VectorOnStack();
VectorOnStack(const VectorOnStack& aVectorOnSta... |
da52f3de6538787fe8e107892502c43bb5a93828 | 2f10f807d3307b83293a521da600c02623cdda82 | /deps/boost/win/debug/include/boost/compute/interop/qt/qpointf.hpp | a0b9da748e904c79e0020e44a3bcc2fb6f7d8d44 | [] | no_license | xpierrohk/dpt-rp1-cpp | 2ca4e377628363c3e9d41f88c8cbccc0fc2f1a1e | 643d053983fce3e6b099e2d3c9ab8387d0ea5a75 | refs/heads/master | 2021-05-23T08:19:48.823198 | 2019-07-26T17:35:28 | 2019-07-26T17:35:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 128 | hpp | qpointf.hpp | version https://git-lfs.github.com/spec/v1
oid sha256:09717d757ea57979a883e9d836b60e6442008d00d079a115f8556a7721cf8ea8
size 699
|
5221c18da197c1d8419fd5ac471a84a71bc14489 | b1fb55354f46a21831c8350c9cd66928a6ad9b05 | /八皇后.cpp | 91aa8dffd41734ae6d099a690d1bb386c5756392 | [] | no_license | LemuriaX/luogu | 8e3163b2c6aa6efdc6e8de0ac7665973b6020766 | 580955adb3fa2a698968c9342bbbd3cb83c7aaf7 | refs/heads/master | 2022-09-21T16:57:33.135957 | 2020-04-22T15:19:54 | 2020-04-22T15:19:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 717 | cpp | 八皇后.cpp | #include<bits/stdc++.h>
using namespace std;
int n;
bool lie[20] = {false};
bool zuoxie[200] = {false};
bool youxie[200] = {false};
int sum = 0;
int z = 0;
int vis[20];
void dfs(int hang){
if(hang>n){
if(z <3 ){
for(int i = 1;i<=n;i++)
cout << vis[i]<<" ";
cout << endl;
z++;
}
sum++;
return;
}
... |
4de9be3e7c0aa7372b6d44e29ddcdd4424abe40c | 5aae14f6949e7178d7b153919b9af853fa740d2e | /Source/MythsAndLegends/Private/Items/BaseConsumable.cpp | e1dc4d26d5158229f94e04b47ad0a7a174b66bc6 | [] | no_license | SynGameDev/MythsAndLegends | cebae13a76298c587e54a61d51bb475cde510214 | 38c79ac2f1138446c42fec56c4c311f5f8ed1080 | refs/heads/master | 2023-02-11T08:17:40.473554 | 2020-12-29T14:24:21 | 2020-12-29T14:24:21 | 311,260,664 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,656 | cpp | BaseConsumable.cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "MythsAndLegends/Public/Items/BaseConsumable.h"
#include "MythsAndLegends/Public/Characters/SkillComponent.h"
ABaseConsumable::ABaseConsumable()
{
SpawnInWorld = true;
}
void ABaseConsumable::SpawnWeapon()
{
static const FStri... |
30558cf629e3ab90038734f199f5087996276dbb | 5a552d420ce16f986769dc36777e24e794438e58 | /reco/src/GlobalStatus.cpp | afb4dcb34e3195460f1b514c6a9d12efb11e8017 | [] | no_license | francisnewson/hnuprocess | 1379ff7f6bd1db0c17ebeb898b16977b43cc37e4 | 6139a1d7d2c6e2dd975eaf7e33f39525b888a4f6 | refs/heads/master | 2020-04-01T19:34:10.863826 | 2016-09-27T19:36:38 | 2016-09-27T19:36:38 | 30,983,514 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 691 | cpp | GlobalStatus.cpp | #include "GlobalStatus.hh"
#include "Event.hh"
namespace fn
{
FNEGStatus::FNEGStatus( const fne::Event * e, bool mc )
:e_( e ), mc_( mc )
{}
Long64_t FNEGStatus::get_run() const
{
return e_->header.run;
}
bool FNEGStatus::is_mc() const
{
return mc_;
}
... |
78e56354fe5e66242b033a0a5dc6417a20da6a26 | 0af4e95619ff9475c417ad0d29e14cb419744e54 | /Source/ProspectEngine/Renderer/Renderers/SunRenderer.h | 8b937b37cf925f7f05cf096b91b95e8a33e7c4d1 | [] | no_license | magnusmaynard/prospect-engine | ee85c8b16b495fa584d9e6c7d93d6a3eee62e98c | eb71eefc62b05705001f674021aeb6324033684f | refs/heads/master | 2023-04-05T03:47:26.425678 | 2018-10-18T18:05:20 | 2018-10-18T18:05:20 | 303,105,320 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,036 | h | SunRenderer.h | #pragma once
#include "Renderer/Pipeline/Shaders/Shader.h"
#include "Renderer/Uniforms/UniformBlocks.h"
#include "Renderer/Uniforms/UniformBuffer.h"
#include "Renderer/Pipeline/Shaders/SunShader.h"
#include "AtmosphereRenderer.h"
#include "RenderDataLibrary.h"
#include "Renderer/Renderers/RenderData.h"
namespace Pros... |
8d6091b5ffa093b4b598a9342ded7787187c37b0 | 4c48f69e6d44eb413e30a464a6bbcb188f38ec08 | /include/scene.hh | 8d484e20786c4b64059632e8d010f91e54d88025 | [
"MIT"
] | permissive | baptisteesteban/OpenGL-Project-V2 | 983feb2384409dd454e42dfb03234b546bd74544 | e18fca7468c12c0fde77e56e7ce16ebae02833db | refs/heads/master | 2020-09-14T13:42:56.305236 | 2020-02-07T02:02:21 | 2020-02-07T02:02:21 | 223,144,540 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 712 | hh | scene.hh | #ifndef SCENE_HH
#define SCENE_HH
#include <camera.hh>
#include <dialog.hh>
#include <object.hh>
#include <memory>
#include <vector>
class Scene
{
public:
Scene(const Camera& cam, SDL_GLContext context, SDL_Window* window);
void addObject(std::shared_ptr<Object> obj) noexcept;
void draw();
void update(const ... |
8b32ad8a79745c749cd8d5555ea42ac1ef40060f | a69413120ddb0b512fde5ab251e59a55d82101e0 | /sort0and1.cpp | ccde589baccc79e1ba0e3074660edafa40b500e0 | [] | no_license | Nikhil12321/codes | 7b0f62b7410ea78e3480e3414e747d2597e6f82f | 3ee73c3e2626c5d1271cb984b8fa102afeb5ad42 | refs/heads/master | 2021-01-21T04:30:54.378318 | 2017-06-29T18:08:10 | 2017-06-29T18:08:10 | 47,780,683 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 419 | cpp | sort0and1.cpp | #include<iostream>
using namespace std;
int main(){
int a[]={1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0};
int n = sizeof(a)/sizeof(int);
int ptr1=0,ptr2=1, temp;
while(ptr2<n && ptr1<n){
while(a[ptr1]==0 && ptr1<n)
ptr1++;
while(a[ptr2]==1 && ptr1<n)
ptr2++;
if(ptr2<n && ptr1<n){
temp = a... |
9ac63cb6941254d1687bb8bdc0748615722213f3 | e20ebc8bac4ebdf59c6960cb73e5a83bc2e696df | /CS216/project4/term.h | 16a7a68e3700bd1889593cb3ad943773afcfa267 | [] | no_license | darin-ellis7/University-Projects | c6620ddd0da94b6e24040600153ddf94fbaa8d61 | db0958f520d26ab37694f5240a2cd0687fd7cc63 | refs/heads/master | 2020-04-01T21:15:14.313808 | 2018-10-18T15:12:55 | 2018-10-18T15:12:55 | 153,646,062 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 903 | h | term.h | #ifndef TERM_H
#define TERM_H
using namespace std;
class term
{
public:
// default constructor
term();
// initialize with the given query string and weight
term(string q, long w);
// compares two terms in descending order by weight
static int byReverseWeightOrder(term that, term other);
// compares two... |
97be1f7f570821d59c19991b12c06953e9a01d6f | 10af7cddaadb4a222cc8c1ff137205e866e06a41 | /Lecture Notes/L4andL5.cpp | a3ccd7baad8d2ddf751838a7793e95540b53f17c | [] | no_license | nickirichter/CSCI2270 | a6e3e6991bd458870ead7af80290e65219882740 | 8a7bd4535b01ca3dd1dae6a7c28db7655ea1b0d3 | refs/heads/master | 2020-03-24T01:33:29.643733 | 2018-07-25T19:21:20 | 2018-07-25T19:21:20 | 142,341,550 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,916 | cpp | L4andL5.cpp | //Jan. 24 2018
//Number Bases and Pointers
#include <iostream>
using namespace std;
void passByvalue(int a)
{
a++;
}
void passBypointer(int *ptr)
{
cout<<ptr<<" address stored in ptr"<<endl;
*ptr=*ptr+1;
}
void passByReference(int &a)
{
//input is reference/address of a
a++;
}
void passByArray(int *a) //could a... |
50d849c9cd3757167350f05b8cd0e4b6a50ad51c | feb35ca6518e988edc42e946d361b2bb26703050 | /earth_enterprise/src/third_party/sgl/v0_8_6/src/SkGlobals.cpp | fb1c9482d45187a1e6734f49857061183857446d | [
"Apache-2.0"
] | permissive | tst-ccamp/earthenterprise | ccaadcf23d16aece6f8f8e55f0ca7e43a5b022fe | f7ea83f769485d9c28021b951fec8f15f641b16c | refs/heads/master | 2021-07-11T07:10:57.701571 | 2021-02-03T22:03:13 | 2021-02-03T22:03:13 | 86,094,101 | 2 | 0 | Apache-2.0 | 2021-02-03T22:10:41 | 2017-03-24T17:29:52 | C++ | UTF-8 | C++ | false | false | 2,174 | cpp | SkGlobals.cpp | /* libs/graphics/sgl/SkGlobals.cpp
**
** Copyright 2006, Google Inc.
**
** Licensed under the Apache License, Version 2.0 (the "License");
** you may not use this file except in compliance with the License.
** You may obtain a copy of the License at
**
** http://www.apache.org/licenses/LICENSE-2.0
**
** Unless ... |
5315a698558f0f31c505f74655370d2b4cdc3451 | 189f52bf5454e724d5acc97a2fa000ea54d0e102 | /ras/floatingObject/2.6/epsilon | b7df405c0b6df08d6bf317949c84fed0123e4336 | [] | no_license | pyotr777/openfoam_samples | 5399721dd2ef57545ffce68215d09c49ebfe749d | 79c70ac5795decff086dd16637d2d063fde6ed0d | refs/heads/master | 2021-01-12T16:52:18.126648 | 2016-11-05T08:30:29 | 2016-11-05T08:30:29 | 71,456,654 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 248,436 | epsilon | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v1606+ |
... | |
118738bc1c53d3e0bc6be2946b62f033d1c14c68 | d9d520fc16006a6e77a3deb940c4af460e2b89a9 | /Progetto/Sim800l.ino | 28ba40933129c227b5b4b21992c2cedfe61131f2 | [] | no_license | EnricoMenegatti/Localizzatore | 8ebe200098616aaed86ec824df9aeb724f1310e8 | c2983ab917383bd4029bd7331f381fb0a91e8fed | refs/heads/master | 2020-05-07T20:34:02.080956 | 2019-04-16T05:56:53 | 2019-04-16T05:56:53 | 180,866,451 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,055 | ino | Sim800l.ino |
void SIM_Setup()
{
gsm.start(9600);
gsm.listen();
Serial.print("Manufacturer:\t\t");
Serial.println(gsm.moduleManufacturer());
delay(250);
Serial.print("Model:\t\t\t");
Serial.println(gsm.moduleModel());
delay(250);
Serial.print("Revision:\t\t");
Serial.println(gsm.moduleRevision());
delay(250);... |
7d7d248043655a70a2a5f1ae664ce0ebc0f10ad9 | 906e77c7ff16e8a5ffb67995f247ded73a69dd59 | /Cpp/SDK/UI_Crosshair_parameters.h | 9b359b8501b9652d8e0a5501634a6b07dda6a22d | [] | no_license | zH4x-SDK/zPolygon-SDK | d49400829f1d4b7ec63ff6bebd790dd8d96bb8eb | 3ff60c347b015d858779b8fd2308239176f1ed01 | refs/heads/main | 2023-07-25T12:16:54.962926 | 2021-08-27T14:17:29 | 2021-08-27T14:17:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,262 | h | UI_Crosshair_parameters.h | #pragma once
// Name: Polygon, Version: 0.3.13.76
/*!!DEFINE!!*/
/*!!HELPER_DEF!!*/
/*!!HELPER_INC!!*/
#ifdef _MSC_VER
#pragma pack(push, 0x01)
#endif
namespace CG
{
//---------------------------------------------------------------------------
// Parameters
//---------------------------------------------------... |
18969735dba2b617af3b6acd705ed723bd926822 | 0355822ea6562628d4023ae8b65b2fc3bddd153b | /src/text-analyzer.cpp | eb064144fc2fd5776a44a9178813cfa61008fcf1 | [] | no_license | yakovlev-alexey/cross-reference-red-black-tree | 2ff58529be436152f60938239c25d466c2be0298 | 40b22d48e1af9ada77bec20dc6738d97d8f5177f | refs/heads/master | 2022-07-31T18:27:57.461679 | 2020-05-24T15:25:38 | 2020-05-24T15:25:38 | 256,967,133 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,551 | cpp | text-analyzer.cpp | #include "text-analyzer.hpp"
#include <regex>
#include <string>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <stdexcept>
#include <functional>
#include "list.hpp"
#include "map.hpp"
TextAnalyzer::TextAnalyzer() :
dictionary{ }
{ }
TextAnalyzer::TextAnalyzer(TextAnalyzer && other) noexcep... |
4f03d8360e473fc4706aa97ea02dcdf05c38edaf | d1dc915fd1108b5bf73ed844fa0dcb414bd4825e | /AGame/BarrierBase.cpp | 8a0b930190d46d2e8446973bcc016aa5831e15ed | [] | no_license | WladWD/AndroidGame | 1c359066951ca1d0393b3afc7c84508ef741726d | a145840c1abe0b03ac39da55212b7167afc33cd9 | refs/heads/master | 2021-01-13T03:34:17.980269 | 2019-03-04T22:03:23 | 2019-03-04T22:03:23 | 77,531,014 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,451 | cpp | BarrierBase.cpp | #include "BarrierBase.h"
Barrier::BarrierBase::BarrierBase(Draw::Barrier *mBarrier, Camera::MCamera *cCamera, float fHeight) : fHeight(fHeight), fAngle(0.0f), cCamera(cCamera),
PI(3.1415926f)
{
//mWorld_OOBB = glm::mat4(1.0f);
//Init();
mDeltaConst = std::rand() & 1 ? 1.0f : -1.0f;
fAngle = (static_cast<float>(s... |
5051b03e2fe6ae9ac77a73357d723e7c156d49e7 | 10e48d2b31ad0cbf1f321dc7bd59d800873ddcad | /examples/qqtserverexample/mainwindow.cpp | ec18cf308926666f757ad3d4d217d5b11b277a89 | [] | no_license | Qt-Widgets/LibQQt-Widgets-Collection | 5393ba76abbf2d152c3c7f0c0ab86d733147d882 | 9db5b678fefd2efa1eb5f2565aad5e48df2bdf18 | refs/heads/master | 2020-11-28T02:57:24.183536 | 2019-11-29T07:30:57 | 2019-11-29T07:30:57 | 229,687,198 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,123 | cpp | mainwindow.cpp | #include "mainwindow.h"
#include "ui_mainwindow.h"
MainWindow::MainWindow ( QWidget* parent ) :
QMainWindow ( parent ),
ui ( new Ui::MainWindow )
{
ui->setupUi ( this );
pm0 = QQtServerInstance ( this );
//pm0 = QQtServer2Instance(this);
connect ( pm0, SIGNAL ( notifyToBusinessLevel ... |
5c12e7b42657924f3ef3ed7c64ed8b1d9ab78ed8 | 344698fe022c42c25074328cea0437945658e554 | /8_LinkedList/Leetcode_206_ReverseLinkedList.cpp | b0762766588eb30d2199f3cd9792783e1c6360bd | [] | no_license | cotecsz/WayOfOffer-Phase2 | 249dd39f7c4ea41cc4266004e317fd6e075d85bf | 75c6cc73fe100f5c48912d64e4609751e01f9625 | refs/heads/master | 2023-02-05T12:15:23.958782 | 2020-12-21T04:08:15 | 2020-12-21T04:08:15 | 313,908,739 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 925 | cpp | Leetcode_206_ReverseLinkedList.cpp | //
// Created by dream on 2020/11/27.
//
/*
* Leetcode 206 反转链表
* 双指针法：cur 指向当前节点，pre指向当前指针的前一个节点，
*
*/
#include "LinkedList.h"
class Solution {
public:
ListNode *reverseList(ListNode *head) {
ListNode* cur = head;
ListNode* pre = nullptr;
while (cur){
ListNode* tmp = ... |
5e80534f0ef7d1959d9b92778fa54c06272076f6 | 1d16fdcbd5fbd91d8325170cb74115a045cf24bb | /CSCommon/Source/MQuestMap.cpp | 6d53a314fd17dfb7e4d5608fbc5de83938658871 | [] | no_license | kooksGame/life-marvelous | fc06a3c4e987dc5fbdb5275664e06f2934409b90 | 82b6dcb107346e980d5df31daf4bb14452e3450d | refs/heads/master | 2021-01-10T08:32:53.353758 | 2013-07-28T18:15:09 | 2013-07-28T18:15:09 | 35,994,219 | 1 | 1 | null | null | null | null | UHC | C++ | false | false | 12,385 | cpp | MQuestMap.cpp | #include "stdafx.h"
#include "MQuestMap.h"
#include "MZFileSystem.h"
#include "MDebug.h"
/////////////////////////////////////////////////
MQuestMapCatalogue::MQuestMapCatalogue()
{
}
MQuestMapCatalogue::~MQuestMapCatalogue()
{
Clear();
}
MQuestMapsetInfo* MQuestMapCatalogue::GetMapsetInfo(int nMa... |
2a62b621da18d532a2589b7cf8c867f2fbd20c89 | e9cf4952514ccb929efdc398ee4692239cfbf5db | /src/chapter1/any_example.cpp | 56aef25d9adab5a640491ed1a6be3c93803ba48a | [] | no_license | Nathaniel100/BoostCookbook | 0949f79e04355467d1053546a4ff8c6bef3922f2 | cb13e0cf5865b4d994eb0099a14b5125014cb5f0 | refs/heads/master | 2023-04-13T03:55:31.393932 | 2017-03-31T01:03:05 | 2017-03-31T01:03:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 495 | cpp | any_example.cpp | //
// Created by 吴凡 on 2017/3/5.
//
#include <boost/any.hpp>
#include <vector>
#include <string>
#include <iostream>
int main() {
std::vector<boost::any> some_values;
some_values.push_back(10);
const char *string_value = "Hello World";
some_values.push_back(boost::any(string_value));
some_values.p... |
f2847759124b9a4bcab68494cc9eac6cd4bc201d | 1fb1ba908668d3fe996d8fcdbe584b4afa930fb5 | /practica parte 2.cpp | ca3fcc7487a2b426a42a3f89423bec9b9e0a4513 | [] | no_license | sebpost2/Sebastian-Gonzalo-Postigo-Avalos | 58e6234ecb75bee4ad191bc48dc7c7832e831273 | c189cc2b4f83761566b076504f5400fa869ce366 | refs/heads/main | 2023-05-04T20:30:11.385642 | 2021-05-28T15:45:00 | 2021-05-28T15:45:00 | 351,896,887 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 266 | cpp | practica parte 2.cpp | #include <iostream>
#include <sstream>
int main()
{
std::string A;
int B;
std::cout << "Ingrese un numero\n";
std::cin >> A;
std::stringstream change;
change << A;
change >> B;
std::cout<<"\n";
std::cout << A;
}
|
c9729e742db15c22843c92c7c43345eb6196e6dd | c2c2fa716c3604103ce439b54b18dc2a3bd8371c | /PathFinder/Source/RenderPipeline/RenderPasses/DenoiserForwardProjectionRenderPass.cpp | 0119898b2d3be76ef89ee527a9530108dd662d52 | [] | no_license | fenghuayumo/PathFinder | 56dd00d4767b0cb64c5f80d8b2e46e4363ac3ae4 | df79ea78fa67c7720ac2ce196f8116ead4b84d1e | refs/heads/master | 2023-04-20T00:19:50.271409 | 2021-05-05T10:45:29 | 2021-05-05T10:45:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,867 | cpp | DenoiserForwardProjectionRenderPass.cpp | #include "DenoiserForwardProjectionRenderPass.hpp"
#include "UAVClearHelper.hpp"
#include <Foundation/Gaussian.hpp>
namespace PathFinder
{
DenoiserForwardProjectionRenderPass::DenoiserForwardProjectionRenderPass()
: RenderPass("DenoiserForwardProjection") {}
void DenoiserForwardProjectionRenderPass:... |
88a3c4a0ddd27f64b347d7cc8545db42205edd22 | ca97444b0a8f8aafb2f97fa332507a5102480f1b | /src/dsao/cdq/2d_lis.cpp | 8552a13fd7745b322e030c37b04a11adf2f9d729 | [
"MIT"
] | permissive | houzaj/ACM-CheatSheet | 5bedf470f93a7f0adeffefbb4b47a75f79f40f17 | d35695acedc9744486257109ce4ec1fd65fcc6f4 | refs/heads/master | 2020-09-01T17:56:07.399740 | 2019-12-04T05:54:06 | 2019-12-04T05:54:06 | 219,021,015 | 1 | 0 | MIT | 2019-11-01T16:18:51 | 2019-11-01T16:18:50 | null | UTF-8 | C++ | false | false | 3,591 | cpp | 2d_lis.cpp | #include <bits/stdc++.h>
using namespace std;
const int N = (int)5e4 + 15;
struct info {
int h, v, idx, dp;
double cnt;
};
struct Tree {
int len;
double sum;
Tree(): len(0), sum(0) {}
Tree(int len, double sum): len(len), sum(sum) {}
};
info a[N], b[N];
int mph[N], mpv[N];
Tree tree[N];
inline ... |
a0f7dbddcc2e7e9f301622f4c223fb5538f4c573 | d4e36f9d7870f538efbf76507165d47ef60f9474 | /src/utils/utils.h | fd9e5fa3faf026ce95633a45ef1c4e17f48f36dd | [] | no_license | jfellus/pgdb | 6761511831a2692e819ca70ba240daf83147d95c | 21d82c3f30593e3e8c8b4850aea148e720df5916 | refs/heads/master | 2021-01-10T09:08:43.747778 | 2016-04-02T17:36:57 | 2016-04-02T17:36:57 | 55,307,703 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 742 | h | utils.h | /*
* utils.h
*
* Created on: 22 mai 2015
* Author: jfellus
*/
#ifndef UTILS_H_
#define UTILS_H_
#include <vector>
#include <algorithm>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <pthread.h>
#include <string.h>
#include <iostream>
#include <string>
template <typename T> class array... |
2ae4fa3d45fc30868997661a78cea1073b45d03d | 1274004bfb34d61dfcab1f68fcb3847dd46103f5 | /a bperc.cpp | 3660421a8828750d5bedaf026e6cb7f9d308d10b | [] | no_license | Marinska/sederhanakan-bilangan-pecahan | f65685bad3f3ddd7c62ffb81167a9d0cb066f5b9 | 1dbe3098ac1148a22596377f4b061c5fda07d3e6 | refs/heads/master | 2020-04-11T20:55:24.571484 | 2018-12-17T07:06:06 | 2018-12-17T07:06:06 | 162,084,706 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 356 | cpp | a bperc.cpp | #include <iostream> //Nama Umar Ibnu Zainal M
using namespace std; //NIM 311810909
void logika(int a,int b,int c,int ab)
{
a=b/c;
ab=b%c;
cout<<"Nilai dari pecahan "<<b<<"/"<<c<<" adalah "<<a<<" "<<ab<<"/"<<c;
}
int main()
{
int a,b,c,ab;
cout<<"Masukan nilai pembilang : ";
cin>>b;
cout<<"Masukan nilai penyebut... |
001b31bccd7110e9a1ea684d0b00861e2a7acb5a | 29f7b4b92521b75edaf209affd2c0aae47a9a0e4 | /topics/objective_state/autotuner_configuration/include/autotuner_configurationPlugin.h | 2858e7ca684862d4c89c6fe93980cbdfae9b7db4 | [] | no_license | nyhnpya/edge_data_models | c8b78984c7ddd82871bdc2aa11c418c8f29c7159 | ab8e6cddd9d3bd3b54966fdc3d1974f9a20a7cee | refs/heads/master | 2022-10-21T20:19:51.973699 | 2019-02-25T09:22:39 | 2019-02-25T09:23:50 | 124,416,324 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 74,657 | h | autotuner_configurationPlugin.h |
/*
WARNING: THIS FILE IS AUTO-GENERATED. DO NOT MODIFY.
This file was generated from autotuner_configuration.idl using "rtiddsgen".
The rtiddsgen tool is part of the RTI Connext distribution.
For more information, type 'rtiddsgen -help' at a command shell
or consult the RTI Connext manual.
*/
#ifndef autotuner_conf... |
0571ee125243f655cf0e030138518928ae2757eb | 8a5d84a7ef3b6ce37505b7d154878dfb55841ed0 | /field.cpp | 279d1ec713909661eeda018534dcc1d33e24cad9 | [] | no_license | llislex/life_game | a262a65334fda3d883847069cd83852238d8ff81 | 3e2e9082174ed51c5a7f33e2cbfbe3dfd6d0102f | refs/heads/master | 2021-05-20T18:58:55.901014 | 2020-04-02T07:14:00 | 2020-04-02T07:14:00 | 252,381,557 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 333 | cpp | field.cpp | #include "field.h"
#include <QtGui/QPainter>
LifeField::LifeField(QWidget *parent) :
QWidget(parent), m_life(0)
{
}
void LifeField::paintEvent(QPaintEvent*)
{
if(m_life)
{
QPainter painter(this);
QImage img = m_life->field();
painter.drawImage(rect(), img, img.rect())... |
d96b995a430e6e7f8ad7e341b55429ef62c5c998 | 6f50cc6d20ca8ee6664ddff005a595732eab88f4 | /src/node/network_tables.h | 9785592a6c231b212c96fbbae8aa9cb363cebdca | [
"Apache-2.0"
] | permissive | Saiprasad16/CCF | 032fccd9270f8aa0327f2a229185fe71ca822db3 | 9db09d03d77b3e006307f516df07d056e9a462f5 | refs/heads/main | 2023-04-26T23:38:27.109892 | 2021-05-07T17:06:12 | 2021-05-07T17:06:12 | 365,998,998 | 1 | 0 | Apache-2.0 | 2021-05-10T10:16:24 | 2021-05-10T10:10:20 | null | UTF-8 | C++ | false | false | 4,163 | h | network_tables.h | // Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the Apache 2.0 License.
#pragma once
#include "backup_signatures.h"
#include "certs.h"
#include "client_signatures.h"
#include "code_id.h"
#include "config.h"
#include "consensus/aft/raft_tables.h"
#include "consensus/aft/request.h"
#include... |
855cb12e829384ffd5e3ceaf377ddd9d4ec0017f | 2f3bdbb4ec4e382a320a460aab6275bb61b3b31b | /Source/Shared/Source/AI/AIHordelingTypeComponent.cpp | eff93834b6d0f8d94c628b683e2d301b495d6330 | [] | no_license | jjzhang166/Ursine3D | b23e88e87f6513d41968638c17412d2aab59484e | c5a806a7623bcd3c7a16dcd6b40033c2f912aad6 | refs/heads/master | 2023-03-22T18:25:51.138505 | 2018-05-17T01:21:47 | 2018-05-17T01:21:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 736 | cpp | AIHordelingTypeComponent.cpp | #include "Precompiled.h"
//#include "Entity.h"
#include "AIHordelingTypeComponent.h"
namespace ursine
{
namespace ecs
{
NATIVE_COMPONENT_DEFINITION(AIHordelingType);
AIHordelingType::AIHordelingType(void)
: BaseComponent()
, m_type(HordelingTypeID::INVALID_TYPE)
... |
01d9020907c984a826b83b238dcc2ff0252c2f15 | 1e0f12cd4c682f5f50e34e827bbe2cded0c725d5 | /10829.cpp | fb0160fdc3c6bc36a846d2bd7482b7c788e6fa7e | [] | no_license | kyun2024/ProgramSolve | 4f11d5ff67c799e867b6462c4da35edcca9a9d9d | ba2f8fdbe8342dd99de49cd00fd538075849dc53 | refs/heads/master | 2023-08-21T18:11:27.161772 | 2023-08-09T11:23:43 | 2023-08-09T11:23:43 | 209,213,217 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 280 | cpp | 10829.cpp | #include <iostream>
#include <stack>
using namespace std;
stack<int> s;
int main(){
long long n;
cin >> n;
while(n){
s.push((n&1));
n>>=1;
}
while(!s.empty()){
cout << s.top();
s.pop();
}
cout << endl;
return 0;
} |
b1d2f2a4316570bedd9ab11afc313ee3819b564b | 3c1bf8adcfa75f62cec3ced9c8a4bdf108526d78 | /Graph/7. Bipartite Checking using BFS.cpp | 7774ecb25170834542a85373175fd6d862970a20 | [] | no_license | shrayansh95/Data-Strunctures-And-Algorithms | dad330c172d3d02bf6d830048228c6f28cd7290b | 3044f1e0babde2182cdc1c0162b58b0cf55ec51a | refs/heads/master | 2023-06-19T00:30:56.497679 | 2021-07-21T11:44:08 | 2021-07-21T11:44:08 | 371,878,208 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 868 | cpp | 7. Bipartite Checking using BFS.cpp | #include<bits/stdc++.h>
using namespace std;
bool bfs(int i, vector<int> adj[], vector<int>& color) {
color[i] = 0;
queue<int> q;
q.push(i);
while (!q.empty()) {
int node = q.front();
q.pop();
for (int it : adj[node]) {
if (color[it] == -1) {
color[it] = color[node] ^ 1;
q.push(it);
} else if (... |
4be499833c38331c54565deb6979fedae781676b | 7c07918c82e76d86268fd873de723b3773f847b7 | /letterGrade.cpp | 0c4d05e6c5481d3769271b538bdfe8c52cb8e320 | [] | no_license | jonmancia/C-plus-plus | 2e5dd61c80d3bf9cbf7b6dd651d75de94b1fb85d | 4e57550b1615c87349c9d0fab020dba4b8b1876f | refs/heads/master | 2021-01-21T11:37:48.614597 | 2017-07-08T00:39:36 | 2017-07-08T00:39:36 | 91,749,411 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 508 | cpp | letterGrade.cpp | #include <iostream>
using namespace std;
char getGrade();
int main()
{
char grade = getGrade();
cout << "You grade is " << grade;
return 0;
}
char getGrade()
{
char grade;
cout << "Please enter your letter grade: ";
cin >> grade;
grade = toupper(grade);
while (grade != 'A' && grade != 'B' && gr... |
d8d6620000e88a7a60d3d55a04053d2d8093356a | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/inetcore/outlookexpress/inetcomm/dll/factory.cpp | e090faa4993b869fde85b88298dfa94753f33576 | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 23,901 | cpp | factory.cpp | // --------------------------------------------------------------------------------
// Factory.cpp
// Copyright (c)1993-1995 Microsoft Corporation, All Rights Reserved
// Steven J. Bailey
// --------------------------------------------------------------------------------
#include "pch.hxx"
#include "dllmain.h"
#... |
d1a2b5153842e0b8299e241191b9330dde036103 | 9a13ae4313e5fc26a2c78b90b9cd3adbc7c23608 | /2_13.cpp | 07f52b6f91a85740552c71a06d64f4fb287b4d23 | [] | no_license | Greenka2016/Practice | 24bbbd29a2ae333a618f34b01ca89a891145e0b9 | d1acf98f255410c27fac452439e5c572cf5eedb9 | refs/heads/main | 2023-02-04T06:38:18.811505 | 2020-12-23T12:28:36 | 2020-12-23T12:28:36 | 312,704,550 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 483 | cpp | 2_13.cpp | #include <iostream>
using namespace std;
#include <cmath>
int main()
{
float a, b, c;
cout << "a*x^2 + b*x + c = 0 \n";
cout << "a: ";
cin >> a;
cout << "b: ";
cin >> b;
cout << "c: ";
cin >> c;
float d = pow(b, 2) - 4 * a * c;
if (d < 0)
{
cout << "Net reshenia";
}
else if (d == 0)
... |
c3796fccccad57abefc603333ca5cdcbc3ae25fa | 1c7e660ca61e4377675ca3be7c327a42d007d75f | /g/ARIGEOM.cpp | 89f232e06ab2e0cfe205a86fee83e6831c2ba22f | [] | no_license | pankaj4u4m/Algorithms | 5590bdcdf691a81777f8b0ba3462f8788323f0ec | fddf1188cc2ced818f5e923dc81891218260b547 | refs/heads/master | 2021-01-20T12:13:00.625878 | 2013-12-30T17:03:36 | 2013-12-30T17:03:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,969 | cpp | ARIGEOM.cpp | // Author: pankaj kumar, pankaj4u4m@gmail.com
#include <cassert>//c headers in c++
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>//c++ headers
#include <bitset>
#include <complex>
#include <deque>
#... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.