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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
73454d7e45286935f4ed510e78327d3ec4b482c3 | c55b9c3db364ee8259651e857878b776c4bdb724 | /cpp/mountainview/src/msv/views/clusterdetailview.h | 14cb64f662a681dafbf64d978f5832f76d7fc33b | [] | no_license | flatironinstitute/mountainview | 7fdf94a0da33fe27e4728cb62e192e03ecb9fcfa | a87a587726b401a99430ec76c787d3de73569d50 | refs/heads/master | 2021-09-06T03:30:10.788265 | 2018-02-02T02:13:26 | 2018-02-02T02:13:26 | 107,665,822 | 2 | 1 | null | 2018-02-01T14:56:53 | 2017-10-20T10:37:11 | C++ | UTF-8 | C++ | false | false | 2,859 | h | clusterdetailview.h | /*
* Copyright 2016-2017 Flatiron Institute, Simons Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required ... |
6fbbb091cd4ad07b672819f5b97edece6b971c87 | 6881369b3876a47418e239329594f2e1eab1a124 | /pfs_file_server.cpp | 347ebc4febcaa6729525532bc889acbd08494ad8 | [] | no_license | arminvakil/PFS | bce9fe04b6f245fbf284a4f3ca29c295cf8bc8c6 | e783b53097eadc591973a463cb6dc9e3a2b37759 | refs/heads/master | 2021-01-16T08:15:39.022486 | 2020-09-18T17:55:53 | 2020-09-18T17:55:53 | 243,038,529 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,257 | cpp | pfs_file_server.cpp | /*
* pfs_file_server.cpp
*
* Created on: Nov 28, 2019
* Author: armin
*/
#include <iostream>
#include <memory>
#include <string>
#include <grpcpp/grpcpp.h>
#include "message.grpc.pb.h"
#include "file_server.h"
using grpc::Server;
using grpc::ServerBuilder;
using grpc::ServerContext;
using grpc::Status;
... |
df76a597b6d0b681af53a0acd70fd6eeacbc93ef | 94e5a9e157d3520374d95c43fe6fec97f1fc3c9b | /Light OJ/1236.cpp | 1f358cba93b5cb2532f13902ce49661ff28b785e | [
"MIT"
] | permissive | dipta007/Competitive-Programming | 0127c550ad523884a84eb3ea333d08de8b4ba528 | 998d47f08984703c5b415b98365ddbc84ad289c4 | refs/heads/master | 2021-01-21T14:06:40.082553 | 2020-07-06T17:40:46 | 2020-07-06T17:40:46 | 54,851,014 | 8 | 4 | null | 2020-05-02T13:14:41 | 2016-03-27T22:30:02 | C++ | UTF-8 | C++ | false | false | 9,232 | cpp | 1236.cpp | #pragma comment(linker, "/stack:640000000")
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const int INF = 0x7f7f7f7f;
const double PI=acos(-1.0);
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define MP(x, y) make_pair(x, y)
#... |
a2eb04457e76cf07992b7d20e9d6607ab42553b4 | 299fa324c437c1fe468189a67d28331a361b301f | /Code/Vector2.cpp | 1fcf1b013902c09492c3a9c0028152c45da665ba | [] | no_license | ClementCapart/FengShuiEngine | 247504835ded294e30042a19560c74afe4b8054e | 907b11d505e0e5c15779b9a0e86b4878a4f8795b | refs/heads/master | 2021-06-09T18:07:10.134363 | 2017-01-15T21:44:39 | 2017-01-15T21:44:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 816 | cpp | Vector2.cpp | #include "FengShuiEngine_PCH.h"
#include "Vector2.h"
#include <cmath>
float Vector2::Length() const
{
return sqrt(SquaredLength());
}
float Vector2::SquaredLength() const
{
return (X * X) + (Y * Y);
}
Vector2 Vector2::Normalized() const
{
float length = Length();
return *this / length;
}
Vector2 Vector2::Invers... |
1569672ea2845d6a4b979b875eff034dd7d566d9 | a090af918e3ec59140027dbddd54aa4ca1c73910 | /Algo/bitmask_ternary.cpp | d1f4b87ec883dca932d385ba7349ae918b6aa85e | [] | no_license | nitesh-147/Programming-Problem-Solution | b739e2a3c9cfeb2141baf1d34e43eac0435ecb2a | df7d53e0863954ddf358539d23266b28d5504212 | refs/heads/master | 2023-03-16T00:37:10.236317 | 2019-11-28T18:11:33 | 2019-11-28T18:11:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,956 | cpp | bitmask_ternary.cpp | #include<bits/stdc++.h>
#define LL long long
using namespace std;
int n;
int w[12], c[12];
bool arr[12][12];
int power[12];
int dp[12][2*59050];
inline void precal()
{
power[0]=1;
for(int i=1; i<11; i++)
power[i]=power[i-1]*3;
}
int makeint(string str)
{
int len=str.length();
int ret=0;
fo... |
f0be12891af618579c21f45fbec5a15ec58933e9 | de434ff675f555172a58e53416a2d405a7b4669d | /timer1-percision-test/src/main.cpp | e61b4aba866d5b8bae61bd000d49f62406706c58 | [] | no_license | ndunks/arduino-esp8266-learn | 7fff41dd5e198c2a61ffdaec838cae972eec23b0 | 078a66b692523364bbdb11a576e8fb6e2a46cf85 | refs/heads/master | 2022-12-24T14:30:39.636763 | 2021-05-01T17:47:59 | 2021-05-01T17:47:59 | 232,722,214 | 0 | 0 | null | 2022-12-11T21:01:26 | 2020-01-09T04:28:16 | C++ | UTF-8 | C++ | false | false | 2,358 | cpp | main.cpp | #include <Arduino.h>
#include <ESP8266WiFi.h>
const uint8_t tick_max = 8;
volatile int32_t tick_snap[tick_max] = {};
volatile uint8_t tick_counter = 0;
volatile int8_t done = 0;
const uint32_t tick_delay = 80; // tick
// https://sub.nanona.fi/esp8266/timing-and-ticks.html
static inline int32_t asm_ccount(void)
{
in... |
e4c681f1ccf876587d88cde248321a65e476f3fc | cb0f510888d4d80c8fe16c22a0f40787677abfe0 | /central_control_ui/include/central_control_ui/CusLabelMenu.h | 24c53810a8dfc13d69e51fdbfbc71306ee3a0f7f | [
"MIT"
] | permissive | DeepBlue14/usar_system | 89f4fb384c3fb41c3fefb9fe0eb339eb011c267f | a1b3d78a65f064be897f75dfc5f4dad4214f9d74 | refs/heads/master | 2021-01-17T21:03:37.653042 | 2017-11-16T05:21:50 | 2017-11-16T05:21:50 | 61,601,115 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,742 | h | CusLabelMenu.h | /*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: CLabelMenu.h
* Author: csrobot
*
* Created on March 26, 2016, 4:29 PM
*/
#ifndef CUS_LABEL_MENU_H
#define CUS_LABE... |
8f5fdd3f4b6cb5c7b70cd8e72d9b241793d5c457 | b174d92f45384d1db4d669a874dec517d495439f | /TreeMain/TreeClass.cpp | b6f0e82c08385c98121cdbbb43441a705dd88d16 | [] | no_license | parker37/TreeClass | 521641ce86b7bd8d8122d7c3a7a826067caf145f | 029fcf0909c8c427c1e4ded013ae648f02afaf5a | refs/heads/master | 2023-07-27T11:05:45.774999 | 2021-09-08T08:45:26 | 2021-09-08T08:45:26 | 403,827,459 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 505 | cpp | TreeClass.cpp | #include "TreeClass.h"
void TreeClass::inorder(Node* root)
{
if (root == nullptr)
{
return;
}
inorder(root->left);
cout << root->data << " ";
inorder(root->right);
}
TreeClass::Node* TreeClass::insert(Node* root, int key)
{
if (root == nullptr)
{
return newNode(key);
... |
a1ff03102394afbce8265b8fc47aae0d23d6ba84 | 152060017bbdfffa89b3fec361e53cb1b22a8b0e | /codeforces/Color the Fence.cpp | 881f75846112ce19e799b809793dd3ab09df477b | [] | no_license | Mohammad-Yasfo/ACM_Problems | ea2d2f0ddcde2e9fea27cc1288d066b6ed155ca1 | 81f5bd39d53237f4d89df8ee65cf5241eb1f6c59 | refs/heads/master | 2021-05-12T11:00:49.913083 | 2018-01-13T18:21:27 | 2018-01-13T18:21:27 | 117,373,760 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,395 | cpp | Color the Fence.cpp | /*
B. Color the Fence
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chan... |
7a49d4c119cda591427ddbed7ec30acbdf461846 | eabbf9e98437de2cef573e4f4dc6433dec2c7466 | /stl_tuning.cpp | 5cb3556c1466b7d3bdcaba57d1bc44c1a4d8b925 | [] | no_license | glebmish/algorithms | d2ffe2dfe4fb87deea4d125e4c623a1106f517a9 | fc0455c17deeae14409643bdbb7b28767e048ffd | refs/heads/master | 2020-07-06T02:04:25.625108 | 2018-12-03T11:57:08 | 2018-12-03T11:57:08 | 74,063,462 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,120 | cpp | stl_tuning.cpp | #include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <iostream>
using namespace std;
void tune_map() {
cout << "Tune map" << endl;
struct CmpStrLength {
bool operator()(const string& a, const string& b) const {
return a.size() < b.size()... |
791405ea34bf0b3446b7d838cdcc814f36f0c1ca | c9ba44c641a4035c4064f431fd85044ec11b95b4 | /fs/adaptor.hpp | 6495ee31a559582c7fec5c1acd2fb1b76c99000a | [
"Apache-2.0"
] | permissive | kevin20x2/KVFS | f53f6bc3ec0cfab1afc4f44bc4ddd426412b19a8 | 829e172f1195f66dba67db4b5810084ab9562c31 | refs/heads/master | 2020-04-13T14:42:50.756447 | 2018-12-27T09:22:19 | 2018-12-27T09:22:19 | 163,270,173 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 930 | hpp | adaptor.hpp | /**
* @file adaptor.hpp
* @brief
* @author kevin20x2@gmail.com
* @version 1.0
* @date 2018-12-17
*/
#ifndef KVFS_ADAPTOR_HPP
#define KVFS_ADAPTOR_HPP
#include "rocksdb/db.h"
#include "rocksdb/slice.h"
#include "rocksdb/options.h"
#include <string>
namespace kvfs {
using namespace rocksdb;
class RocksDBAda... |
f554f5e8dcdf3ff71248c0758d9893758107d6a2 | 046713242d1247555d07f571e17ea0c15663a8fa | /xTetBrick.h | 821fd0e13601e8b40b01b2eafe1d6ff1c0a0bcc2 | [] | no_license | dnelson2000/FEMpolar | a633afc4ef0183fd889ffa3d99af970655a8a89c | 8f0cee9de9a2fef01ceb550f48eca16396d5b1f5 | refs/heads/master | 2020-09-14T01:10:23.888470 | 2019-11-20T15:03:27 | 2019-11-20T15:03:27 | 222,962,838 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,157 | h | xTetBrick.h |
#pragma once
#ifndef _TET_BRICK_H_
#define _TET_BRICK_H_
#include "xTetrahedra.h"
#include "xBlockSparse.h"
template <class T>
class xTetBrick : public xTetrahedra<T>
{
public:
xTetBrick( const std::vector< xTetMaterial >& material, int widthIn, int heightIn, int depthIn)
: width(widthIn), height(heig... |
a66d4f92a9288dbc3954c497f9df85b70d1ad3f5 | 6ad0eb96903b34cea56b2e769ef5da0de6b84eed | /include/UserInterfaceOptions.h | f6f26df13e0e33e0a7cc5388239bc6845d27c1b0 | [
"Beerware"
] | permissive | F1ll3r/rollenspiel | 44f6ea82db108d32efd141d3c4d74da7a4757cd6 | 7a786fc2282d126c5974bf11708079e63b21ecb9 | refs/heads/master | 2016-09-06T14:57:33.695795 | 2010-12-22T21:02:05 | 2010-12-22T21:02:05 | 603,338 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,154 | h | UserInterfaceOptions.h | /*
* UserInterfaceOptions.h
*
* Created on: 25.05.2010
* Author: F1ll3r
*/
#ifndef USERINTERFACEOPTIONS_H_
#define USERINTERFACEOPTIONS_H_
#include "UserInterfaceManager.h"
enum UI_GUI_Element_Options{
UI_GUI_Element_Apply =200,
UI_GUI_Element_Close,
UI_GUI_Element_Save,
UI_GUI_Element_Resolution,
UI... |
4990afcd0cec5bc6f7550face0fddf97277367bf | 78da2c3fc16fb25587576c406b101a7e07e35c6a | /src/interfaces.hh | 3d11414b118454b5d6a9628d28782356a9336429 | [
"CC-BY-4.0",
"Apache-2.0"
] | permissive | amoe/figshare-uploader | a0ff57710a2c4fce9efa46705b7aed01781e2118 | 6a2c32c8521891e7f5e37670e7adb37dafbda3da | refs/heads/master | 2023-06-23T02:32:02.736670 | 2023-06-13T07:04:08 | 2023-06-13T07:04:08 | 113,032,906 | 7 | 1 | Apache-2.0 | 2022-09-23T16:24:49 | 2017-12-04T11:13:08 | C++ | UTF-8 | C++ | false | false | 2,659 | hh | interfaces.hh | #ifndef INTERFACES_HH
#define INTERFACES_HH
#include <string>
#include <vector>
#include "progress_reporter.hh"
#include "mapping_types.hh"
#include "domain_dto.hh"
#include "converter_registry.hh"
using std::string;
using std::vector;
class View {
public:
virtual string getSelectedFile() = 0;
virtual string... |
e9949db83daaf20900ae7cbaa23ae89422e65f8d | 56a77194fc0cd6087b0c2ca1fb6dc0de64b8a58a | /applications/LinearSolversApplication/custom_decompositions/eigen_dense_column_pivoting_householder_qr_decomposition.h | fafa1322fefb90843de4de90cc6eb69f2252661b | [
"BSD-3-Clause"
] | permissive | KratosMultiphysics/Kratos | 82b902a2266625b25f17239b42da958611a4b9c5 | 366949ec4e3651702edc6ac3061d2988f10dd271 | refs/heads/master | 2023-08-30T20:31:37.818693 | 2023-08-30T18:01:01 | 2023-08-30T18:01:01 | 81,815,495 | 994 | 285 | NOASSERTION | 2023-09-14T13:22:43 | 2017-02-13T10:58:24 | C++ | UTF-8 | C++ | false | false | 8,158 | h | eigen_dense_column_pivoting_householder_qr_decomposition.h | // | / |
// ' / __| _` | __| _ \ __|
// . \ | ( | | ( |\__ `
// _|\_\_| \__,_|\__|\___/ ____/
// Multi-Physics
//
// License: BSD License
// Kratos default license: kratos/license.txt
//
// Main authors: Ruben Zorrilla
//
#if !define... |
4e58c0ec083f144b500340f0fa0ff70b5f4f7eec | 5f2e5c68b7819dc24c200921b19936edabeb3c30 | /FinalProject/FinalProject.cpp | de4be78c58fd3c5b0340943c33f4949c5f1ac45d | [] | no_license | EmperorMoose/CSCE-240 | 8c165582dd4c09f4b59f1eab7f79f8a37e532d28 | 3ad6b87e509995f771e9c16c6e65cb1146c9c684 | refs/heads/master | 2021-01-13T04:13:31.616835 | 2016-12-31T05:29:32 | 2016-12-31T05:29:32 | 77,493,041 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,434 | cpp | FinalProject.cpp | // FinalProject.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <iostream>
#include <string>
#include "Gene.h"
#include "Sequence.h"
int main(int argc, char* argv[])
{
//NOTES: Is the sequence on each line, prefaced by the ID? or are they seperate lines?
//Everything below... |
945a610ad64b02daa893cc95736e7436c3803186 | d507b2c5eec7d46ce147dba1e65cf965a66b88d2 | /Snark_News/2020/Round_2/A.cpp | 16edb775cc1339b8673fd80b70096f8500c52c9c | [] | no_license | mohamedsobhi777/CompetitiveProgramming | e5875d23bdb9e0407d125fc421e269637e62627c | 9b2ec961313064545682de3c460feed4d326920a | refs/heads/master | 2022-09-28T06:41:30.120246 | 2022-09-12T09:28:21 | 2022-09-12T09:28:21 | 240,776,156 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,047 | cpp | A.cpp | #include <bits/stdc++.h>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define loop(_) for (int __ = 0; __ < (_); ++__)
#define forn(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using ld = long double;
const int N = 1e6 ... |
4b25bab84f938da1f70515264423203ec0d6448d | 642742cd1138f8e0fd9bb19271af676d1ae5facc | /core/basics/Observable.h | 00b8ed055410211b6d726cb152989783ae8e1687 | [] | no_license | cvjena/nice-core | d64f3b1b873047eb383ad116323f3f8617978886 | d9578e23f5f9818e7c777f6976eab535b74dc62f | refs/heads/master | 2021-01-20T05:32:01.068843 | 2019-02-01T16:17:13 | 2019-02-01T16:17:13 | 3,012,683 | 4 | 4 | null | 2018-10-22T20:37:52 | 2011-12-19T15:01:13 | C++ | UTF-8 | C++ | false | false | 812 | h | Observable.h | #ifndef _OBSERVABLE_FBASICS_H
#define _OBSERVABLE_FBASICS_H
#include <vector>
#include <core/basics/Observer.h>
namespace NICE {
/**
* Observable as in Observer-pattern.
*
* @author Ferid Bajramovic (ferid [dot] bajramovic [at] informatik [dot] uni-jena [dot] de)
*/
class Observable {
public:
//! notify all... |
be771b09fce6bad0bf1758d59fc7bfc2c8d36644 | e42a3b348c78e3c90db1e8a5863152fe5b62746f | /cc/lib/cr/msgs/CRterminal.cc | 7ee17127a6e5a6b2e79e8c8d4d0dfa5a482e991f | [] | no_license | wanziforever/hap | 0532ff73106fc6d79a6c72a41fdf21f9085fb502 | f981ea9a946fdb8453b4c277117836901d1abfaa | refs/heads/master | 2020-04-14T22:38:22.070094 | 2015-01-20T00:14:24 | 2015-01-20T00:14:24 | 14,736,167 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,808 | cc | CRterminal.cc | /*
** File ID: @(#): <MID19366 () - 08/17/02, 29.1.1.1>
**
** File: MID19366
** Release: 29.1.1.1
** Date: 08/21/02
** Time: 19:40:13
** Newest applied delta: 08/17/02
**
** DESCRIPTION:
**
** OWNER:
** Roger McKee
**
** NOTES:
**
*/
#ifdef CC
//IBM JGH 05/09/06 change path
#ifdef __linux
... |
192d83947f0417093a0f231a9333c848f6a4a2bd | f76639427ccd2e6950aba5e25f2fed1878661e5f | /AAX_SDK_2p3p2/ExamplePlugIns/DemoGain_GUIExtensions/Source/GUI/DemoGain_String.cpp | c0df6ea322b4ee187f1c832f3d9a27febfb4d98a | [] | no_license | sadisticaudio/SDKs | f5e21caf67eb9b99db6677a7c3b1f58739922cdd | b56f6c506a0e93817dd2decd5f214061dae43dc4 | refs/heads/main | 2023-06-16T14:34:30.783603 | 2021-07-11T02:13:56 | 2021-07-11T02:13:56 | 384,839,826 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,314 | cpp | DemoGain_String.cpp | /*================================================================================================*/
/*
* Copyright 2009-2015 by Avid Technology, Inc.
* All rights reserved.
*
* CONFIDENTIAL: This document contains confidential information. Do not
* read or examine this document unless you are an Avid Technology... |
c4f3745c384cb09a953824483d24c3b621f0b73c | 8369afd6d25415bf47a870de2c4a87b0833c630e | /pass/pass.cpp | ef2e009e6468fbb0c629afd9f7ea8c47c5dc0724 | [] | no_license | Babak-khezri/university.cpp | eaeb999081d4e4e01a26b63b2ce81ea2e9392248 | 779dcf958e6e739643d908b0486cf324830e6bc6 | refs/heads/master | 2020-12-27T10:14:52.034137 | 2020-02-03T01:41:23 | 2020-02-03T01:41:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 783 | cpp | pass.cpp | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define max 50
char user[max], pas[max];
void Enter();
void join();
int main(){
printf("1_Enter \n2_join\n");
int x;
scanf("%d",&x);
switch(x){
case 1:
getchar();
Enter();
break;
case 2:
join();
break;
}
return 0;
}
void Enter(){
system... |
f5a3dedac9e812920f58549547225d41a7d3fb74 | dbd1cd64d92d75464c1baccfe604a378da5c4850 | /zad1.2-benchmark/src/kontener.cpp | 6dea63b6f578d84817cc36a67433fe731fd050b5 | [] | no_license | 200403/Pamsi_lab | f4419629339000bf9ad17a767b56b9628587a5f9 | 132a159d29f7d92b29d78d2b98405d64e272bad1 | refs/heads/master | 2020-04-06T03:40:59.672455 | 2014-05-28T19:45:12 | 2014-05-28T19:45:12 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,842 | cpp | kontener.cpp | #include "kontener.hh"
#include <iostream>
#include <fstream>
#include <assert.h>
using namespace std;
/*!
* \brief metoda wczytuje dane do tablicy z pliku
*
* Format danych w pliku jest nastepujacy:
* pierwszy wiersz - ilosc elementow, a nastepnie w kolumnie kolejne wartosci tablicy.
* \param nazwaPliku ... |
f4f48dce4567d84287e96669729fbb3d5097c3f8 | 2f9a425e8f5d034da4d35c9f941ff609cb232883 | /poj/3417/POJ_3417_2797633_AC_1030MS_24496K.cpp | bdb85a6329b7f8c410df97fe15283de09ec1352e | [] | no_license | wangyongliang/nova | baac90cd8e7bdb03c6c5916fbab9675dabf49af5 | 86b00b1a12f1cc6291635f31a33e791f6fb19d1a | refs/heads/master | 2022-02-18T05:35:02.447764 | 2019-09-08T02:22:06 | 2019-09-08T02:22:06 | 10,247,347 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,772 | cpp | POJ_3417_2797633_AC_1030MS_24496K.cpp | #include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
#define size 100100
vector <int> a[size];
int b[size];
int n,cnt,m;
int A[size*2],B[size*2];
int R[size];
bool flag[size];
int M[size*2][20];
__int64 ans;
void dfs(int deep,int i,int j)
{
A[cnt]=deep;
B[cnt]=i;
R[i]=cnt;
c... |
217b992006f27548539dea3d4fd000a82e1289fc | ca16b7fe65bee3ecee61435746aba6d3d29fff9e | /Fast Modular Exponentiation/main.cpp | 3cc41bc3bf79d3cd512badb24dd2919d8a49b7b0 | [] | no_license | DivyanshSinha/Competitive-Programing | c28bfd850e2fc4cb48fa8d7e7b6a9bd96308ef8c | 1643b45e80dc48ca93a4f2d9396945f551a1abc0 | refs/heads/main | 2023-04-02T00:38:53.757272 | 2021-03-29T17:56:00 | 2021-03-29T17:56:00 | 345,370,353 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 410 | cpp | main.cpp | #include <iostream>
using namespace std;
int fastExpo(int a , long long n , int mod)
{
if(n==0) return 1;
if(n%2==0) return fastExpo((1LL*a*a)%mod,n/2,mod);
return (1LL*a*fastExpo(a,n-1,mod))%mod;
}
int main()
{
int a,n,mod;
cout<<"Enter base: ";
cin>>a;
cout<<"Enter exponent: ";
ci... |
7040def8562b8037cc5de31f3fbd51c0500a8a84 | 513fc79b95b81899f7b9d2eb41724c1a2f8b4fe0 | /v1/fonts/makefont.cpp | 97af383c4db106f14e1d839f5a6ed893d2be9e8f | [] | no_license | escargames/escarlib | 3fe2a5f3f02f96c4e1a8fe97b7228032ed31ab90 | a0402aef8fac84ec918e048e88827903ceb41783 | refs/heads/master | 2020-05-17T14:01:49.520742 | 2020-04-12T19:25:00 | 2020-04-18T10:11:25 | 183,752,825 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 783 | cpp | makefont.cpp |
#include <lol/engine.h>
int main(int, char **argv)
{
lol::image img;
img.load(argv[1]);
auto size = img.size();
lol::array2d<lol::vec4> &data = img.lock2d<lol::PixelFormat::RGBA_F32>();
std::vector<int> accum;
for (int i = 0; i < size.x; ++i)
{
int val = 0;
for (int j = ... |
cfe407f91bcbf36e83068a3d46febb9e11ecf0a9 | e62c565406a06075891598b173d5fabfb0107335 | /include/otm/Matrix.hpp | e3a78e9457230ebdb96ccb010be3a568420422dc | [
"BSD-2-Clause"
] | permissive | Othereum/otm | 2bf35fca82d527d05b51468d957c409f6303544e | 75a800c2c5e3351b8068c6417d176a5943c6af27 | refs/heads/master | 2022-12-25T02:04:40.641582 | 2020-10-08T08:22:20 | 2020-10-08T08:22:20 | 256,718,533 | 5 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 13,351 | hpp | Matrix.hpp | #pragma once
#include "Vector.hpp"
namespace otm
{
namespace detail
{
template <class T, size_t R, size_t C>
struct MatrixBase
{
};
template <class T, size_t L>
struct MatrixBase<T, L, L>
{
static const Matrix<T, L, L> identity;
constexpr void Transpose() noexcept;
// Matrix with ones on the main diagon... |
2b83df37b048ce5abb959c152e1e4b38925cc2c8 | bdfe9048a46f2bc44b8f7ac64eddee64501cae8a | /src/Nodes/NodePrimaryExpr.cpp | f2cfc798963d4204f9cc4b2cabc7fde44dfbacf4 | [
"MIT"
] | permissive | kirarpit/compiler-construction | 80a438fc0469d716b7a64c6218d2b913b292375e | 36bd47d40a934e8ff87bf58a9e7049f644169f2f | refs/heads/master | 2021-03-22T03:46:42.392533 | 2018-11-03T23:09:39 | 2018-11-03T23:09:39 | 121,824,786 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,649 | cpp | NodePrimaryExpr.cpp | #include <AllNodeHeaders.h>
Node* NodePrimaryExpr::parse(CompilerState &cs) {
Lexer &lex = cs.lexer;
Logger::logParseEntry(__CLASS_NAME__, lex.peek());
bool errorFlag = false;
Node *primaryExpr = new NodePrimaryExpr();
if (lex.peek().type == TT_ID) {
Token id = lex.read();
primaryExpr->addNode(new TerminalN... |
822564ff45728a3d77de43d285f66e2d45427099 | 44c24b25be46851e372438aec35b03955e3df136 | /update_k_neighbors.h | 1c68760625449d3980514bd8f1466422655251ac | [] | no_license | roksanaShimu/Probabilistic-Roadmap | ef34eb6713517138b7058ed8e6faffea347f0d19 | 5aeef17de1b98906e7699684f7b41e125ff11e7d | refs/heads/main | 2023-03-05T12:21:41.159901 | 2021-02-11T08:53:53 | 2021-02-11T08:53:53 | 337,905,799 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,280 | h | update_k_neighbors.h | #ifndef update_k_neighbors
#define update_k_neighbors
#include <stdint.h>
#include<vector>
#include "predefined_variables.h"
#include "milestones.h"
using namespace std;
bool path_can_be_build(local_planner_node* A, local_planner_node* B, vector<Sphere> obstacles){
Sphere local_sample[9];
int i=0; int j;
for... |
a6544c4a08194b1f91c50908d89a66cd21346e31 | 165be8367f5753b03fae11430b1c3ebf48aa834a | /tools/train/source/models/MobilenetV2.hpp | 88e95e7490118804a9eb493148be125a158a164a | [
"Apache-2.0"
] | permissive | alibaba/MNN | f21b31e3c62d9ba1070c2e4e931fd9220611307c | c442ff39ec9a6a99c28bddd465d8074a7b5c1cca | refs/heads/master | 2023-09-01T18:26:42.533902 | 2023-08-22T11:16:44 | 2023-08-22T11:16:44 | 181,436,799 | 8,383 | 1,789 | null | 2023-09-07T02:01:43 | 2019-04-15T07:40:18 | C++ | UTF-8 | C++ | false | false | 1,158 | hpp | MobilenetV2.hpp | //
// MobilenetV2.hpp
// MNN
//
// Created by MNN on 2020/01/08.
// Copyright © 2018, Alibaba Group Holding Limited
//
#ifndef MobilenetV2_hpp
#define MobilenetV2_hpp
#include "Initializer.hpp"
#include <vector>
#include "MobilenetUtils.hpp"
#include <MNN/expr/Module.hpp>
#include "NN.hpp"
#include <algorithm>
n... |
43b6c7e8af86ad6d9747327d9ea89966cbc712ee | 1197ff17a68feee28c6664b7b5be918de3dbb8da | /1203.SortItemsbyGroupsRespectingDependencies.cpp | 31a9559f89a47b653ea21b3b40dde7038b6547e1 | [] | no_license | dushyant-goel/leetcode | 1151bf4cf69f63f3b0b1d5cf48cdd22f1d58c799 | de5c061a0b0de70a2934a3a22931e491767d17b3 | refs/heads/main | 2023-06-24T10:03:24.965677 | 2021-07-27T14:50:31 | 2021-07-27T14:50:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,608 | cpp | 1203.SortItemsbyGroupsRespectingDependencies.cpp | class Solution
{
public:
vector<int> visited;
bool dfs(int i, vector<int> &order, vector<vector<int>> &edgeList)
{
if (visited[i] == 1)
return true;
else if (visited[i] == 2)
return false;
bool hasCycle;
visited[i] = 1;
for (int j = 0; j <... |
f1a06925f46ae1681f499b69445a7d31a435ffd0 | 9587f5e6384bf4c76c77709882f4f15e59869c97 | /ProjPad/EditContainer.cpp | 02fc1c814451eca4b38954e842ae19b532fe15ec | [
"MIT"
] | permissive | sergrt/ProjPad | 8fd3dae40ea016c11863a9acee1d4175e6d85216 | 59a26e75aa1e2077cf68df55eac0837679d90fb1 | refs/heads/master | 2018-09-27T03:23:37.237272 | 2018-06-09T10:56:00 | 2018-06-09T10:56:14 | 116,811,314 | 0 | 0 | MIT | 2018-06-08T12:05:21 | 2018-01-09T12:07:18 | C++ | UTF-8 | C++ | false | false | 4,382 | cpp | EditContainer.cpp | #include "stdafx.h"
#include "EditContainer.h"
#include <QGridLayout>
#include <QScrollBar>
EditContainer::EditContainer(int id)
: attached_{ false } {
setProperty("id", QVariant::fromValue(id));
setLayout(new QGridLayout());
upperEdit_ = new QTextEdit;
lowerEdit_ = new QTextEdit;
... |
6498894c4a3817392e974d9bb3595810797a853b | 52adb01da994852256c8899dc0d6c7938b335edb | /source/girgs/include/girgs/BitManipulationBMI2.inl | aabaad11406212a36f6e05fce1a632ea01307ce9 | [
"MIT"
] | permissive | chistopher/girgs | fc858a1a8d931386e8e20d7671c8eba97d8fd9ea | 32916f7b9f8903f1d6ea37259b490bedb5d85928 | refs/heads/master | 2022-08-21T22:50:50.717150 | 2022-07-05T16:29:46 | 2022-07-05T16:29:46 | 165,020,603 | 18 | 4 | MIT | 2021-12-15T09:19:48 | 2019-01-10T08:25:52 | Jupyter Notebook | UTF-8 | C++ | false | false | 930 | inl | BitManipulationBMI2.inl | #pragma once
#include <immintrin.h>
namespace girgs {
namespace BitManipulationDetails {
namespace BMI2 {
template <unsigned D>
struct Implementation {
static constexpr unsigned kDimensions = D;
static uint32_t deposit(const std::array<uint32_t, D>& coords) noexcept {
uint32_t result = 0;
co... |
f07e550c3e8ceffe192f99d19a6121f432978fca | a5f3b0001cdb692aeffc444a16f79a0c4422b9d0 | /main/svl/qa/complex/ConfigItems/helper/HistoryOptTest.cxx | 2b7f01cb22ee03ffbe5845763f9e6e9ce035aa7b | [
"Apache-2.0",
"CPL-1.0",
"bzip2-1.0.6",
"LicenseRef-scancode-other-permissive",
"Zlib",
"LZMA-exception",
"LGPL-2.0-or-later",
"LicenseRef-scancode-free-unknown",
"LicenseRef-scancode-philippe-de-muyter",
"OFL-1.1",
"LGPL-2.1-only",
"MPL-1.1",
"X11",
"LGPL-2.1-or-later",
"GPL-2.0-only",
... | permissive | apache/openoffice | b9518e36d784898c6c2ea3ebd44458a5e47825bb | 681286523c50f34f13f05f7b87ce0c70e28295de | refs/heads/trunk | 2023-08-30T15:25:48.357535 | 2023-08-28T19:50:26 | 2023-08-28T19:50:26 | 14,357,669 | 907 | 379 | Apache-2.0 | 2023-08-16T20:49:37 | 2013-11-13T08:00:13 | C++ | UTF-8 | C++ | false | false | 27,651 | cxx | HistoryOptTest.cxx | /**************************************************************
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to y... |
694917446ff22ebce66378cf6b00cee6710cc9df | 1dc3bdf2c7fe34519f30dad775587ad212903abe | /pieces/Queen.cpp | 9e84f9d42c8d2d832357bd0074ac849868783cef | [] | no_license | GarrettFaucher/Chess-Graphics | 225d586bdda6bd3845e04533ee4110ee27d2c31c | 84b27b1f79ce685aab8d8b93369d07f47321e334 | refs/heads/master | 2022-04-08T10:29:27.724697 | 2020-02-07T21:40:22 | 2020-02-07T21:40:22 | 221,319,351 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,253 | cpp | Queen.cpp | #include "Queen.h"
Queen::Queen(){
type = QUEEN;
team = BLACK;
alive = true;
x = 0;
y = 0;
findValidMoves();
}
Queen::Queen(faction team, bool alive, int x, int y){
this->type = QUEEN;
this->team = team;
this->alive = alive;
this->x = x;
this->y = y;
findValidMoves();
}
... |
98c520a21827cebcddb42cf3b0da7c0d6da9f108 | cb9535a1dfea27158430d25aab71f4b903968386 | /code/util/config.cpp | 03609e62fed35787454f63f975ddd2a29497a4db | [] | no_license | uhacz/bitbox | 0d87a54faa4bf175a2fdb591c4ea5f71935c67fb | 63b4038a1b8cf05968c55ad11b25344fff44aba5 | refs/heads/master | 2021-01-23T09:40:25.289880 | 2017-09-09T18:15:06 | 2017-09-09T18:15:06 | 32,782,269 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,542 | cpp | config.cpp | #include "config.h"
#include <util/type.h>
#include <util/debug.h>
#include <util/memory.h>
#include <libconfig/libconfig.h>
struct bxConfig_Global
{
config_t _cfg;
bxConfig_Global(){}
config_t* config() { return &_cfg; }
};
static bxConfig_Global* __cfg = 0;
namespace bxConfig
{
int global_init( c... |
7afa66972dca00781b993d550cb00c8eafeeeefe | 5e92e07317363aea17d008181406fffa3afaaa59 | /libviews/callview.cpp | b0a4006cf45f80abc242c482e940a3894295ffe8 | [
"CC0-1.0"
] | permissive | KDE/kcachegrind | ac6265ae1faf5c379f989e0892942009e02aafb6 | 8e06118fe2d0496aee579bbc04fb5062a87ebb07 | refs/heads/master | 2023-08-05T07:55:25.715063 | 2023-08-03T02:20:03 | 2023-08-03T02:20:03 | 42,722,999 | 338 | 41 | NOASSERTION | 2020-12-24T13:17:30 | 2015-09-18T13:10:44 | C++ | UTF-8 | C++ | false | false | 9,360 | cpp | callview.cpp | /*
This file is part of KCachegrind.
SPDX-FileCopyrightText: 2003-2016 Josef Weidendorfer <Josef.Weidendorfer@gmx.de>
SPDX-License-Identifier: GPL-2.0-only
*/
/*
* Call Views
*/
#include "callview.h"
#include <QAction>
#include <QMenu>
#include <QTreeWidget>
#include <QHeaderView>
#include <QKeyEven... |
5df1673415c364c9d532bf468ad838c5de5e8ddf | f65abbd28d767d42698e03493f44087cb801e985 | /Library/PhoenixLibrary/Source/Graphics/Mesh/Win/DirectX11/MeshDX11.h | 9398b2352215b2d422a47d720eb9c092175f79ee | [] | no_license | 01kim/GameIndustryEngine | e1d5dfeb7793951f1e6bf689e0472ef957102f7c | e4442da876e6ec896c61b24db13d43ebebaf19a1 | refs/heads/master | 2023-06-12T18:51:47.122226 | 2021-07-08T11:03:59 | 2021-07-08T11:03:59 | 381,909,971 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 1,369 | h | MeshDX11.h | #pragma once
#include <d3d11.h>
#include "Phoenix/Graphics/Buffer.h"
#include "./Mesh/Win/Mesh.h"
namespace Phoenix
{
namespace Graphics
{
//****************************************************************************
// DirectX11版メッシュ操作オブジェクト
//***************************************************************... |
bff61d7880ced428a8f2a2948cf6913e51d99efc | 7c9ea05f3852066ed01f14498b7f5d47af3bb157 | /Client/Scene.h | c80ea2903dbcbfa5a028af6a33a4fb4331537ea8 | [] | no_license | OverFace/MapleStory | 0b73faaea2cabd373c0e2ab4f529225d5441e93d | 51c6bfbeef1efb70a30d5050ed557459ee68292a | refs/heads/master | 2021-01-01T06:27:11.858829 | 2017-11-07T02:14:20 | 2017-11-07T02:14:20 | 97,424,364 | 0 | 1 | null | 2017-08-15T11:54:13 | 2017-07-17T01:51:29 | C | UTF-8 | C++ | false | false | 223 | h | Scene.h | #pragma once
class CScene
{
public:
CScene(void);
virtual ~CScene(void);
public:
virtual void Initialize(void)PURE;
virtual int Update(void)PURE;
virtual void Render(HDC _dc)PURE;
virtual void Release(void)PURE;
}; |
ee44f900e9b110faf0331f0aef5b40ba84857fb6 | 35701a648c65aab3011a523fd35cc10b1e753b6a | /第8周实验课实验/八MFC一4/八MFC一4/MyDlg.cpp | ba3605bc59d1df1beb0f7c07dd4ad3ddc59fb9b9 | [] | no_license | Mutiyu/YML | 9fe15d809021796c34a59446caf011b73eef12f7 | 24991754e212a9580a6b817fc00a092fd63d02a4 | refs/heads/master | 2022-11-11T18:09:07.096657 | 2020-07-03T15:34:02 | 2020-07-03T15:34:02 | 268,554,710 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,168 | cpp | MyDlg.cpp | // MyDlg.cpp : 实现文件
//
#include "stdafx.h"
#include "八MFC一4.h"
#include "MyDlg.h"
#include "afxdialogex.h"
// MyDlg 对话框
IMPLEMENT_DYNAMIC(MyDlg, CDialogEx)
MyDlg::MyDlg(CWnd* pParent /*=NULL*/)
: CDialogEx(IDD_DIALOG1, pParent)
, s1(_T(""))
, x(0)
, s3(_T(""))
{
}
MyDlg::~MyDlg()
{
}
void MyDlg::DoDataExcha... |
43659675b4c0381721612beb20cf2100103d7b85 | 12b379faa59d827f9b502e312987a25de2d43e12 | /media_driver/linux/gen11/ddi/media_sysinfo_g11.cpp | 56da3519fd3847b039dae38e82ab9af9d0fee44a | [
"BSD-3-Clause",
"MIT"
] | permissive | Jaly314/media-driver | 9041f952ff1590c1b345ecdb9da41998f5267adf | 6f37735ea7c44f733e0ae028213689d1c1031264 | refs/heads/master | 2020-03-28T22:21:35.827872 | 2018-09-17T07:04:45 | 2018-09-17T07:10:01 | 149,226,591 | 1 | 0 | null | 2018-09-18T03:59:44 | 2018-09-18T03:59:44 | null | UTF-8 | C++ | false | false | 7,026 | cpp | media_sysinfo_g11.cpp | /*
* Copyright (c) 2018, Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publis... |
1b2d6dcadea26c9657a901de03a81e8814ae7388 | d0fbe5fdc9889d05bf06a6e785c2cf0cfbea68c5 | /csrc/utils.cc | 8fe4d5f27beec2406c5144f681cc0d7f4867c8bc | [] | no_license | vssousa/python-cspade | cb8b9b428568408bfe28317e5106a29923099a63 | e3af0ff86934457b0cbbca5d32f973ca86ead7fa | refs/heads/master | 2020-04-10T18:01:24.268726 | 2018-12-02T17:10:07 | 2018-12-02T17:10:07 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 130 | cc | utils.cc | #include "utils.h"
#include <sstream>
using std::ostringstream;
ostringstream logger;
ostringstream mined;
ostringstream memlog; |
66ee6a647114e64ee2959831d577fda6aaf950bf | d020f624a375fc51f79fd5eabb87bc00e3e75854 | /#620 div2/C.cc | d5b50dd596073caf6ca323a0ef49544eb87bfd42 | [] | no_license | thirtiseven/CF | 50649e51ebeb183e26606e31ac7d141b08f2044c | 21ea775563643b8e4d35a97c4d9c80323bb5717b | refs/heads/master | 2023-07-23T22:53:01.822563 | 2023-07-06T15:58:37 | 2023-07-06T15:58:37 | 88,733,957 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 863 | cc | C.cc | #include <iostream>
#include <tuple>
#include <algorithm>
int n, m, q;
struct customer{
int a, b, c;
}cus[102];
bool cmp(customer x, customer y) {
return x.a < y.a;
}
int main(int argc, char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cin >> q;
while (q--) {
std::cin >> n >> m;
... |
a0a278a8179477dec9d144a2f81abb59843ef430 | 83010fe0442b0cf6f7260ee71a452d087f328a5d | /kdist.cpp | 0d319e29d2402c378e12a9ea7acb2d21083b98c9 | [] | no_license | samkumartp/Competitive-programming-problems | d6b32233d36dbd91fe5c78d2f4b4e37afcfe67df | 399d966d5e77aae4c3823405e3989b4e1b1bbea5 | refs/heads/master | 2020-04-08T11:54:06.225640 | 2017-09-17T16:25:35 | 2017-09-17T16:25:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,646 | cpp | kdist.cpp | # include <bits/stdc++.h>
# define NR 200005
using namespace std;
ifstream f("kdist.in");
ofstream g("kdist.out");
vector <int> v[NR], store[NR];
struct elem {
int x, t1, t2;
}aux[NR], E;
struct elem2 {
int k, niv;
}RMQ[20][2*NR];
int i,j,n,m,x,y,K,Rt1,Rt2,VV,k,W,t1,t2;
int H[NR], R[NR], ap[NR], lg[2*NR], Col[... |
f8371036ea4d176d6197beb1ae828220a053e942 | eb31d986eb055daba38c8dad981f17f477476a61 | /valt_csere_kul.cpp | 5b0a328dfaba927119d10f593bc8882d39e109b8 | [] | no_license | gyorfi-daniel/bev_prog | 9accb00df4fa0ee829e70256de712c82b9ac1bbc | 5765b042a8d5fb266eb7a359ec4483f314a8bf59 | refs/heads/master | 2020-03-29T14:25:18.796128 | 2018-11-21T11:39:10 | 2018-11-21T11:39:10 | 150,016,151 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 216 | cpp | valt_csere_kul.cpp | #include "std_lib_facilities.h"
int main()
{ int a=7;
int b=1;
cout << "A kezdő érték: a=" << a << ",b=" << b <<'\n';
a=a+b;
b=a-b;
a=a-b;
cout << "A csere utáni érték: a=" << a << ",b=" << b <<'\n';
}
|
4a46c31107958aa6f608a7afc5f5b9670de5e89a | eead9dcd8d0ea54bb876a6082c612838610513e3 | /P294FlipGameII.cpp | 39f37fdce770f90effc76e28257637b22a94df37 | [] | no_license | ysonggit/leetcode-cpp | df8e4d58b52ce66dd5d603a003cca102e9bcfb2b | 3daf0ab175d2d877828b3b258a4bba538ce03797 | refs/heads/master | 2021-01-10T21:16:01.706172 | 2020-09-30T13:56:43 | 2020-09-30T13:56:43 | 41,328,961 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 568 | cpp | P294FlipGameII.cpp | class Solution {
public:
// can optimize solution with memorization
// or DP (Sprague-Grundy Theorem) https://leetcode.com/discuss/64344/theory-matters-from-backtracking-128ms-to-dp-0ms
bool canWin(string s) {
int n = s.length();
if(n<2) return false;
for(int i=0; i<n-1; i++){
... |
6452c46ae66236945da6dd747950ac4e9f8b7308 | b2571f919ae552c4dff006be9c825184d272dd75 | /uri/1045.cpp | bc0bd78687934c404783f4471b813eb50c882f46 | [] | no_license | juanplopes/icpc | 22877ca4ebf67138750f53293ee9af341c21ec40 | 3e65ffe9f59973714ff25f3f9bb061b98455f781 | refs/heads/master | 2020-12-25T17:35:04.254195 | 2017-10-27T23:53:25 | 2017-10-27T23:53:25 | 2,492,274 | 121 | 44 | null | null | null | null | UTF-8 | C++ | false | false | 821 | cpp | 1045.cpp | //1045
//Triangle Types
//Misc;Beginner
#include <iomanip>
#include <algorithm>
#include <iostream>
using namespace std;
double V[3];
int main() {
while(cin >> V[0] >> V[1] >> V[2]) {
sort(V, V+3, greater<double>());
if (V[0] > V[1] + V[2])
cout << "NAO FORMA TRIANGULO" << endl;
... |
5b0aeaab415c54495943a3224b7936dd062de648 | c5d137fe433357e37020281923ed845a38057b83 | /main.cpp | 90063577e4fd44b12a7f4fbe0f004c04d2dd8b00 | [] | no_license | spidey/3DSEncode | ab1ee7a924fe8bc784214ea453790f249461fa39 | 64023ff3039475fe1908450383f4f14befabf923 | refs/heads/master | 2021-01-01T10:13:39.799628 | 2014-02-14T02:12:29 | 2014-02-14T02:12:29 | 2,960,263 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 183 | cpp | main.cpp | #include <QtGui/QApplication>
#include "Q3DSEncode.h"
int main(int argc, char *argv[])
{
QApplication app(argc, argv);
Q3DSEncode w;
w.show();
return app.exec();
}
|
fd93545af57099b6cdd75e50d4c037aba45b2507 | 94e5a9e157d3520374d95c43fe6fec97f1fc3c9b | /Light OJ/1316.cpp | 33d1e7b06e7e9200a357c7cb77ac45854ef6774f | [
"MIT"
] | permissive | dipta007/Competitive-Programming | 0127c550ad523884a84eb3ea333d08de8b4ba528 | 998d47f08984703c5b415b98365ddbc84ad289c4 | refs/heads/master | 2021-01-21T14:06:40.082553 | 2020-07-06T17:40:46 | 2020-07-06T17:40:46 | 54,851,014 | 8 | 4 | null | 2020-05-02T13:14:41 | 2016-03-27T22:30:02 | C++ | UTF-8 | C++ | false | false | 7,249 | cpp | 1316.cpp | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... |
12efd401a0335fd56f111b2d3ce4ef53ee03ba57 | 5d83739af703fb400857cecc69aadaf02e07f8d1 | /Archive2/4e/8ebaca07830965/main.cpp | 0798c1b1920b9f52b387cae5d3435a8b368225d5 | [] | no_license | WhiZTiM/coliru | 3a6c4c0bdac566d1aa1c21818118ba70479b0f40 | 2c72c048846c082f943e6c7f9fa8d94aee76979f | refs/heads/master | 2021-01-01T05:10:33.812560 | 2015-08-24T19:09:22 | 2015-08-24T19:09:22 | 56,789,706 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 626 | cpp | main.cpp | #include <string>
#include <iostream>
#include <bitset>
#include <climits>
using namespace std;
template<typename T>
void show_binrep(const T& a)
{
const char* beg = reinterpret_cast<const char*>(&a);
const char* end = beg + sizeof(a);
while(beg != end)
std::cout << std::bitset<CHAR_BIT>(*beg++)... |
afe9c5cad5ed4aac9c68865707cd150c60239736 | b495209212ba745251914fee2ba6aebf90932b44 | /src/ChatManager.h | 0d538ec03e28d774ecc0f5d0761f1f93dd29654e | [] | no_license | knetikmedia/knetikcloud-tizen-client | 21e1d9a0f98ca275f372af05dfb699adf46b7679 | 28be72af9caa0980570ff20fc798bdcf67b5550a | refs/heads/master | 2021-01-13T13:34:44.915887 | 2018-03-14T16:05:13 | 2018-03-14T16:05:13 | 76,421,710 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,364 | h | ChatManager.h | #ifndef _ChatManager_H_
#define _ChatManager_H_
#include <string>
#include <cstring>
#include <list>
#include <glib.h>
#include "ChatBlacklistResource.h"
#include "ChatMessageResource.h"
#include "PageResource«ChatMessageResource».h"
#include "PageResource«ChatUserThreadResource».h"
#include "Result.h"
#include "Error... |
ca161134ca2e5a6e395af365bd70671d64a48351 | 7f74bc0d683edc3da4c3541e5fdd1e5f77494927 | /Phases/2/VirtualMachine.h | e74a1cc5d151a04194a23e5bb73662531171e549 | [] | no_license | xCAMELZx/CSE460 | 3e2c3c9669be618997fe8402064a28666070a1bc | e7000c6fa7c9e12164b4c22734569d942f1696cd | refs/heads/master | 2020-03-29T23:12:31.910025 | 2018-11-02T00:46:47 | 2018-11-02T00:46:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 993 | h | VirtualMachine.h | /*
Yousef Jarrar, Nicholas Chiodini
CSE 460 Dr. Z
Due Date: October 15th, 2018
Description: Virtual Machine Header File.
A constructer is used to define functions like memory size, register size,
base, limit, program counter, instruction register, stack point
and getting the clock time
*/
#ifndef VIRTUAL... |
589897c86be05229db82e770f88274ea34804ddb | 6cb34f254a0ffbd87ab8e945452903079a00f0e9 | /src/Game.cpp | b9bfd87a90edc6bb7c908215764af3695a463225 | [] | no_license | brasthm/Mouse-n-Music | 7200bca7f8da094255525560f90c722f34563cfa | 617aa030a8d9f37d93498e27d3e5c21b24e8f572 | refs/heads/master | 2020-03-31T06:35:07.553897 | 2018-10-14T17:05:56 | 2018-10-14T17:05:56 | 151,987,616 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,669 | cpp | Game.cpp | #include "Game.h"
#include <iostream>
Game::Game()
{
// Load Background
textBackground_.loadFromFile(IMG_PATH + "bg.png");
background_.setTexture(textBackground_);
// Load Cursor
textCursor_.loadFromFile(IMG_PATH + "cursor.png");
cursor_.setTexture(textCursor_);
cursor_.setOrigin(32, 32);
// Load Sections
t... |
46cc736dc9d0f54e797ad4ceea48ac43e8a722df | 94531d8f6d9f562c28b07ba765d4efb70b2c3fe8 | /copy_of_serijski_port1.ino | 10cf940ee5cbb11231a810dea42dd62b860158ce | [] | no_license | ledjoburazeru/RSZDMK_ZAD2 | 280438b1e25058e0bdd03e13f31d242661abe815 | a57f39efd06e07f7d755d1c319f5a7dd3eb446c6 | refs/heads/master | 2022-09-07T16:56:19.403975 | 2020-05-30T09:36:38 | 2020-05-30T09:36:38 | 268,049,569 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,913 | ino | copy_of_serijski_port1.ino | #include <avr/io.h>
#include <avr/interrupt.h>
#include <avr/pgmspace.h>
#include <util/delay.h>
#define BR_KORISNIKA 10
char korisnici[BR_KORISNIKA][32] =
{
"Marko Markovic",
"Milan He",
"Nikola Nikolic",
"Nikola Simic",
"Sinisa Nikolic",
"Petar Rodic",
"Zoran Kalezic",
... |
487bfb808e611de6d3228b94f3d2d420c8daa8f4 | da1500e0d3040497614d5327d2461a22e934b4d8 | /net/third_party/quic/core/crypto/crypto_server_config_protobuf.h | ed201439126b95b5bee1d5ea4c619dfb3aef99a8 | [
"BSD-3-Clause"
] | permissive | youtube/cobalt | 34085fc93972ebe05b988b15410e99845efd1968 | acefdaaadd3ef46f10f63d1acae2259e4024d383 | refs/heads/main | 2023-09-01T13:09:47.225174 | 2023-09-01T08:54:54 | 2023-09-01T08:54:54 | 50,049,789 | 169 | 80 | BSD-3-Clause | 2023-09-14T21:50:50 | 2016-01-20T18:11:34 | null | UTF-8 | C++ | false | false | 3,679 | h | crypto_server_config_protobuf.h | // Copyright (c) 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef NET_THIRD_PARTY_QUIC_CORE_CRYPTO_CRYPTO_SERVER_CONFIG_PROTOBUF_H_
#define NET_THIRD_PARTY_QUIC_CORE_CRYPTO_CRYPTO_SERVER_CONFIG_PROTOBUF_H_
#... |
4a37316851a28df17d0d3a6280f5a708bb2396e4 | 03db02dfd69267e9974f0d975c1af8077f32d566 | /dfg/randAll.hpp | 97a4b7244f11cd2f427c0846eddc5f67319f83f8 | [
"BSD-3-Clause",
"BSL-1.0",
"LicenseRef-scancode-public-domain"
] | permissive | kluge/dfglib | 930b90b7444d480a3f9d75375c4b33c9aafb51a6 | be351899feea8dd3fa978f1a5fd99c5cecd4f497 | refs/heads/master | 2020-09-07T04:43:30.728355 | 2019-11-09T12:05:49 | 2019-11-09T12:05:49 | 220,658,736 | 0 | 0 | null | 2019-11-09T15:03:18 | 2019-11-09T15:03:18 | null | UTF-8 | C++ | false | false | 37 | hpp | randAll.hpp | #pragma once
#include "rand.hpp"
|
20cd74b6da94a91f03caf82dcf8b5206b75b6300 | 8fe458ccb4aa7d875138c0d68b37eca5e02b191f | /NT-Template/ntechnium/libNtechnium/Geometry/ntMeshPts.h | 0d29a53269c9dcfdb002e392c9f41a9a6bc64a65 | [] | no_license | jwarton/N-Technium-Libs | 786cc8358827a566908266bbeff88175fbf941ad | 8733436bb9936bde482c96a4f44c79d8030b6657 | refs/heads/master | 2020-12-09T11:13:26.445865 | 2017-08-30T14:29:52 | 2017-08-30T14:29:52 | 44,542,206 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,315 | h | ntMeshPts.h | ///////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////// ntMeshPts.h
// openGl scratch libs ///////////////////
// Mesh Class from explicit point list ///////////////////
// created by James Warton on 04/05/2014 ///////////////////
////////////... |
93908c17059c1a98239ecca3d2b1c93c714bf3d6 | 9d9f8e888b08e34f774f596c3121ad8666ba9302 | /Include/PhysicsEngine/AxisAlignedBoundingBox.hpp | 4833e46965af27b12e7ec9103d444c88c531012e | [] | no_license | TommyRadan/Labyrinth | 756075d1269275895d76476c380a826d88437937 | b50018678c55d2d7c702cd7b8b28d91bc89ddc99 | refs/heads/master | 2021-09-03T20:13:59.785249 | 2018-01-11T17:16:17 | 2018-01-11T17:16:17 | 109,323,828 | 1 | 0 | null | 2017-11-04T19:31:09 | 2017-11-02T22:07:20 | C++ | UTF-8 | C++ | false | false | 327 | hpp | AxisAlignedBoundingBox.hpp | #pragma once
#include <glm.hpp>
namespace PhysicsEngine
{
struct AxisAlignedBoundingBox
{
AxisAlignedBoundingBox(float minX, float minY, float minZ, float maxX, float maxY, float maxZ);
const bool IsInCollision(glm::vec3 point);
private:
float m_MinX, m_MaxX;
float m_MinY, m_MaxY;
float m_MinZ, m_MaxZ;... |
f0ecf1a2584b8880f636dcb0fde50900e7d3353e | 44ffe14c37baf3b16932c00677d8b35575f32755 | /src/xtopcom/xdata/src/xdatautil.cpp | a9db9c5c4e8bc74efe7d4045b2ad871f82e2e3e1 | [] | no_license | telosprotocol/TOP-chain | 199fca0a71c439a8c18ba31f16641c639575ea29 | 1f168664d1eb4175df8f1596e81acd127112414a | refs/heads/master | 2023-07-25T01:24:34.437043 | 2023-06-05T01:28:24 | 2023-06-05T01:28:24 | 312,178,439 | 13 | 46 | null | 2023-07-18T01:09:29 | 2020-11-12T05:38:44 | C++ | UTF-8 | C++ | false | false | 1,896 | cpp | xdatautil.cpp | // Copyright (c) 2017-2018 Telos Foundation & contributors
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <string>
#include <vector>
#include <assert.h>
#include <cinttypes>
#include "xbase/xint.h"
#include "xbase/xme... |
06d560a1f4c6d1cceebabc8b954c6dfd11e278cd | 2cbee1cb5a4b52ec20f362250b0252e7fcf2bdd0 | /Lists-Iterators/lists/node_sequence.h | c3fb1e40f8608587b7b21641d79fcc7279762137 | [] | no_license | j84guo/dsaai-cpp | a1b9c261da6a585bc5495bd0b5f84bf573169ea3 | 4ecddfacfcdb79e56f3a5667083cf60e05695dcb | refs/heads/master | 2020-03-18T17:45:09.089392 | 2018-11-19T06:58:26 | 2018-11-19T06:58:26 | 135,048,441 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 692 | h | node_sequence.h | #ifndef NODE_SEQUENCE_H
#define NODE_SEQUENCE_H
#include "node_list.h"
#include <iostream>
using std::cout;
using std::endl;
template <typename E>
class NodeSequence : public NodeList<E>{
public:
E& atIndex(int i) const;
int indexOf(const typename NodeList<E>::Iterator& p) const;
};
template <typename E>
E& Nod... |
3176f1e8d13bddcacaf7d706f2797d52bbc6fc37 | 3672eb1395ecadb9f5ce0ba81d7bd2de26f9875b | /mcu/Sources/middleware/SPM/spm_info.inc | 7e035cabe8a9628ff38ca2ac1727b36ada8da9b8 | [] | no_license | lzxcvbnm11/EP21H- | d45bcecc46d3e7937995ad02898502854a86162a | 81a01135c0a4ac2db375a6e831107323f2a1ae96 | refs/heads/master | 2020-04-05T11:05:36.928799 | 2018-11-09T06:47:53 | 2018-11-09T06:47:53 | 156,821,907 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,193 | inc | spm_info.inc | /*****************************************************************************
* Copyright (C) 2018 ShenZhen Yeedon Media co.,LTD. All rights reserved.
*
* File Name : spm_info.inc
* Description : including DIIC driver header files.
* Author: qq
* Date: 2018-06-07
*******************************************************... |
91a657b8c050273be2ec3e6a33dc64eee2d31f35 | 9de3293e4c22fcaf4682babf67f7a4ab21f91098 | /05-most-recent-out/shared/src/mro.cc | f6ce7937739724889aa693da6667690bdbef329b | [
"MIT"
] | permissive | timmerov/aggiornamento | 1c3404a64f4b2cc02b4d2df92f68eee4379af201 | d6af5c42d96522f6987c4b7c05a9421177504bcd | refs/heads/master | 2020-12-25T14:48:12.778909 | 2017-06-29T22:05:44 | 2017-06-29T22:05:44 | 67,525,837 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,272 | cc | mro.cc | /*
Copyright (C) 2012-2016 tim cotter. All rights reserved.
*/
/**
most recent out example.
mro implementation.
assumes: single producer, single consumer.
long ago this was called a triple buffer.
however that term is now confused with a fifo with
three buffers.
cause microsoft.
sigh.
so now i use the term most-rece... |
9fb8c208235ab8e61b5e717a609927b31dcdfbd8 | e153f1c20a0f8d8dceddb7e17f3700d8fc9d6f20 | /AppFrame/source/Application/ApplicationBase.h | 18ecc9d94352101c664a4aa57fadefde55767ea5 | [] | no_license | Matsu-Td/TensionBlower | 71c7f970f3decea097f2d9e91aa9edeb7d8ea9ba | f3b08c4ad842afd9e12019c778f5aa8e32feff50 | refs/heads/master | 2023-04-24T09:42:10.870235 | 2021-05-18T15:56:22 | 2021-05-18T15:56:22 | 356,140,957 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 2,665 | h | ApplicationBase.h | /**
* @file ApplicationBase.h
* @brief アプリケーション基底クラス
*
* @author matsuo tadahiko
* @date 2020/12/18
*/
#include "dxlib.h"
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "../Mode//ModeServer.h"
#include "EffekseerForDXLib.h"
namespace appframe {
/**
* @brief アプリケーション基底クラス
*/
class A... |
2e20bca398cb8342b81946dc4426d395e45684b3 | b5e06773a21efb3be2372c9cede361c5240ae954 | /HW4/core/test2.cpp | 6873ac440ac6c68f308c7c69084a49c2af51c418 | [] | no_license | WU-TING-HSUAN/NTUT-EE-ACV | 3ab38ef4d3a0c19e265a50dbfd19ac651bbd5f3f | f23dbb737f5a6a13fc363f3068665d14e77a1b1d | refs/heads/main | 2023-02-26T11:34:56.195504 | 2021-02-04T10:18:03 | 2021-02-04T10:18:03 | 333,695,095 | 0 | 0 | null | null | null | null | BIG5 | C++ | false | false | 4,915 | cpp | test2.cpp | #include <opencv2/core/utility.hpp>
#include <opencv2/tracking/tracking.hpp>
#include <opencv2/videoio.hpp>
#include <opencv2/highgui.hpp>
#include <iostream>
#include <cstring>
#include<fstream>
#include <time.h>
using namespace std;
using namespace cv;
int max(int a, int b);
int min(int a, int b);
void to... |
007ce5eb37da302e125590f1097a08ac291ca1a3 | e91f0624b1615f7a6fcc089daf568f18d9a98ed1 | /data/tplcache/d9a360db880665a0f4b8a089eff5e876.inc | a453ba5c89919c3b1a6f40d8fdaab567b8aa8661 | [] | no_license | kanbei001/kbetyy_com | cbe1970c4b3951329e0d024d6ad7d0999cbf9800 | 880c7f78ad9c6a1dd2cc2c5245ef0f1d2f7f6520 | refs/heads/master | 2021-09-08T10:57:08.888585 | 2018-03-09T08:19:10 | 2018-03-09T08:19:10 | 124,475,174 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 34 | inc | d9a360db880665a0f4b8a089eff5e876.inc | /uploads/171118/1-1G11Q125533L.jpg |
698f0f12338f801965930f205dde36c786e1a0e0 | 22b24b43b398f766c293c24ddba47017150be29b | /src/gameObject.h | daa15c0b92f66e3d93a64fc699952dc3fb5372d3 | [] | no_license | adrianmisko/opengl-liquor-store | f72eaa411efa7256fddd8d93189f2f05431d0fd9 | 516fb3415e5123dd77fc9767f753fda100175283 | refs/heads/master | 2020-05-01T19:15:42.196825 | 2019-05-22T18:42:53 | 2019-05-22T18:42:53 | 177,643,992 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 811 | h | gameObject.h | #pragma once
#include "resources.h"
#include "model.h"
#include "shader.h"
#include "dynamicsWorld.h"
#include <fstream>
#include <string>
struct GameObject {
int ID;
btScalar mass;
float modelMatrix[16];
std::string type;
btCollisionShape* collisionShape;
btRigidBody* rigidBody;
btMotionStat... |
fec1912658b20826943c10bfc2ef011fb4af3546 | 6bb4b9b79dd9b6ba96091f5f4344ca060d09f2aa | /AP-flightgear-interpreter/Parser.cpp | cc5c721e5055b5a51b2512c1b1515eea833d6053 | [] | no_license | orsanawwad/APEX | 84304558236a4525a70afa6d1233787c75df5f53 | 980b714e144f4b90c8fd1241f9cd6eae3e6bfcab | refs/heads/master | 2020-09-21T20:49:28.385061 | 2019-11-30T16:44:08 | 2019-11-30T16:44:08 | 224,924,776 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,651 | cpp | Parser.cpp | #include "Parser.h"
#include "OpenServerCommand.h"
#include "DefineVarCommand.h"
#include "ConnectCommand.h"
#include "LoopCommand.h"
#include "IfCommand.h"
#include "DBEngine.h"
#include "iostream"
#define PRINT_UNKNOWN_COMMAND_ERROR "Syntax Error: Unknown command '" << *lexerIteratorBegin << "'" << std::endl;
Parse... |
ae62ad7458321d421c219b9df082f26f17e1212c | ea8cfcb7536c6575ca723e916fab6913e2ce6171 | /target_sum_01_k_snap.cpp | 52e60d60f3a09c7a2164581016d21aa0eb3f768b | [] | no_license | AmanMSHRA/Solved-challanges- | cb057d6a596354ed183675595b7a98a40071a92d | 839e2e98dfbd30d85ed110dda4bac2136573938e | refs/heads/main | 2023-02-21T06:31:02.095502 | 2021-01-22T09:47:23 | 2021-01-22T09:47:23 | 331,866,132 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,089 | cpp | target_sum_01_k_snap.cpp | #include<bits/stdc++.h>
using namespace std;
int target_sum_01_ksnap(int arr[],int n,int t,int sum)
{
if(sum==n && t==0)
{
return 1;
}
else if( su... |
d5e9a0726c7f5f6cf0b2cd314059a2fe2cb13780 | 03462a00d09c7f9a7e82ffb8ff125c1d9266e846 | /Quadtree.cpp | e412ceb76cf82da3f9c9192c26cf4c2a6d8a9aac | [] | no_license | lucipher128/QuadTree | 3d80bc0cbe5c28593fbe7a3f9c7bf3d3a6d2ed9e | f598b52f5ff77e98d391687b332a63ae0538a0e6 | refs/heads/master | 2020-12-04T23:15:17.375356 | 2020-01-20T19:51:43 | 2020-01-20T19:51:43 | 231,932,501 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,952 | cpp | Quadtree.cpp | #include"QuadTree.h"
//============================================================================
//===============================POINTS ======================================
Point::Point(float x, float y) {
this->x = x;
this->y = y;
}
float Point::GetX() {
return this->x;
}
float Point::GetY() {
return this... |
2492eb403476a2eb39f30f4a5fae3d87b322c730 | 54340ace4df01915fe66cc628e7f6e0b0db80422 | /ledgerview.cpp | 6547025e453631d3a97875ff9ddbfc7d4964a2e2 | [] | no_license | probonopd/Accounting | 324eb1f951752aa0364e71010d7ee7e58e7f533c | 4fc5e4601790d54e5bd3882852709f30d63513e3 | refs/heads/master | 2021-01-20T22:51:55.444009 | 2016-09-12T15:40:54 | 2016-09-12T15:41:27 | 68,156,424 | 1 | 0 | null | 2016-09-13T23:43:13 | 2016-09-13T23:43:12 | C++ | UTF-8 | C++ | false | false | 7,795 | cpp | ledgerview.cpp | #include "ledgerview.h"
#include "ledgerdelegate.h"
#include "ledgervheader.h"
#include "commands.h"
#include <QKeyEvent>
#include <QKeySequence>
#include <QMimeData>
LedgerView::LedgerView(QWidget *parent) : QTableView(parent)
{
horizontalHeader()->setSectionsMovable(true);
setHorizontalScrollMode(QAbstractIt... |
625e2bcc674ce96e552684a659e1343ae2d40160 | 238165028f560e39a5fa795a0d3b1d9e6d34ba11 | /MyPDE/src/ElasticityCrackOpening2D.cpp | f029f2f7d532a7adc1c7b61dcf2b45989450657d | [] | no_license | pmueller2/NuToApps | 3b1d41b34cc3267f270fd20311543ec0751e96e2 | b09cb916ed510d79df99c85666a0b0b9a1bf6608 | refs/heads/master | 2018-12-18T08:58:14.402501 | 2018-09-14T12:28:47 | 2018-09-14T12:28:47 | 125,864,845 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,299 | cpp | ElasticityCrackOpening2D.cpp | #include "nuto/mechanics/mesh/MeshFemDofConvert.h"
#include "nuto/mechanics/mesh/MeshGmsh.h"
#include "nuto/mechanics/integrationtypes/IntegrationCompanion.h"
#include "nuto/mechanics/interpolation/InterpolationQuadLobatto.h"
#include "nuto/mechanics/constitutive/LinearElastic.h"
#include "nuto/mechanics/integrands/D... |
bd620c0c9a5904ec0920f4fbc4744a1710504450 | b715ec24c6bbf40935b8d09f30ab49af7e601f5a | /src/Camera.h | 3210163e9104c232031c901ab67a7377aae94939 | [] | no_license | alban-s/raytracing | 0fa9b8d9df6b7eaef020078225a565daa4252132 | 38ccffa6ac1be97750c6f6d5ec04bc487a08eb57 | refs/heads/master | 2023-03-25T05:01:59.316959 | 2021-01-14T22:25:03 | 2021-01-14T22:25:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 607 | h | Camera.h | //
// Created by constantin on 12/09/2020.
//
#ifndef RAYTRACING_CAMERA_H
#define RAYTRACING_CAMERA_H
#include "Vector.h"
#include "Matrix4x4.h"
///\brief Classe de la camera
class Camera {
public:
Position origin;
static float fov;
static Matrix4x4 cameraToWorld;
///\brief Regle la camera
///\... |
bbc9c206a0ba30560d73e886617de9e259d51fd6 | d00807fe7b2c6c9b71f64788d9ff9ac53da57133 | /page_builder/js_polygon.hpp | c797830a1120eec923a7caaab81985be31862d12 | [] | no_license | olegh/chm | ee234f42c2ac102974144d8d37ffceb660f0c874 | de254ce41f9f39dc75693efd2a7144317dce4266 | refs/heads/master | 2021-01-19T00:08:36.756994 | 2013-07-14T17:46:32 | 2013-07-14T17:46:32 | 1,481,914 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,094 | hpp | js_polygon.hpp | #if !defined( BA669AA0_EF10_4a56_B5DA_90FF38383232 )
# define BA669AA0_EF10_4a56_B5DA_90FF38383232
#include <string>
#include <sstream>
#include <boost/property_tree/ptree.hpp>
#include <boost/cstdint.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/iterator/filter_iterator.hpp>
#include <boost/foreach.hpp>
#inc... |
0aabd1031ba774a14b803c0a801146b3b4d396e6 | 3630a2ec288d62d74f9018720a1e804ffc039fdf | /ABC/ABC150/c.cpp | 40a2dc25a80dfaea24e50ced01d4ba22c2bb8093 | [] | no_license | kant/AtCoder | 8f8970d46fb415983927b2626a34cf3a3c81e090 | b9910f20980243f1d40c18c8f16e258c3e6e968f | refs/heads/master | 2022-12-10T10:15:43.200914 | 2020-02-17T07:23:46 | 2020-02-17T07:23:46 | 292,367,026 | 0 | 0 | null | 2020-09-02T18:45:51 | 2020-09-02T18:45:50 | null | UTF-8 | C++ | false | false | 1,144 | cpp | c.cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> P(n), Q(n);
for(int i = 0; i < n; i++){
cin >> P[i];
}
for(int i = 0; i < n; i++){
cin >> Q[i];
}
vector<int> A(n);
fo... |
71d9a81642cf9ed41423cedc9dd88368ca38949a | b9c64f2110438454173b1086c39f34283fda23ab | /cracking_the_coding_interview/1_5_one_away.cpp | 489a7cd7f078488b041ed45fc2e0916b7cc92d64 | [] | no_license | jmeadows4/coding_problems | 1f759bae731cc939dd0265e720454e232aa40d90 | f81971b7ff04149fb6b61ccf0ba778863c2682bd | refs/heads/master | 2022-09-30T03:12:02.908759 | 2020-06-06T05:28:30 | 2020-06-06T05:28:30 | 269,868,877 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,694 | cpp | 1_5_one_away.cpp | #include<iostream>
#include<string>
#include<unordered_map>
#include<cstdlib>
using namespace std;
/* check if a string is one operation away from another string. operations you can preform:
* add a character
* remove a character
* swap a character
*/
bool one_away(string s1, string s2){
int size;
//if th... |
32a50697a6c200e14b8d4b7e84806d21a6e04008 | f5c0d5ea5d659bf4bde7e0b025022b59fd521d3b | /cpp/agrecacao_e_composicao/exemplo_1/telefone.cc | 38dd90c7c414aa752b99a51a27bf0e066c85a5fc | [] | no_license | hazylua/pt-br | d611b23aa8e280b12ac9132c6e158abb47e8bea3 | 101ac756e6a1b879e222573aaa29e8220cdf907e | refs/heads/master | 2022-03-10T14:25:29.371088 | 2019-02-27T13:00:51 | 2019-02-27T13:00:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 240 | cc | telefone.cc | #include "telefone.h"
Telefone::Telefone (const string &ddd, const string &num_tel)
{
this->ddd = ddd;
this->num_tel = num_tel;
}
string Telefone::getDdd ()
{
return ddd;
}
string Telefone::getNumTel ()
{
return num_tel;
} |
45f7a3fb586ff39a58992c707cb0aa34a7ae10c1 | 1ee92455b7a146626fafd765e0fd7934b69e08eb | /FAIRELCT.cpp | 533c29801ab037042bd033ae5249177c0ba53d99 | [] | no_license | SasmalUdayaditya/Codechef_Problems | eab99dabd077496b187514acc448e21cfb2c9651 | 38f303130a4f51de8b0dfefe75550d4adf5d36c4 | refs/heads/main | 2023-03-07T15:19:21.197902 | 2021-02-21T16:14:04 | 2021-02-21T16:14:04 | 302,969,800 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 985 | cpp | FAIRELCT.cpp | //j2infy Codechef-Long Jan-21
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ll long long int
using namespace std;
ll CalcSum(ll a[],ll n)
{
ll sum=0;
for(ll i=0;i<n;i++)
sum+=a[i];
return sum;
}
int main(void)
{
IOS;
int t;
cin>>t;
while(t--)
{
... |
f3bfa35070cb40d15c5ecc24b3509ec976e4cc37 | 005f320c33d4218054a18e90cb7b574b9a7d5f4c | /VbCodeConstant.h | 9474c541eba6bee31cd8a2a17408b08db4a865d8 | [] | no_license | jmfb/ConvertVb6ToCs | 7652c96df56c45ceb3f3e2846df9b63517be050b | a14322dd4df61b90a9ab2c8a04f7744ae6769f55 | refs/heads/master | 2021-01-10T09:55:00.631698 | 2016-04-12T01:25:18 | 2016-04-12T01:25:18 | 54,246,525 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 780 | h | VbCodeConstant.h | #pragma once
#include "VbCodeValue.h"
#include "VbCodeWriter.h"
#include <iostream>
class VbCodeConstant
{
public:
VbCodeConstant(bool isPublic, const std::string& name, const VbCodeValue& value)
: isPublic(isPublic), name(name), value(value)
{
}
void WriteClassCs(std::ostream& out) const
{
out << " " << (i... |
c0ab284117eec6fc9134227bd055eec59a0b0b65 | d10f93fc85ea3b2e1faf81cededeb65b9f006d1b | /src/Triangle.cpp | b661bca2733cf1f23079d794e194a8bd7c060b84 | [] | no_license | carl2g/Raytracer | 0d45e36fc373d96ee4c617aa6269a4a303110072 | 8f7541251f6a7798964bf1906c90506c53ff79e0 | refs/heads/master | 2023-03-14T14:39:33.537095 | 2021-03-14T16:15:34 | 2021-03-14T16:15:34 | 135,750,579 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,207 | cpp | Triangle.cpp | /*
* @Author: carl de gentile
* @Date: 2018-07-02 11:22:15
* @Last Modified by: carl de gentile
* @Last Modified time: 2018-07-02 11:23:27
*/
#include "Triangle.hpp"
#include <math.h>
Triangle::Triangle(const Vec3<double> &a, const Vec3<double> &b, const Vec3<double> &c, const Color &color)
: Obj(color), _a(a), ... |
9825fe22c153047e1abc05a318a50cb5485e774d | 6d4299ea826239093a91ff56c2399f66f76cc72a | /Visual Studio 2017/Projects/baekjun/baekjun/3062.cpp | 13db99ac05ac58fc6493cca670663fd915bace32 | [] | no_license | kongyi123/Algorithms | 3eba88cff7dfb36fb4c7f3dc03800640b685801b | 302750036b06cd6ead374d034d29a1144f190979 | refs/heads/master | 2022-06-18T07:23:35.652041 | 2022-05-29T16:07:56 | 2022-05-29T16:07:56 | 142,523,662 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 393 | cpp | 3062.cpp | #include <stdio.h>
int inv(int a) {
int t2 = 0;
while (a) {
t2 = t2 * 10 + a % 10;
a = a / 10;
}
return t2;
}
int main(void) {
int n;
int data;
fscanf(stdin, "%d", &n);
for (int i = 1;i <= n;i ++) {
fscanf(stdin, "%d", &data);
int t = data, t2;
t2 = inv(data) + data;
if (t2 == inv(t2)) {
fp... |
2560bc488a7c07653703a05fbd19824b722a7f0c | e6b695c9b0ab3eca8f5424c80db936e6e3f7be72 | /appinfo.h | b4a310792a32e7d0b9e20a4b0e2c7f85630e2f30 | [] | no_license | DriftMind/NTUMEMSOpenVPN | a9bba50db42542423b1736a65911f9d4d6e9099e | 7964c4be8cfddfb403fa00e2f3b14eec6d3f8e60 | refs/heads/master | 2021-01-11T14:45:25.102786 | 2014-06-09T15:35:42 | 2014-06-09T15:35:42 | null | 0 | 0 | null | null | null | null | MacCentralEurope | C++ | false | false | 516 | h | appinfo.h | #ifndef APPINFO_H
#define APPINFO_H
#include <QtGui>
namespace Ui {
class appInfo;
}
// Die Appinfo wird nun eine Singleton-Klasse
// Zudem ist der Name von appInfo auf AppInfo
// zwecks Nomenklatur gešndert.
class AppInfo : public QDialog {
Q_OBJECT
public:
static AppInfo *getInstance ();
~AppInfo(... |
a1e4189b89c45c2d187994fe4a8edadf02cc501d | 125eb97cbfbcea24a6578550c9a3a0db9c447b27 | /include/http/Cookie.h | 7f3ae54a81d5ff2f9116dfccb769cdd9320a3132 | [] | no_license | Anarion-zuo/AnMVC | 13b00485a4c962bda09761137b15e23839a9afef | dd28b6ee98b8dd6e3d9bfa0dc3adec1e840ae765 | refs/heads/master | 2021-05-23T08:22:49.952044 | 2020-05-15T05:38:28 | 2020-05-15T05:38:28 | 253,196,088 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 412 | h | Cookie.h | //
// Created by anarion on 5/1/20.
//
#ifndef MYMVC_COOKIE_H
#define MYMVC_COOKIE_H
#include <container/Map/HashMap.hpp>
#include <container/SString.h>
namespace anarion {
class Cookie {
protected:
HashMap<SString, SString> _map;
public:
void put(SString key, SString val);
Hash... |
07c3787556dc4baf836d40bfa12182dee87d26d2 | 6b550d3d0b182bcddda1f0a175d6b6cd07b60fb3 | /logdevice/common/settings/ClientReadStreamFailureDetectorSettings.h | f5cea22eb7231f851e5a5af88ad3f5518339e978 | [
"BSD-3-Clause"
] | permissive | Rachelmorrell/LogDevice | 5bd04f7ab0bdf9cc6e5b2da4a4b51210cdc9a4c8 | 3a8d800033fada47d878b64533afdf41dc79e057 | refs/heads/master | 2021-06-24T09:10:20.240011 | 2020-04-21T14:10:52 | 2020-04-21T14:13:09 | 157,563,026 | 1 | 0 | NOASSERTION | 2020-04-21T19:20:55 | 2018-11-14T14:43:33 | C++ | UTF-8 | C++ | false | false | 1,546 | h | ClientReadStreamFailureDetectorSettings.h | /**
* Copyright (c) 2017-present, Facebook, Inc. and its affiliates.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#pragma once
#include <chrono>
#include "logdevice/common/util.h"
namespace facebook... |
b45cfe9127301342b842fe847463ae4358364bd6 | 3b40374043ee732d8e45bac5711f56b9146b347f | /12/copy.cpp | 377986d0273f931c4f9eef02995b8a0e2bee193f | [] | no_license | hpsdy/c-plus | 01e2681ddd410a0f71a93e183d610a355d461313 | 9077aff1c62136281777a0e03ab2981aa0330fbe | refs/heads/master | 2021-01-24T04:08:09.042744 | 2018-11-03T04:13:07 | 2018-11-03T04:13:07 | 122,922,744 | 0 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 1,329 | cpp | copy.cpp | #include<iostream>
#include<string>
#include<memory>
#include<stdexcept>
using namespace std;
struct cn{
cn(){
cout<<"default construct"<<endl;
};
cn(string pstr){
str = pstr;
cout<<"user construct"<<endl;
}
cn(cn &p){
cout<<"copy construct"<<endl;
}
~cn(){
cout<<"default destory:"<<str<<endl;
}
voi... |
eedf95be8d2e4e7650515af4081dd3ee9262244e | b24747bb1237595e7a0e33b7cf75804545862513 | /Operation.h | 6637df2c3cc5004aa5895b4e014ee98b51817037 | [
"MIT"
] | permissive | leti9005/prog_2.7.2 | 51f863b4614c008bffb531cd077bc74d54266741 | 6fa17fa361dc955aab1c740b978c0ae551b6d738 | refs/heads/master | 2022-09-06T22:54:54.996212 | 2020-05-28T18:59:18 | 2020-05-28T18:59:18 | 267,671,198 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 517 | h | Operation.h | #ifndef KURS_SEM2_OPERATION_H
#define KURS_SEM2_OPERATION_H
#include <string>
#include <iostream>
#include "GenericList.h"
class Operation {
unsigned int _book;
unsigned int _reader;
unsigned int _date;
public:
Operation();
Operation(unsigned _book, unsigned _reader, unsigned _date);
static... |
3991712892aaf7100309ddf09e31b4694bfaec01 | d86cf8e5ed4612166c0b10e71b46d397f885bf46 | /src/Board.h | 9d329e9c6af4ebf721f60443c536713b40633b28 | [] | no_license | JALB91/mthree | 1a9b80411a924192de1010509a3a462bd6a1492c | 0f9fcbf20cc2d0015f9acd94b5cb3993920d49c2 | refs/heads/master | 2020-03-17T19:11:31.894193 | 2018-05-19T10:37:40 | 2018-05-19T10:39:20 | 133,849,047 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 645 | h | Board.h | #ifndef BOARD_H
#define BOARD_H
#include <map>
#include <cstdint>
#include "Pos.h"
#include "Tile.h"
namespace mthree {
class Board
{
public:
Board(const std::map<BoardPos, Tile>& tilesMap);
~Board();
inline const std::map<BoardPos, Tile>& getTilesMap() const { return this->tilesMap; }
inline const... |
6f357c0a2347ca69bf4eee46658f8e7f2a6da94b | 129b771015af7daf37c03c3b5a3740758a3aabe6 | /tools/don_segmentation.cpp | 3f5cfd3f5df29da9a79c4246cab82c73acea6578 | [] | no_license | 18670025215/pcl_tools | 54747146f678e7aedb90662904b34d9253f8712d | 06057597b89a721e825b3f5059641b13acf64d1f | refs/heads/master | 2020-04-02T17:01:53.418877 | 2018-10-24T07:59:37 | 2018-10-24T07:59:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,219 | cpp | don_segmentation.cpp | //
// Created by robosense on 2018-1-4
//
/**
* @file don_segmentation.cpp
* Difference of Normals Example for PCL Segmentation Tutorials.
*
* @author Yani Ioannou
* @date 2012-09-24
*/
#include <pcl/common/random.h>
#include <pcl/console/parse.h>
#include <pcl/console/time.h>
#include <pcl/features/don.h>
#incl... |
bbbfca162f731dea9040e9958efbc74fab1261cb | 3b131bdc0ed040f5435614ba6b63e0d0b0ae86ea | /include/emp/base/_assert_macros.hpp | 8a402a6658d56afe7edd47c0fd019c348f3653a0 | [] | no_license | emilydolson/Empirical | c2fd46f47d732b72c62eed62c0d73ed651775537 | 8a661a67b2132b46b77b2870bbdc5bcd07368e28 | refs/heads/master | 2021-12-25T04:13:39.968957 | 2021-10-11T17:57:42 | 2021-10-11T17:57:42 | 58,516,662 | 1 | 1 | null | 2018-10-08T17:47:30 | 2016-05-11T05:29:01 | C++ | UTF-8 | C++ | false | false | 3,207 | hpp | _assert_macros.hpp | /**
* @note This file is part of Empirical, https://github.com/devosoft/Empirical
* @copyright Copyright (C) Michigan State University, MIT Software license; see doc/LICENSE.md
* @date 2021.
*
* @file _assert_macros.hpp
* @brief Helper macros for building proper assert commands.
* @note Status: RELEASE
*
... |
66d88392a1e155007d0665306774b332009273b3 | 02cd7f9dc74a9a5d38759affc34a5001eb27a830 | /MapTool/D3D_base/cRay.h | d9abad8a47448ebd337772267b249c6dddf2ddba | [] | no_license | di9208/wow_2 | 3083a7ab205e4b0ee0dd96bd32e1af4fdfb73f20 | 9a941b1ed1982570d8bd23d52df6483fc7d6a51a | refs/heads/master | 2021-05-03T17:40:36.547556 | 2018-02-14T13:36:32 | 2018-02-14T13:36:32 | 120,443,697 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 434 | h | cRay.h | #pragma once
class cRay
{
private:
SYNTHESIZE(D3DXVECTOR3, m_vPos,Pos);
SYNTHESIZE(D3DXVECTOR3 ,m_vDir,Dir);
SYNTHESIZE(D3DXVECTOR3, m_vNDir, NDir);
float t;
float a;
public:
cRay();
~cRay();
static cRay RayAtViewSpace(int nScreenX, int nScreenY);
static cRay RayAtWorldSpace(int nScreenX, int nScreenY);
boo... |
76814822ef18ce56ff069bada29f97e19908b6b5 | 5c176fb35c7f24229657e78014ad151f0bf49880 | /CrazyQueue.cpp | e8dc7423366fc8874667df34a5f8ef02b401e1e3 | [] | no_license | YangKai-NEU/algorithms | e3caac49d6e30bdcbe3268ad16e797167a03f5eb | 308f0f3434392b294747099626c42b963e0ebfef | refs/heads/master | 2021-01-22T07:42:30.083682 | 2017-09-04T02:55:18 | 2017-09-04T02:55:18 | 102,311,499 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,261 | cpp | CrazyQueue.cpp | /*
小易老师是非常严厉的,它会要求所有学生在进入教室前都排成一列,并且他要求学生按照身高不递减的顺序排列。有一次,n个学生在列队的时候,小易老师正好去卫生间了。学生们终于有机会反击了,于是学生们决定来一次疯狂的队列,他们定义一个队列的疯狂值为每对相邻排列学生身高差的绝对值总和。由于按照身高顺序排列的队列的疯狂值是最小的,他们当然决定按照疯狂值最大的顺序来进行列队。现在给出n个学生的身高,请计算出这些学生列队的最大可能的疯狂值。小易老师回来一定会气得半死。
输入描述:
输入包括两行,第一行一个整数n(1 ≤ n ≤ 50),表示学生的人数
第二行为n个整数h[i](1 ≤ h[i] ≤ 1000),表示每个学生的身高
输出描述... |
44094675eb90a3da7b7e8e625cef2e761962384f | 3765be4ab5d4d7829a22208118b255e2c5cc8251 | /task 115.cpp | f42e93cc4a7a745c53c9dcfec03ad4c7a34ff54c | [] | no_license | omirzakye/practice-new- | b84449a1020f63d9123d92781c3a6e1039531460 | a40239aca410784e595b5f416a9f952329dc5900 | refs/heads/master | 2020-09-13T02:06:57.501921 | 2019-11-22T07:25:01 | 2019-11-22T07:25:01 | 222,629,232 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 218 | cpp | task 115.cpp | #include<iostream>
using namespace std;
int main()
{
for(int i=1; i<=10; i++)
{
for(int j=1; j<=10; j++)
{
cout<<i<<" * "<<j<<" = "<<i*j<<endl;
}
cout<<endl;
}
}
|
399f27aa77a954cdc2e46ee24c0f9bc59fd4fd62 | 32c07d976d327888d9eee1365592617ba67c1932 | /Item.h | 425b4d42aa52b2ade457ef7035e91b7244c3dc4d | [] | no_license | MaxJameson/Takeaway | 1843b4bf395e335d0cf0776c8549f9949d8b89da | 4eef695109d2c0e07a22d169887a27f71c6d1947 | refs/heads/main | 2023-03-28T04:28:33.982726 | 2021-03-25T15:31:16 | 2021-03-25T15:31:16 | 351,482,357 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 912 | h | Item.h | /* ------------------------------------------------------
CMP2801M: Advanced Programming
*Title : takeaway
*Form : Item.h
*Use : Header file for Item class
*Creator : Max Jameson
*Student ID : 19702735
------------------------------------------------------ */
#pragma once
#include <... |
033f63fc6526b4f9497d732ff5cae438fd219974 | 7f25ac596812ed201f289248de52d8d616d81b93 | /haihongS/2016/05/2016_05_14.cpp | ec05a6943c8a55fe0fca3e2339704c08242b4185 | [] | no_license | AplusB/ACEveryDay | dc6ff890f9926d328b95ff536abf6510cef57eb7 | e958245213dcdba8c7134259a831bde8b3d511bb | refs/heads/master | 2021-01-23T22:15:34.946922 | 2018-04-07T01:45:20 | 2018-04-07T01:45:20 | 58,846,919 | 25 | 49 | null | 2016-07-14T10:38:25 | 2016-05-15T06:08:55 | C++ | UTF-8 | C++ | false | false | 2,407 | cpp | 2016_05_14.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
const int maxn=4000009;
struct II
{
int v;
int next[26];
} tree[maxn];
char op[20],ans[40];
int loca;
int insert_word();
int creat_node(int s);
int searchit();
int del();
int main()
{
int n... |
338c0c25ddea798347ca59cf4d227cde2bd62fc2 | d77d11ece3b3241e7660005a8d499955dcac35b4 | /c++/Patterns/Creational/Abstract Factory/Factory2.cpp | 61c4a77d42cb0908ffbce7c094f147502a0df763 | [] | no_license | dshevchyk/interviewbit | aa8c98159bd66c1589f9f9de7debed2894ed572a | 8dcb6362f3927b8795b428811b5e230f0209893c | refs/heads/master | 2020-03-23T16:26:06.457563 | 2018-08-12T11:10:02 | 2018-08-12T11:10:02 | 141,809,218 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 481 | cpp | Factory2.cpp | //
// Factory2.cpp
// Interviewbit
//
// Created by Shevchyk Dmytro on 05.08.2018.
// Copyright © 2018 Shevchyk Dmytro. All rights reserved.
//
#include "Factory2.hpp"
#include "ConcreteObjectA2.hpp"
#include "ConcreteObjectB2.hpp"
using std::make_shared;
shared_ptr<AbstractObjectA> Factory2::createObjectA() con... |
144a9c7e08977d1975d55882060ff7f15cb72f4a | 5e4e015bcf88951ae1a15e05fbab3237ec08194e | /program-2-spr19-haydendillon/Scanner.cpp | 90bb8a68c6aad2412922a8ee45093a504e402c62 | [] | no_license | HaydenRoeder1/CS240-Data-Structures-and-Algorithms- | de0ef068bd6a7f864e56cf2f79ef73ef03363037 | e7ab3aaf6d50b016c133e9063f1b22f22d1a9250 | refs/heads/master | 2020-06-23T20:10:02.270546 | 2019-07-25T02:26:26 | 2019-07-25T02:26:26 | 198,740,407 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 861 | cpp | Scanner.cpp | #include "Scanner.h"
#include <vector>
#include "Planet.h"
Scanner::Scanner(std::vector<Planet> planetList){
Heap<Planet> h(planetList);
planets = h;//?
}
std::vector<Planet> Scanner::scan(unsigned int num_planets){
if(num_planets > (unsigned int) planets.size()){
num_planets = (unsigned int) planets.size()... |
15d34d9cc2bdfeb7dc196314a4345ba78d18fb6d | 552c39141dab7cbc0c34245000291a46cdb41495 | /lte_enb/src/tenb_commonplatform/software/apps/fap/management/oam/led-management/LedBehaviourInterface.h | 911eaab02a0ac7f8697533f3445b722dd27bfb4f | [] | no_license | cmjeong/rashmi_oai_epc | a0d6c19d12b292e4da5d34b409c63e3dec28bd20 | 6ec1784eb786ab6faa4f7c4f1c76cc23438c5b90 | refs/heads/master | 2021-04-06T01:48:10.060300 | 2017-08-10T02:04:34 | 2017-08-10T02:04:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,398 | h | LedBehaviourInterface.h | ///////////////////////////////////////////////////////////////////////////////
//
// LedBehaviourInterface.h
//
// Interface for LedBehaviour
//
// Copyright radisys Limited
//
///////////////////////////////////////////////////////////////////////////////
#ifndef __LedBehaviourInterface_h_
#define __LedBehaviourInte... |
c4ddb77e575789105ca6f05b1634d555c86f941b | dc0c9ea3fa7498b0552b5f0cdd121489404cb07a | /codeforces/matrix exponentiation contest/F.cpp | a02e515318741860aa6bd3c0e2e37173929b26ec | [] | no_license | alaneos777/club | 226e7e86983da7f87d87efbfd47d42326872dd25 | 47da01e884d6324aa1c9f701d6f70b8b978a0e18 | refs/heads/master | 2023-08-05T02:43:33.428365 | 2023-07-29T02:43:58 | 2023-07-29T02:43:58 | 143,675,419 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,106 | cpp | F.cpp | #include <bits/stdc++.h>
using namespace std;
using ld = long double;
using lli = int64_t;
using vec = vector<lli>;
using mat = vector<vec>;
const lli inf = numeric_limits<lli>::max();
mat operator*(const mat & a, const mat & b){
int n = a.size();
mat c(n, vec(n, inf));
for(int k = 0; k < n; ++k){
for(int i = 0... |
efb53fc33ad02c652c03145e410231b03bd8890c | 8e4837e6b99ab0bb9151b0f4c28281603bfc21b8 | /progs/fitLSSTspectra.cc | ac39a158117e2c79b411c3524d515920b1c7003e | [] | no_license | alexabate/DirectSim | d35fb25b092fb72fe30a9c1f7bbcb8bf34a4ca9c | 7a58bd5c3e8b05d80cec4c731aeae447bc8842f6 | refs/heads/master | 2021-01-21T05:00:53.250943 | 2016-07-01T21:54:35 | 2016-07-01T21:54:35 | 8,280,620 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 7,676 | cc | fitLSSTspectra.cc |
#include <iostream>
#include <fstream>
#include <string>
#include <math.h>
#include <typeinfo>
// sophya libraries
//#include "histinit.h"
#include "machdefs.h"
#include "sopnamsp.h"
#include "fiosinit.h"
#include "mydefrg.h"
#include "hpoly.h"
//#include "genericfunc.h"
#include "constcosmo.h"
#include "cosmocalcs.... |
5cd1453dc35de0f978d472e89794738d2df3667f | 0d037ab7b4d6138e0da6006b535d3d5bbf502bb6 | /src/Vertex.cpp | 9c0b946ce798cc18850363a5f0358f83289b8fd9 | [] | no_license | Solek798/GeometryEngine | a394bac19d2a7af8101ea814a76eaee016c27c64 | 414019b6f443341e15cd0deed6188ea779f529f4 | refs/heads/master | 2022-11-05T20:21:13.099875 | 2020-06-19T14:43:40 | 2020-06-19T14:43:40 | 269,660,758 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,247 | cpp | Vertex.cpp | //
// Created by felix on 10.06.20.
//
#include "Vertex.h"
geo::Vertex::Vertex() : position(0, 0) { }
geo::Vertex::Vertex(glm::vec2 position, glm::vec2 uv)
: position(position)
, uv(uv) { }
geo::Vertex::Vertex(float x, float y, float u, float v)
: position(x, y)
, uv(u, v) { }
VkVertexInputBindingD... |
8d51be1aa126042f3703ad3329a941d1bbf55c27 | 91c8570f4499a17fb2de5048c66060fc1fc4bfcf | /leetcodeInXcode/Solution/Trapping Rain Water.h | 79db580d6425941ec3571428b728fc23f44381b4 | [
"MIT"
] | permissive | thats2ez/leetcode-in-Xcode | 7b47d2b1e56dc5a6c03f058dcf3ac6484df2f9bc | 6a9cd577276908d1186002d8c365ad2fe84347f0 | refs/heads/master | 2016-09-06T13:26:01.523326 | 2015-08-21T06:34:02 | 2015-08-21T06:34:02 | 25,959,127 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 837 | h | Trapping Rain Water.h | //
// Trapping Rain Water.h
// leetcodeInXcode
//
// Created by Kaiqi on 2/14/15.
// Copyright (c) 2015 edu.self. All rights reserved.
//
class Solution {
public:
int trap(int A[], int n) {
if (n == 0) return 0;
// search for highest bar
int high = 0;
for (int i = 0; i < n; i++)... |
f38fc0537043c7933a383ff43e135509eb8877b3 | b28305dab0be0e03765c62b97bcd7f49a4f8073d | /content/renderer/media/stream/media_stream_constraints_util_audio.cc | e5d1dd41c418f8273c615c1bca622e80c89fed12 | [
"BSD-3-Clause"
] | permissive | svarvel/browser-android-tabs | 9e5e27e0a6e302a12fe784ca06123e5ce090ced5 | bd198b4c7a1aca2f3e91f33005d881f42a8d0c3f | refs/heads/base-72.0.3626.105 | 2020-04-24T12:16:31.442851 | 2019-08-02T19:15:36 | 2019-08-02T19:15:36 | 171,950,555 | 1 | 2 | NOASSERTION | 2019-08-02T19:15:37 | 2019-02-21T21:47:44 | null | UTF-8 | C++ | false | false | 34,469 | cc | media_stream_constraints_util_audio.cc | // Copyright 2017 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 "content/renderer/media/stream/media_stream_constraints_util_audio.h"
#include <algorithm>
#include <cmath>
#include <tuple>
#include <utility>
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.