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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
743904e6018392cec4c92b3fe632752ffd6e26f4 | b115fdbac9e80d46de97fd2bda09ecb7a2541b82 | /neo/idlib/math/Simd_Generic.cpp | 5901ba0bb026861638c72ab579d477eed718f43e | [] | no_license | jmarshall23/Doom3 | 2cb78fe81624bce2b7c68af8bcf437973331621f | f12b34e6fbca8a49dc751f71960e1b609ed8d9cd | refs/heads/master | 2023-05-25T14:30:49.193713 | 2023-05-18T19:33:27 | 2023-05-18T19:33:27 | 360,633,347 | 6 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 81,158 | cpp | Simd_Generic.cpp | /*
===========================================================================
Doom 3 GPL Source Code
Copyright (C) 1999-2011 id Software LLC, a ZeniMax Media company.
This file is part of the Doom 3 GPL Source Code (?Doom 3 Source Code?).
Doom 3 Source Code is free software: you can redistribute it and/or modify... |
0e16269ce4990db442cba3dd7f7d676d3cc8d33a | 2a582f35e436cec0addcb822c9f4a213f4712d47 | /include/mgard-x/DataRefactoring/MultiDimension/Correction/LPKFunctor.h | 8ed80c9ffbb6228384dd2b28b4e10cb41d4f8137 | [
"Apache-2.0"
] | permissive | CODARcode/MGARD | 10bd77f5a4ca4739d396a2fbc4fc2d83d6780ca3 | 7f9fd661cb8083d5fd5d7c345d5453ddabc3633e | refs/heads/master | 2023-08-04T16:15:23.518453 | 2023-07-14T19:04:19 | 2023-07-21T03:19:57 | 157,610,031 | 32 | 27 | Apache-2.0 | 2023-07-21T03:19:59 | 2018-11-14T20:57:29 | C++ | UTF-8 | C++ | false | false | 1,786 | h | LPKFunctor.h | /*
* Copyright 2022, Oak Ridge National Laboratory.
* MGARD-X: MultiGrid Adaptive Reduction of Data Portable across GPUs and CPUs
* Author: Jieyang Chen (chenj3@ornl.gov)
* Date: March 17, 2022
*/
#ifndef MGARD_X_LPK_FUNCTOR
#define MGARD_X_LPK_FUNCTOR
namespace mgard_x {
template <typename T>
MGARDX_EXEC T mas... |
700eb6381e42308a62175ac9dd042b396b4d8a2f | 3a7d140ec93581c61c9c5680cf6bbc319266f688 | /Solved Practice problems/A. Creating a Character.cpp | 7e2bd6f704964a2f80daed1d1b9c948338886616 | [] | no_license | Ovishake1607066/Solved-Codeforces-problems | dcc6e33d471e4e92d1cf76b7c5aab4b0278fbf55 | fe038bb365bd666b2bbcad815e9ad3206d7e0988 | refs/heads/master | 2022-07-17T04:12:21.628142 | 2020-05-13T19:20:09 | 2020-05-13T19:20:09 | 263,710,650 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 789 | cpp | A. Creating a Character.cpp | #include<bits/stdc++.h>
using namespace std;
#define read FILE *fp;\
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
#define dl double
#define sf(n) scanf("%I64d",&n)
#define pf(n) printf("%I64d\n",n)
#define loop for(long long i=0;i<n;i++)
#de... |
888839207385350b9b97e40de153d5273a67b954 | f49dce08e87f4f10725c1e44050d5a401549d9d6 | /CMakeProject.cpp | dfff8d77508d5f7f257131c6dbb2b99bba441a05 | [] | no_license | KseeBMSTU/LR1 | 6335967c0d9ea34672fe812a19219f79457d43e9 | 0264fc7759d7134cd44cc2061cb125e073c12a7a | refs/heads/master | 2022-12-17T22:49:16.759213 | 2020-09-08T12:53:26 | 2020-09-08T12:53:26 | 293,806,673 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 210 | cpp | CMakeProject.cpp | // CMakeProject.cpp: определяет точку входа для приложения.
//
#include <iostream>
int main()
{
std::cout << "Hello from CMake in VS" << std::endl;
return 0;
}
|
1e72ddf793db862d509158d80b82bbe76fe06487 | 9bcb17a001bdc8bd3bf5133621d009139600f532 | /src/latch.cpp | 31c1f4a3c8e8425b449f063cc2c23f95ad8d5a9f | [] | no_license | fzxs/glog | 6db2d8396fb5477c370f508d306b18bf9e36a04b | e416543c271cf5111df5a2c21d731b804552e169 | refs/heads/master | 2020-04-30T21:49:54.871687 | 2019-03-22T08:54:02 | 2019-03-22T08:54:02 | 177,103,528 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,515 | cpp | latch.cpp |
#include "latch.h"
using namespace gtc;
/********************************************************
Func Name: CountDownLatch
Date Created: 2019-1-14
Description: 构造函数
Input:
Output:
Return:
Caution:
*********************************************************/
CountDownLatch::CountDownLatch(int count)... |
103c4a95b627f40d1639060345fc2ff0451f126c | 2785ccb77f80387609601954fb22ed793f812da0 | /Longest Common Prefix.cpp | 80a815db35f1690e43ed0a10e0a5c7758569cbb7 | [] | no_license | DebabrataMaity/Leetcode100 | 0785cf1a4c21d84419660e9c255b9582b6a625b7 | fad197e0bfc8f7943e9e3df34d8402b4d28bcb33 | refs/heads/main | 2023-06-05T01:11:42.439899 | 2021-06-27T15:48:20 | 2021-06-27T15:48:20 | 375,687,877 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 452 | cpp | Longest Common Prefix.cpp | class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string prefix = "";
if(strs.size()==0) return prefix;
string s = strs[0];
int i = 0;
while(i<s.size()){
for(int j=1;j<strs.size();j++){
if(s[i]==strs[j][i]) continue;
... |
bb73952577dd8492097573ecd7159c119eb0471f | 7f25ac596812ed201f289248de52d8d616d81b93 | /wudo/C.cpp | 9feb2fa3f78939041d1f9fef6d80ae0576ac9f57 | [] | 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 | 1,363 | cpp | C.cpp | #include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAX = 180 + 3;
struct node {
int x, y, z;
int dp;
};
bool cmp (node a, node b)
{
if (a.x < b.x) return true;
if (a.x == b.x && a.y < b.y) return true;
return false;
}
int ... |
669950e4b7975775cd5b36017297f5b66545de18 | f150f988fe895ef3632e3b3f5903fd25b27df6a8 | /ZED_Xavier/include/Logger.h | c5b4285e99037dd1dd3932b076312023f6399de1 | [] | no_license | bmhopkinson/image_acquisition | 289c5734ff600fa6aafa796e16394e0eeaa3a112 | 48d835414962aa78d7d01501911d511d3290a110 | refs/heads/master | 2023-08-31T08:42:53.420165 | 2021-10-22T19:33:22 | 2021-10-22T19:33:22 | 241,467,574 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,052 | h | Logger.h | #ifndef LOGGER_H_
#define LOGGER_H_
#include <time.h>
#include <fstream>
#include <chrono>
#include <thread>
#include <sl/Camera.hpp>
#include <yaml-cpp/yaml.h>
#include "system/GPSPoller.h"
#include "system/Arduino.h"
#include "system/Seven_seg.h"
class Logger{
public:
Logger(YAML::Node config_file_, std... |
447b9aaefa6514a2c3cbd4777e6773196557bee2 | a49f43528e534e8d8fe4bec7ec96d0bef839750d | /FlightController/FlightController.ino | 4ad19c01940d91819c04162c6db5182dc869c937 | [
"MIT"
] | permissive | ltrooney/quadcopter | 33368637904085f15ba476ece7af4e3172b893f2 | 7a3efef08d20daf7aebf7f47bb23bc08e6622f56 | refs/heads/master | 2020-03-25T00:29:28.575244 | 2019-08-16T17:29:50 | 2019-08-16T17:29:50 | 143,188,381 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 18,951 | ino | FlightController.ino | #include <Wire.h>
#include <Math.h>
// Pinout assignments
const int PIN_LOW_VOLT_MON = A0;
const int LOW_VOLT_LED_ENABLE = B00100000;
const int LOW_VOLT_LED_DISABLE = B11011111;
const int ESC_4x_ENABLE = B11110000;
/* CONSTANTS */
const int MIN_RX_THROTTLE = 1015;
const int MIN_ESC_THROTTLE = 1000;
const int REFRESH_... |
1efb50f127d394fe71eff3d0659c5015ee38aadf | e618be07df57b7f4e796e946e2c36701415adb83 | /bigram_tagger.cpp | d0f3fc4f3a12567973c210af6c2d656b2145cc03 | [] | no_license | hubertkarbowy/simplehmmpostagger | 565a616bf2a3b1ab110933b73ee696910d0af7cf | 7c7f96eec3a36c83128cfc61eeece663729ad5e7 | refs/heads/master | 2021-06-22T07:19:16.203432 | 2020-12-20T22:49:03 | 2020-12-20T22:49:03 | 164,347,155 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,850 | cpp | bigram_tagger.cpp | #include <iostream>
#include <fstream>
#include "file_ops.h"
#include "string_helpers.h"
#include "ugly_global_vars.h"
#include "getopt.h"
#ifdef __BOOST_SERIALIZATION__
#include <boost/archive/text_iarchive.hpp>
#include <boost/archive/text_oarchive.hpp>
#include <boost/serialization/map.hpp>
#endif
using namespace ... |
0a4c71d2e86631c5fb215adbba21b1ab88be825d | 4a0993484a1f9882dd7ec710d6f26713a12f3d27 | /leetcode/MaximalRectangle.cpp | 554b17a18ffa8ac28a990ad019e9881df6395ec1 | [] | no_license | zhouyuzju/code | fbe6a526260119ba42638d65bffe339063365bb0 | 8401d6c9eb522abd9cb993818cba9d6587ca13d8 | refs/heads/master | 2020-05-18T06:34:25.421161 | 2013-09-06T16:52:55 | 2013-09-06T16:52:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,043 | cpp | MaximalRectangle.cpp | class Solution {
public:
int maximalRectangle(vector<vector<char> > &matrix) {
if(matrix.empty())
return 0;
int n = matrix[0].size();
vector<int> H(n);
vector<int> L(n);
vector<int> R(n,n);
int result = 0;
for(int i = 0;i < matrix.size();... |
a76e418ab4d3b6897b5792487eaa72ca049cad00 | 04703e01d43d9d9fc6e15f3f8774669d277eebee | /examples/ch2/closure.cc | dfa018b3ef38f0705e8d78bb8f969402dc95af8a | [] | no_license | floiges/webAssembly | 4235ac92d2b9c3d072c7228baa6ea0fc37add3ee | 95e33cafbb025e1a4bc0a515e432c22bf19b9cf3 | refs/heads/master | 2020-04-19T04:00:32.619034 | 2019-01-29T08:32:57 | 2019-01-29T08:32:57 | 167,950,375 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 158 | cc | closure.cc | #include <stdio.h>
#include "../em_port_api.h"
EM_PORT_API(int) show_me_the_answer();
EM_PORT_API(void) func() {
printf("%d\n", show_me_the_answer());
} |
b722b9aa8c377dad7dfb3461130bc272b2b17ef4 | ee80de6f1823caf0b1150ad373fe55a30546f6ba | /DictionaryHandler.hpp | 71708a153bfecdeb15f41ad9f6ca79e6504c46f2 | [] | no_license | mlcollard/OOPS21-DictionaryHandler | d2cca7aca5bc42912304bbf5efd29069f7ba268e | f6de7b451fe8e8711a581266a7fdcfc609cfe42f | refs/heads/master | 2023-03-29T02:57:45.262077 | 2021-03-31T12:21:09 | 2021-03-31T12:21:09 | 353,327,653 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 462 | hpp | DictionaryHandler.hpp | /*
DictionaryHandler.hpp
Declarations for dictionary creation
*/
#ifndef INCLUDED_DICTIONARYHANDLER_HPP
#define INCLUDED_DICTIONARYHANDLER_HPP
#include "WordProcessorHandler.hpp"
#include <istream>
#include <ostream>
#include <string>
#include <set>
class DictionaryHandler : public WordProcessorHandler {
pu... |
19eebbf7a70ffd5c54e361763465eacab5216bde | 8cf95b63f8b7139677536be2de3d7e4f3eca193a | /control_scheme/arduino/main/main.ino | e3e1638ed277e15dc0e5d9ca5f062544aa8bc6c4 | [
"MIT"
] | permissive | BHS-AV/software | e3197dedcbc382a5da2cb4a8b26778fe4ec753b1 | 02ebc93002472cf1502c297d4486602a252d4f1b | refs/heads/master | 2020-07-06T08:45:07.217344 | 2020-02-18T20:41:34 | 2020-02-18T20:41:34 | 202,959,912 | 2 | 0 | MIT | 2020-02-18T20:41:35 | 2019-08-18T04:32:50 | Python | UTF-8 | C++ | false | false | 2,215 | ino | main.ino | // Benjamin S. Bussell
// February 26, 2019
// If having trouble with the code submit an issue here:
// https://github.com/BSBussell/VESC
#include "Arduino.h"
#include <Servo.h>
#include <Traxxas.h>
// Custom Library made to abstract the code helping readability.
// Can be found in Traxxas folder
// If modified nee... |
81d7318e017e4fde7cb89704e4689d49aafccb37 | 6aeccfb60568a360d2d143e0271f0def40747d73 | /sandbox/SOC/2007/cgi/branches/release/libs/cgi/example/acgi/login/Logout.cpp | 1205e12f8911611b76d332f0bdf0e1f65392cf2b | [] | no_license | ttyang/sandbox | 1066b324a13813cb1113beca75cdaf518e952276 | e1d6fde18ced644bb63e231829b2fe0664e51fac | refs/heads/trunk | 2021-01-19T17:17:47.452557 | 2013-06-07T14:19:55 | 2013-06-07T14:19:55 | 13,488,698 | 1 | 3 | null | 2023-03-20T11:52:19 | 2013-10-11T03:08:51 | C++ | UTF-8 | C++ | false | false | 323 | cpp | Logout.cpp |
#include <boost/cgi/acgi.hpp>
using namespace cgi::acgi;
int main()
{
service s;
request req(s);
req.load();
response resp;
resp<< cookie("uuid");
boost::system::error_code ec;
std::string fwd (req[form_data]["fwd"]);
resp<< location(fwd);
resp.send(req.client());
return req.close(http::ok);
... |
33819016e97629acec1955fb4f424fad29eb18c8 | b1aa9ad6733efcb53d465809d5109e9174dabf04 | /CCode/GameCode/MGProtonCannon.h | c473d94bfafa8ee4ce018ba0f509cf3105e47cd2 | [] | no_license | dumpinfo/GameMatrixTest | d21545dbef9ade76fe092343a8362da4c8b142ca | 9e4a73ad17555ddb90020c47e2486698b90e4d0d | refs/heads/master | 2023-02-04T01:52:05.342214 | 2020-12-23T17:22:36 | 2020-12-23T17:22:36 | 323,961,033 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,112 | h | MGProtonCannon.h | //=============================================================
//
// C4 Engine version 4.5
// Copyright 1999-2015, by Terathon Software LLC
//
// This file is part of the C4 Engine and is provided under the
// terms of the license agreement entered by the registed user.
//
// Unauthorized redistribution of sou... |
d8710941d674e7cb630ce651574c6ea61eb1e71d | 8d0a53279640a8c8b53645468ac3f06807f4d62e | /Dev/Projects/Libraries/Engine/InputProcessor.h | c1f62c19f8445b5307490a978921294c1bb14f0d | [] | no_license | Hengle/BladeMaster | 72acd7b3a4eca3befc6afd0873e8b2d335f09762 | 3283567d7763aaee60f5e0ffc1d7baeb3f7f530b | refs/heads/master | 2020-04-12T23:56:44.323272 | 2010-11-28T17:31:18 | 2010-11-28T17:31:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 51 | h | InputProcessor.h | #pragma once
class ENGINE_DLL InputProcessor
{
}; |
58c12ed9985a38086ad39f84977b30e9e3ddbf9f | 747f0c4ea2840aaf7806d9944e3bbac9fcb2ec6d | /CV_GT/assets/projets/C++/Librairie/article.cpp | 925ca2c02270c934d7346efe01fd68da10c1f2d3 | [] | no_license | gtourneur442/depot | 6158b51d7e9c51c23d2df45c7ba79a34c5a8d797 | 9d5373be469fa9145ab3f544133e1beabba15945 | refs/heads/master | 2023-02-25T08:24:41.218233 | 2023-02-21T16:38:27 | 2023-02-21T16:38:27 | 233,024,695 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 260 | cpp | article.cpp | #include "article.h"
Article::Article()
{
this->alreadyBorrowed = false;
}
Article::~Article()
{
}
void Article::setBorrowed(bool borrowed)
{
this->alreadyBorrowed = borrowed;
}
bool Article::isBorrowed(void)
{
return this->alreadyBorrowed;
}
|
6fd08d20f91bb092be35aaead39d42df0eeef869 | b0e41de0e785281af388637d61b3757e53f1f429 | /phi.cpp | e9a8aed61c1506b7633e4722f4e9dde5d1db96c6 | [] | no_license | alexfrederiksen/concurrency-problems | d55c14b08a586c1a962b968be0d0af677c0a79a8 | 2af0685b17491186fa474ec0e6d971256265f57b | refs/heads/master | 2021-01-02T10:09:21.702648 | 2020-02-10T17:34:48 | 2020-02-10T17:34:48 | 239,571,699 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,677 | cpp | phi.cpp | #include <iostream>
#include <thread>
#include <atomic>
#include <chrono>
#include <mutex>
#include <condition_variable>
#include <csignal>
#include <cstdio> // I really like printf()
#include <cmath>
// TODO: encapsulate globals
int TABLE_SIZE = 10;
const int STARVATION_TIME = 15000; // ms
const int THINKING_TIME... |
e7459be40e5798d83f901235961be65dc1960579 | c1b76082ce3752885d5277d91d8735125e223609 | /TsCore/Include/MemorySystem.hpp | e4dfb48ca8ccfc21ba8dc150e436dc519154f7d1 | [
"MIT"
] | permissive | p4j4dyxcry/TsFramework3.0 | 6ed99a8de1878f184c559119c99dd82537cae7f1 | 6f01c23ffcb21583e54497014601ac3e4e5840c3 | refs/heads/master | 2020-03-27T15:43:25.925492 | 2019-01-18T08:48:24 | 2019-01-18T08:48:24 | 146,735,181 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 2,802 | hpp | MemorySystem.hpp | #pragma once
namespace TS
{
template <typename T, typename ... Params>
T* MemorySystem::Construct(Params ... params)
{
const size_t memorySize = sizeof(T) + sizeof(MemoryMetaData);
auto pMemory = static_cast<char*>(_pAllocator->Alloc(memorySize));
MemoryMetaData* block = new(pMemor... |
3b9d4d3f814b37db1297f8e97e9a1f9898bef0de | bd5ae64ba8e4f286a9382b65aee5b6cda71e19ee | /Toy_ver2.0/TOY/MyFunc.h | 6723918eadbbf6d5489b6f52aa3a647af25159e2 | [] | no_license | jungjai/Toy-Language | af78e710440cb888db49dc21042a353e09465efb | 14a9e0c1ad9728b8051256c6d58d4bcfd59f965a | refs/heads/master | 2020-05-15T02:50:20.018366 | 2019-05-11T13:30:43 | 2019-05-11T13:30:43 | 182,056,880 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 265 | h | MyFunc.h |
#define MAX_OPR 5
#define MAX_TOKEN 20000
#define MAX_FUNC 200
#ifndef _MYFUNC_H_
#define _MYFUNC_H_
class MyFunc{
public:
char op[15];
char *operands[MAX_OPR];
int oprNum;
char *tokenTable[MAX_TOKEN];
int tokenNum;
public:
MyFunc(char*);
};
#endif
|
89295907000793b6866ed88ccaf71a3e5aea72a2 | 6986f1bf3e45fa60f709554ab8b39154d34274db | /Ability/ARPGCastAction.h | b9e8f84b63843720f751b8d09dfe021035af4364 | [] | no_license | xindelvcheng/ARPGBasic | 4edb14b5be094c16584a70ffc8c81dc8b1dc5e5c | 87cf82797f6caae27f1180ce5094293808d66bd8 | refs/heads/master | 2023-03-16T14:55:36.112074 | 2021-03-06T13:17:34 | 2021-03-06T13:17:34 | 301,295,288 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,202 | h | ARPGCastAction.h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "CoreMinimal.h"
#include "ARPGAction.h"
#include "ARPGCoreSubsystem.h"
#include "ARPGSpellCreature.h"
#include "Engine/DataTable.h"
#include "ARPGCastAction.generated.h"
class AARPGCastAction;
DECLARE_DYNAMIC_DELEGA... |
a46645c6176a118ad031eef1baefac2485fb91a8 | c4692fbdc122876043a060756aa9ef61e563fca1 | /proper/abi/include/abi/dynamic_cast-inl.h | b9b6bd1c537c4be6470176c5b61f8da47d924374 | [] | no_license | nahratzah/ilias_os | 837b8eabe3d638767d552206b5c2691a176069fa | a63c03a36e656cee1b897eb952a39bccc2616406 | refs/heads/master | 2021-01-23T13:43:55.103755 | 2015-06-11T07:37:01 | 2015-06-11T07:37:01 | 28,526,656 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,425 | h | dynamic_cast-inl.h | namespace __cxxabiv1 {
constexpr __dyn_cast_response::__dyn_cast_response(
const void* target, __has_base_result subj_visited)
: target_(target),
subj_visited_(subj_visited)
{}
inline bool __dyn_cast_response::return_now(
const __dyn_cast_request& req, const void* v,
const __class_type_info& v_ti) cons... |
43daf46548457ab7334b4677f2871cd8067162ee | 88b2f6deebd75bbaea1c60c9655b1560fc1675c4 | /project5/project5.cpp | a36a9d2fb6154b0ce3f11be2442f088820b09c40 | [] | no_license | mitchellreyes/CS202 | 6ae537a0316717e9d90b8f7b6480f611da73a0e5 | 55fc557311ef97308a14f02aa4c3bcd3af089643 | refs/heads/master | 2021-01-10T06:37:58.013331 | 2016-02-08T19:51:43 | 2016-02-08T19:51:43 | 51,321,465 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,432 | cpp | project5.cpp | #include <iostream>
#include <fstream>
#include <ctime>
#include <cstdlib>
#include "string.h"
#include "class.h"
using namespace std;
void printReel(symbol *reel);
void readIn(ifstream &fin, symbol *readInArray);
void populateReel(symbol *readInArray, symbol *reel);
void selectReel(symbol *reel);
int main(){
srand... |
cf359f8c8f3d5dec4e7c523720bf3bf46d649976 | 939e2bf9da21ef16f60d418b21ef91601ae03cff | /src/ZeroConfiguration/EspZeroConfiguration.cpp | 0929df6becf86c091bec19847fe80a1bc44c879b | [] | no_license | ThingifyIOT/ThingifyEsp | 3820418a3c4adfc610f75135fc84b7efcad97a64 | 1844dd196b4e02266be0a888b46ecab2e2440829 | refs/heads/master | 2023-08-07T04:30:43.798009 | 2023-07-30T14:55:30 | 2023-07-30T14:55:30 | 203,222,935 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,965 | cpp | EspZeroConfiguration.cpp |
#include "EspZeroConfiguration.h"
#include "ThingifyUtils.h"
EspZeroConfiguration::EspZeroConfiguration(SettingsStorage& settingsStorage):
_settingsStorage(settingsStorage),
_logger(LoggerInstance)
{
}
void EspZeroConfiguration::Start()
{
ChangeState(ZeroConfigurationState::SmartConfigWifi);
_smartConfig... |
f3a12a154c5cf71bb90f953e7dd6b713086a15dc | bae01f64040da08d544b47b40e6063be796cbe37 | /CppND-System-Monitor/include/processor.h | 82d125f5a02fecad70509ce5443ebef003af004b | [
"MIT"
] | permissive | monark12/UDACITY-CPP-Nanodegree | 19dc47bb0bd824356b4aed1487d24a935e1a0bc6 | 2ca7f51ae8b3c46764cc5f111b1eb2b19f05771a | refs/heads/master | 2022-11-10T21:21:46.382490 | 2020-07-03T11:57:10 | 2020-07-03T11:57:10 | 269,034,942 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 369 | h | processor.h | #ifndef PROCESSOR_H
#define PROCESSOR_H
class Processor {
public:
float Utilization(); // TODO: See src/processor.cpp
// TODO: Declare any necessary private members
private:
float previdle=0.0;
float previowait=0.0;
float prevuser=0.0;
float prevnice=0.0;
float prevsystem=0.0;
float previrq=0.0;
float p... |
0152bf89c1d3dde5ca4f6c04eaff46a6a7393128 | 6aada0781661525baa370e53c341e75ba2d488d7 | /DesignPatterns/StructuralPatterns/StructuralPatterns/Glyph.cpp | f7fbd1ba150bb35bc6669ca4ab4c2d50ea5f3b96 | [] | no_license | Zerophase/CodeFromBooks | 2aaf50e07bce39406ad4e4723545e5f0f45c075f | fef44a217cbb33991c29157aa6f60af0b457315b | refs/heads/master | 2021-01-22T13:08:19.788541 | 2015-01-02T05:04:32 | 2015-01-02T05:04:32 | 28,703,442 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 556 | cpp | Glyph.cpp | #include "Glyph.h"
#include "Window.h"
#include "GlyphContext.h"
#include "Font.h"
Glyph::Glyph()
{
}
Glyph::~Glyph()
{
}
void Glyph::Draw(Window *window, GlyphContext &glyphContext)
{
}
void Glyph::SetFont(Font *font, GlyphContext &glyphContext)
{
}
void Glyph::Next(GlyphContext &glyphContext)
{
}
void Glyp... |
a1fec92d7493ca6756d8bea5aae2bb02a5419301 | 88ae8695987ada722184307301e221e1ba3cc2fa | /buildtools/third_party/libc++/trunk/test/std/utilities/meta/meta.unary/meta.unary.cat/integral.pass.cpp | 161d55cad5868f5ade65266734ae9dd21e383bde | [
"BSD-3-Clause",
"NCSA",
"MIT",
"LLVM-exception",
"Apache-2.0"
] | permissive | iridium-browser/iridium-browser | 71d9c5ff76e014e6900b825f67389ab0ccd01329 | 5ee297f53dc7f8e70183031cff62f37b0f19d25f | refs/heads/master | 2023-08-03T16:44:16.844552 | 2023-07-20T15:17:00 | 2023-07-23T16:09:30 | 220,016,632 | 341 | 40 | BSD-3-Clause | 2021-08-13T13:54:45 | 2019-11-06T14:32:31 | null | UTF-8 | C++ | false | false | 2,138 | cpp | integral.pass.cpp | //===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
f60b8ea27c730c33f0c36e608e753218de60a3fb | e1259e991c1560e0cd420dc5605305000c0288e9 | /assignment_2/Problem3.cpp | 283d093d29295ffa732cc3b0e2259e3bab469cfa | [] | no_license | gauravgupta2299/CSN-212_Assignments | 7795a297dce9fbca45eec137a6bc05a66f1d044d | 5d38ec3fd143f01af0343bf8166ebadce94d90f0 | refs/heads/master | 2021-01-13T16:38:11.744088 | 2017-04-11T16:16:04 | 2017-04-11T16:16:04 | 78,884,824 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 597 | cpp | Problem3.cpp | #include <bits/stdc++.h>
using namespace std;
int luckyDraw(int arr[],int n){
int best=1;int LIS[n]; int longest=1;
for(int i=0;i<n;i++)LIS[i]=1;
for(int i=0;i<n;i++){
for(int j=i;j<i+n;j++){
for(int k=i;k<j;k++){
if(arr[k%n]<arr[j%n] && LIS[j%n]<LIS[k%n]+1)
LIS[j%n]=LIS[k%n]+1;
}
longest=max(lo... |
0806449c969c04ea6f0eeb1cf09315d058e336f9 | f0645692aa6232007fd778dedfceda00b3fae57d | /Model-Generator/models/atrias/gen/mathematica/opt/src/J_naturalDynamics15.cc | 96ba1bab60defb10d3f90793aa52760ce1cb617c | [] | no_license | yukaigong/3D_Marlo_Yukai | a57b753d95b07c3d0640989b9722e01e8f984711 | 4c4071957ba147829969c7341b77662c36dda8ab | refs/heads/master | 2022-10-23T14:21:08.563453 | 2017-04-12T16:55:14 | 2017-04-12T16:55:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 205,721 | cc | J_naturalDynamics15.cc | /*
* Automatically Generated from Mathematica.
* Thu 26 Jan 2017 21:36:47 GMT-05:00
*/
#include "math2mat.hpp"
/*
* Sub functions
*/
static void output1(double *p_output1,const double *var)
{
double t1;
double t2;
double t3;
double t4;
double t5;
double t6;
double t7;
double t8;
double t9;
dou... |
2fdd8ae7f68ab95ee098a6c544eed902ec4347a8 | 21b674ece2a632e2a06df2aea54aba06a8bde100 | /DynamicProgramming/problemaTriunghiTraseu.cpp | 911dd09539655d3e3f435f02a74f5c84fc9fbedf | [] | no_license | alexxozo/Algorithms | 1be17f824cb3923340ee86723f82a5b14b375eb3 | 65579bde1858a9cd09a9906777161a6a9184e9e0 | refs/heads/master | 2020-03-18T17:28:18.906248 | 2019-01-16T19:16:49 | 2019-01-16T19:16:49 | 135,031,130 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,235 | cpp | problemaTriunghiTraseu.cpp | /*
* Se consider˘a un triunghi de numere naturale nenule t cu n linii. S˘a se
determine cea mai mare sum˘a pe care o putem forma dac˘a ne deplas˘am ˆın
triunghi ¸si adun˘am numerele din celulele de pe traseu, regulile de deplasare
fiind urm˘atoarele:
Pornim de la num˘arul de pe prima linie;
Din celula (i,j) pute... |
176956744efb4a1073bda416f3f55930c3180302 | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/shell/cpls/desknt5/install2.cpp | a6a0a1b9de6c4b1221bea040e3167df397c17613 | [] | 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 | 110,717 | cpp | install2.cpp | /*++
Copyright (c) 1997-1999 Microsoft Corporation
Module Name:
install2.cpp
Abstract:
This file implements the display class installer.
Environment:
WIN32 User Mode
--*/
#include <initguid.h>
#include "precomp.h"
#pragma hdrstop
#include <devguid.h>
//
// Defines
/... |
323c9fdf4388c094a92cd36b407714c4ad4fa874 | 9881dbe0e997a4ff2d21c5c7bd75447f9ff75d92 | /Scientific_Visualization/codes/writeNetCDF.cpp | 6e4e63bafa13b5eda2534f5d0fac667f55e1cc0c | [] | no_license | kvan1231/westgrid_workshop_2019 | da1e58f83896ee52d658df6175fc5a02ee3f68e5 | bf0f9c5990aa0c26e94fc104eea696bc793e6200 | refs/heads/main | 2023-08-02T14:30:14.089449 | 2021-09-16T22:56:32 | 2021-09-16T22:56:32 | 407,331,417 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,317 | cpp | writeNetCDF.cpp | #include <iostream>
#include <netcdf>
#include <fstream>
#include <math.h>
using namespace std;
using namespace netCDF;
using namespace netCDF::exceptions;
/* this program writes data in NetCDF */
#define nx 100
#define ny nx
#define nz nx
#define NC_ERR 2
float data[nx][ny][nz]; // neeed contiguous storage for NetC... |
f7a289e5fb6a85092fd4d7a40844b10f2285d8e5 | eb7c3395b5edc43f1333cd13db1272a5124532b6 | /deptran/executor.h | a9cfa15f4f674e3ab0714fc8c0850d04dd01a029 | [] | no_license | lolo-pop/dast | 6febd59ed5efe6fa2f8c227cd874e0512cc31f84 | 3a3dcb5225e0690bcd874be1d9d7f80f168735c1 | refs/heads/master | 2023-03-19T20:08:32.370128 | 2021-03-16T14:40:40 | 2021-03-16T14:40:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 806 | h | executor.h | #pragma once
#include "__dep__.h"
#include "constants.h"
namespace rococo {
class TxnRegistry;
class Scheduler;
class DTxn;
class SimpleCommand;
class TxnCommand;
class Executor {
public:
Recorder* recorder_ = nullptr;
TxnRegistry* txn_reg_ = nullptr;
mdb::Txn *mdb_txn_ = nullptr;
Scheduler* sched_ = nullpt... |
238ea592569e7c7ebe5c5e24c75bc936e5cc6ab4 | fffd991af9e271317935d05fbebd4d0886c2146f | /PracticasED/Practica3/include/list.cpp | 74a2644fd51caf077d3a2c0c12114aef4d2980e5 | [] | no_license | jocaro97/ED | e541f65d285df15cb81055f208031c8068eb4bff | 169a9a7fcc9903e3ee348b946602250025de9520 | refs/heads/master | 2022-07-18T06:07:47.250179 | 2020-05-18T21:12:04 | 2020-05-18T21:12:04 | 265,046,448 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,303 | cpp | list.cpp | template<class T>
List<T>::List(){
ultima = cab = new Celda;
cab->siguiente = 0;;
}
template<class T>
List<T>::List(const List& l){
ultima = cab = new Celda;
Celda *cel = l.cab->sig;
while (cel->siguiente != 0) {
ultima->siguiente = new Celda;
ultima = ultima->siguiente;
cel = cel->siguiente;
ultima->ele... |
8c7a35a2009d95688a0a1b3912416abb9a117c03 | c7200aedadf32afa77c6f009f86cd51b12b18362 | /vivos/vivos/mmdc_game_state.h | 8d6b90b89c79e5aedf5671dfc8d693a0e5ef54e0 | [
"Apache-2.0"
] | permissive | Billy2600/vivos | 5c42786db487de3ed8d3180370f4c20cc14133e6 | fee0a16f0892f8f585258d41d73530dd1a230226 | refs/heads/master | 2016-09-06T04:52:41.056518 | 2015-01-28T22:37:12 | 2015-01-28T22:37:12 | 22,890,804 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,740 | h | mmdc_game_state.h | /* ============================================================
GameState
Super class for all the states in the game
Classes derived from this one should have St before their name
===========================================================*/
#pragma once
#include <SFML/Graphics.hpp>
#include <queue>
#include <vecto... |
4e23e4cd64ef12191a6ae151762609ea51d5c6b3 | 45364deefe009a0df9e745a4dd4b680dcedea42b | /SDK/FSD_Options_Scalability_Overall_functions.cpp | 97f3a46112e3537b0d85efffaa9899e0817693e9 | [] | no_license | RussellJerome/DeepRockGalacticSDK | 5ae9b59c7324f2a97035f28545f92773526ed99e | f13d9d8879a645c3de89ad7dc6756f4a7a94607e | refs/heads/master | 2022-11-26T17:55:08.185666 | 2020-07-26T21:39:30 | 2020-07-26T21:39:30 | 277,796,048 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,248 | cpp | FSD_Options_Scalability_Overall_functions.cpp | // DeepRockGalactic SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "FSD_Options_Scalability_Overall_parameters.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Functions
//---------------------------------------------------------------------------
//... |
daad44a6f1be6d8f506b3295c018b5622fbb7690 | d446ed18144ac191377c2a5e0585fb61317b96c2 | /src/eepp/ui/css/stylesheetpropertiesparser.cpp | 78255891d288012fec2d46e2b73620042fc9ea85 | [
"MIT"
] | permissive | thyrdmc/eepp | 6f8ee84f048efaf1b3aca931ea612e61136e15c4 | 93b72b1bcab794a43706658e7978c5e852c3b65a | refs/heads/master | 2023-06-25T11:18:16.371330 | 2019-05-22T04:26:41 | 2019-05-22T04:26:41 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,774 | cpp | stylesheetpropertiesparser.cpp | #include <eepp/ui/css/stylesheetpropertiesparser.hpp>
#include <eepp/math/rect.hpp>
#include <eepp/scene/nodeattribute.hpp>
using namespace EE::UI;
using namespace EE::Scene;
namespace EE { namespace UI { namespace CSS {
StyleSheetPropertiesParser::StyleSheetPropertiesParser(){}
StyleSheetPropertiesParser::StyleShe... |
84cdd7738b66817e6830b5dbb7e3157d7f51c917 | b6c8b3833e1d78c8502abe4a5b36270665ba7fa2 | /dnapage.h | ab504ffc1c235c85be4096f8697b82a4beead862 | [] | no_license | sje397/QtBugs | 9407728be82eaca50ca53ff172637a87f4b1761b | 5481b49e4c1836bd4b4ad857737b32546223def8 | refs/heads/master | 2020-05-09T19:10:27.042561 | 2013-01-15T14:43:46 | 2013-01-15T14:43:46 | 951,034 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 343 | h | dnapage.h | #ifndef DNAPAGE_H
#define DNAPAGE_H
#include <QWidget>
#include "ui_dnapage.h"
#include "bug.h"
class DNAPage : public QWidget
{
Q_OBJECT
public:
DNAPage(QWidget *parent = 0);
~DNAPage();
void setBug(Bug *b);
public slots:
void updateInfo();
private:
Ui::DNAPageClass ui;
Bug *bug;
};
... |
d885ccbb8cb2d43fc4152ae05cf6ea31dd8d9b9b | 5d2a8af9709af1b6e3db40eace44cdfea59df208 | /frameworks/runtime-src/Classes/2dengine/GUIIMEDelegate.cpp | 8b7ae7914e56dc44283d6c85eec56da6d7358712 | [] | no_license | tatfook/ParaCraftMobile | a714a2566fa5c83f675472fc5d6df440b27aafa1 | 072b53957d2a83808ee10fc99e746257e83a4d9a | refs/heads/master | 2021-01-20T08:57:16.049744 | 2017-07-03T03:49:12 | 2017-07-03T03:49:12 | 90,208,741 | 6 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 2,599 | cpp | GUIIMEDelegate.cpp | //----------------------------------------------------------------------
// Class: IME delegate
// Authors: LiXizhi
// Company: ParaEngine
// Date: 2014.9.24
// desc:
//-----------------------------------------------------------------------
#include "ParaEngine.h"
#include "GUIIMEDelegate.h"
#ifdef PARAENGINE_MOBILE
... |
81063b6f61d2343ae98245b32219e7603bc7b1af | 05bafc0664d80406b4aa624db3ccd7f66b804d35 | /SWITCH.CPP | 50828d05c1c077363ea62fd729dbff85e5b61140 | [] | no_license | iannielsenCode/Highschool-Work-C- | 2181df76deb9ef361240eb768cc284640e14218a | 9dc1cd7363afc9d65cefbcd3b287b94cd7f6369e | refs/heads/master | 2020-03-30T05:11:22.580656 | 2018-09-28T19:32:46 | 2018-09-28T19:32:46 | 150,785,683 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,977 | cpp | SWITCH.CPP | //Student: Ian Nielsen
//File Name: SWITCH.CPP
//Last Updated: February 28th 2011
//I, Ian Nielsen, only got help from Mr.Miskin while working on this program.
#include<iostream>
using namespace std;
int main()
{
int distance, cost;
char choice;
cout << "This program will calcualte the toll fo... |
bc63e09a4334d4f44892137749b53146598ae7e6 | e34c3d5df4cd5cff945c4b59881ee3f2bb11ad23 | /testing/DatabaseTest.h | bed456cda1b80f9ce9982dbff115aed5c86821fb | [] | no_license | crc34/MCMC | e64bebde0d3c857fd003d5dff429b2c31c45255c | 13a45513968145523f8c900eed605266e96ce675 | refs/heads/master | 2021-05-04T11:22:25.474512 | 2018-12-25T15:01:46 | 2018-12-25T15:01:46 | 36,090,913 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,241 | h | DatabaseTest.h | #pragma once
#include "gmock/gmock.h"
#include <DatabaseConnector.h>
#include <MCMCDatabaseConnector.h>
class DatabaseTest
{
public:
const std::string hostName = "localhost";
const std::string userName = "user";
const std::string userPassword = "password";
const std::string database = "tmp";
const s... |
41d9d627b12846cefa94e97a16272ff52bbaeab1 | 108dae91ce3009c0fa235735e3459d72de7a7a60 | /dir.cpp | 4ebc79163647da1f2fa11ecc390a456b4cd395ea | [] | no_license | kmailll/invaders | 5b75028bc23d31f13f809e9f0439b9294adeb767 | 8fa6e0c18dfcffd33296cdb584c1efeb5f995cef | refs/heads/master | 2016-09-02T05:54:24.658679 | 2009-01-26T21:52:48 | 2009-01-26T21:52:48 | 109,286 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 502 | cpp | dir.cpp | /*
* File: dir.cpp
* Author: kamil
*
* Created on December 15, 2008, 2:07 PM
*/
#include "dir.h"
Logger Dir::logger;
std::string Dir::dirIDToDirMap[8];
void Dir::
init() {
dirIDToDirMap[1] = std::string("n");
dirIDToDirMap[5] = std::string("s");
dirIDToDirMap[3] = std::string("e");
dirIDToDirMap[7] ... |
092bfc668b01e7ec9cad022f86d93c25575de2b7 | aeef01da43d7aeeef4aae880862bce805c48a8ee | /Problems/Problems/leetcode-Odd Even Linked List.cpp | bfe9f102cde9c561d1400e5a345c47db6d79c848 | [] | no_license | gdjinjiahao/Problems | 732424fa6b6566d41b1fc7b806b02777ff1f4934 | 5a49fee3934b41ba2331c44782e04f574e00ff9b | refs/heads/master | 2021-01-02T08:17:39.129154 | 2018-02-09T03:59:11 | 2018-02-09T03:59:11 | 98,986,587 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,133 | cpp | leetcode-Odd Even Linked List.cpp | /*
题意：给定一个链表，将索引号为奇数的放在一起且相对位置不变，将索引编号为偶数的放在后边，相对顺序不变，要求以O(1)的空间复杂度和O(n)的时间复杂度。
分析：将原链表拆成两个链表，最后合并即可，但注意边界情况。
*/
#include <cstdlib>
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* oddEvenList(ListNode* head) {
ListNode* l1 = ... |
bb810d0a49115e8f74f14b961d1cfc0fef6bc120 | b0b82f8b8298d887082047e517ec224f61d10d4d | /1. Деревья поиска/10 #849/[OK]181572.cpp | fc055f9d3899486e640aabc7721a15f85e8ea17b | [
"Unlicense"
] | permissive | godnoTA/acm.bsu.by | 156f300bbbb7159e4bd77bd3cf620a994dd0dc05 | 3b9494a36bfb381e6748f7172ac2173e7418147f | refs/heads/master | 2023-04-06T03:50:22.547181 | 2022-10-12T22:12:31 | 2022-10-12T22:12:31 | 125,252,573 | 32 | 45 | Unlicense | 2023-03-18T23:54:18 | 2018-03-14T17:53:52 | Java | UTF-8 | C++ | false | false | 6,850 | cpp | [OK]181572.cpp | #include <iostream>
#include <memory>
#include <cstdio>
#include <vector>
#include <cmath>
template <typename T, typename... Args>
std::unique_ptr<T> make_unique(Args&&... args) {
return std::unique_ptr<T>(new T(std::forward<Args>(args)...));
}
class BST {
public:
struct Node {
int data;... |
69a6a24b48f437f0ec50cf1b9164e7070926f3de | e1b528018f5ff19b92b7a71768fdebbb3ec8a3b8 | /src/api/ctp_trader_api.cpp | 02ddbc3bf478ce30d961478f1b20844e472884c6 | [] | no_license | riverdarda/ctp_trader | 0154133e2cc0bf9d7867a6be35fd732a4a4876d5 | f3dd7f96668f1a6fda17e56c9b716c94bd85ff65 | refs/heads/master | 2020-05-04T07:07:57.252696 | 2018-12-19T01:26:58 | 2018-12-19T01:26:58 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 28,533 | cpp | ctp_trader_api.cpp |
#include "ctp_trader_api.h"
#include "CtpTraderHandler.h"
#include "ThostFtdcTraderApi.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <event2/util.h>
#ifdef __cplusplus
extern "C" {
#endif
#include "trader_msg_struct.h"
#include "cmn_util.h"
#include "cmn_log.h"
static ctp_trader_api_cb*... |
0cd751b3187dab6394e1b93fa50d0f0bcc71ede8 | f8d76935f342abceff51a90a2844110ac57a4d2e | /solution/srm519_threeteleports.cpp | 45054ee24e01e96a9fe8f4d6ec48e6c8ba6e7624 | [] | no_license | rick-qiu/topcoder | b36cc5bc571f1cbc7be18fdc863a1800deeb5de1 | 04adddbdc49e35e10090d33618be90fc8d3b8e7d | refs/heads/master | 2021-01-01T05:59:41.264459 | 2014-05-22T06:14:43 | 2014-05-22T06:14:43 | 11,315,215 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 95,377 | cpp | srm519_threeteleports.cpp | /*******************************************************************************
* Automatically generated code for TopCode SRM Problem
* Problem URL: http://community.topcoder.com/stat?c=problem_statement&pm=11554
*******************************************************************************/
#include <vector>
... |
b4f570fb9c60d192812f2666f23f7aee2c18f39d | 83bed2d9488a76e5f0c07e34cc697bc29b5a5401 | /Codeforces/166A.RankList.cpp | e2796de480215d8e89fafa92da1917c62b091351 | [] | no_license | akshayrajp/Competitive-Programming | 0d246e84ab342bbff27d432fcaeff171f5d4d911 | b83385ec686f17cfd042febac395d93030586ff1 | refs/heads/master | 2023-04-06T11:48:39.580392 | 2023-03-25T16:59:53 | 2023-03-25T16:59:53 | 220,184,179 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 830 | cpp | 166A.RankList.cpp | #include <iostream>
#include <utility>
#include <algorithm>
#include <iterator>
#include <vector>
using namespace std;
bool sortbysec(const pair<int, int> &a,
const pair<int, int> &b)
{
return (a.second < b.second);
}
int main()
{
int n, k, i, j, t, y;
cin >> n >> k;
t = k;... |
4703a7eb4ad6e94d3add627dfc25fa94da2ec36d | 6a559427d678f1f9bbc3750fabae694824aaee62 | /findTheRunningMedian.cpp | 1fc5f40cc29eebbf21afecb703c3cd4beeddcadc | [] | no_license | debroygit/HackerRank | b9b08129935355dadbad14e2f545bbb8bdb39612 | 630180bdd5e1ec6b3f52de97af20c0d7e7a1e737 | refs/heads/master | 2020-12-02T10:14:43.423709 | 2017-07-09T20:16:53 | 2017-07-09T20:16:53 | 96,704,553 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 798 | cpp | findTheRunningMedian.cpp | #include <cmath>
#include <vector>
#include <list>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
bool compare ( int &first, int &second)
{
return first < second;
}
int main(){
int n;
double input;
cin >> n;
vector<double> arr;
vector<double> out;
... |
7a0246d3dfd7fb10c9c625dcf2234bdbcb4ad734 | 8330fedb09a7d1c2f8e72ea61e088208eb2d1152 | /Source/Ilum/Loader/ResourceCache.hpp | a54c281e0851539708e0fcfa53527e932f819aa7 | [
"MIT"
] | permissive | LavenSun/IlumEngine | 1057e2c23e205566ec225b61161810fd37dc4216 | 94841e56af3c5214f04e7a94cb7369f4935c5788 | refs/heads/main | 2023-09-03T05:59:03.173546 | 2021-11-20T05:57:25 | 2021-11-20T05:57:25 | 430,141,501 | 1 | 0 | MIT | 2021-11-20T15:39:03 | 2021-11-20T15:39:02 | null | UTF-8 | C++ | false | false | 1,816 | hpp | ResourceCache.hpp | #pragma once
#include "Graphics/Image/Image.hpp"
#include "Graphics/Model/Model.hpp"
#include "Graphics/Shader/Shader.hpp"
#include "Graphics/Shader/ShaderReflection.hpp"
namespace Ilum
{
class ResourceCache
{
public:
ResourceCache() = default;
~ResourceCache() = default;
ImageReference loadImage(const std::st... |
da0311b1be023b89ee4d572a03ed64ad4ed942a2 | 043679db67cbea9537f215ff468b96621194b51f | /OOInteraction/src/string_components/BinaryOperatorStringComponents.cpp | f7932266cd581edf06d4f3fa7c2d9c0fa6f8d31e | [
"BSD-3-Clause"
] | permissive | teeberg/Envision | bd0e4a9f0a5848defdede5d12838855e57e2a1e2 | 964b58e7af0eae204b4d49118756b716daccadbf | refs/heads/master | 2021-01-17T06:26:24.646555 | 2013-04-05T09:07:04 | 2013-04-05T09:07:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,912 | cpp | BinaryOperatorStringComponents.cpp | /***********************************************************************************************************************
**
** Copyright (c) 2011, 2013 ETH Zurich
** All rights reserved.
**
** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the
** follo... |
56993b665e2e4251f3c0e103b857e31f3402a4fd | ef6e90a0c9b2bbfc6a936c34b759bde8f534cf41 | /performance.h | 747915f61f29efdd66742204d9296ab94d73bb18 | [] | no_license | ouayngk/first-level | 1269db7daecedf01fc192a86e0b6cd416587076b | 060e121e90248d65d8603155e7fd780f839ab212 | refs/heads/master | 2020-06-14T01:37:20.849009 | 2019-07-02T11:56:00 | 2019-07-02T11:56:00 | 194,852,294 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 419 | h | performance.h | //measure the embedded system performance
#include "stdint.h"
class perf_counter {
public:
uint64_t tot, cnt, calls;
perf_counter() : tot(0), cnt(0), calls(0) {};
inline void reset() { tot = cnt = calls = 0; }
inline void start() { cnt = sds_clock_counter(); calls++; };
inline void stop() { tot += (sds_clock_coun... |
97c80b5431ea5b3acc4193970abd4612753c8291 | 673bfa5c8ce5046f340b8adc3176a5981b4acbe4 | /c_DERS/dosya işlemleri/dosya/dosya_sıkıştırma/Untitled1.cpp | a36c17452d01461e44e103407ab813bbbb5ad6d5 | [] | no_license | ysfkymz/my-c-codes | 20f207862327647568733f928931c66088995521 | 80b13a8f3aa1e0cc18f1bff5a472305f8d142ed5 | refs/heads/master | 2020-06-03T14:10:18.966307 | 2019-06-12T15:35:05 | 2019-06-12T15:35:05 | 191,598,755 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 490 | cpp | Untitled1.cpp | #include<stdio.h>
#include<conio.h>
main(){
FILE *d1,*d2;
int a,i=0;
char b=0;
d1=fopen("oku.txt","r");
d2=fopen("yaz.txt","w");
while(!feof(d1))
{
if(i==10) break;
fscanf(d1,"%d",&a);
b=(b<<2)|a;
i++;
... |
9ea716bea14959970a958aefd6640e5d7039cc75 | f6f5c158fbb65753ad8f50d62a98717b0a743f91 | /Foo.hpp | 2df8b74d6bafae055dc165a72267e99a918315fe | [] | no_license | Metalhead33-Foundation/FooTestModule | 3a535e1e0d3a1d225092c9daf376f536e5161a81 | 7f98a1b74f9b4b1bc2da8f8c66fb629abbbb08e8 | refs/heads/master | 2021-07-04T07:19:42.366119 | 2017-09-17T07:27:14 | 2017-09-17T07:27:14 | 104,661,684 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 360 | hpp | Foo.hpp | #ifndef FOO_HPP
#define FOO_HPP
#include <ExtensionFramework.hpp>
class Foo : public ExtensionFramework
{
public:
virtual void getReady();
Foo();
static int bar(lua_State* L);
static int HelloWorld(lua_State* L);
static int HelloName(lua_State* L);
static int ShowMeYourAddress(lua_State* L);
};
extern "C" {
Foo... |
b274520fb672f761f05b34dfefb0b322c7764335 | a490aef66f0711c90799d0d2cd914dd0f316b0d5 | /模板/快速排序.cpp | 8ca9b70bf5fd10cfdf6fe82e01e5b0fd5f179ad9 | [] | no_license | Lhw-686/Study | 6d1e5ca54e2828d26d5d77812ccbfbe01ac78993 | c350b34199bfc96efce2f61e848006fe7f2a2413 | refs/heads/master | 2023-07-09T01:42:03.505042 | 2021-08-28T13:34:05 | 2021-08-28T13:34:05 | 400,669,603 | 1 | 0 | null | null | null | null | GB18030 | C++ | false | false | 523 | cpp | 快速排序.cpp | #include<stdlib.h>
void quickSort(int s[], int l, int r){
if(l >= r) return;
//随机选取一个数作为参照
swap(s[l + rand() % (r - l + 1)], s[r]);
//i为小于参照的边界，j为大于参照的边界，x为参照
int i = l - 1, j = r + 1, x = s[r], cur = l;
while(cur < j){
if(s[cur] < x) swap(s[cur++], s[++i]); //左边界+1，cur+1
else if... |
2e5d89b7357d27e3382f1681571218dcf5aed423 | 2acb29b38f8d20bfee548db125906591ed7e378c | /test2/Kine.h | d8e11ece0f286b69444fdd79eaf50d8b79782fc0 | [] | no_license | Solitarily/Delta_Controller | 86629163cc805aa81b8ad8b42f7d7d41326eb8a5 | 2a79ec2e4de6621b667ad449e51094ee4993faaf | refs/heads/master | 2020-03-14T15:05:14.526052 | 2016-08-27T14:24:40 | 2016-08-27T14:24:40 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,227 | h | Kine.h | #pragma once
#include "Robot.h"
///////////////////////////////////////////////////////////
/////////Kine window
//位姿矩阵
struct MtxKine
{
public:
double R11;
double R12;
double R13;
double R21;
double R22;
double R23;
double R31;
double R32;
double R33;
double X;
double Y;
double Z;
};
//TCP矩阵
struct Mtx... |
fcf3236ca964e2ec17062f2332c7a9ef88650f33 | b22588340d7925b614a735bbbde1b351ad657ffc | /athena/ForwardDetectors/ForwardSimulation/ForwardRegion_EventCnv/ForwardRegion_EventTPCnv/src/components/SimulationHitTPCnv_load.cxx | 1c975e468a7032fca079b95a2e579c8d7e6ba132 | [] | no_license | rushioda/PIXELVALID_athena | 90befe12042c1249cbb3655dde1428bb9b9a42ce | 22df23187ef85e9c3120122c8375ea0e7d8ea440 | refs/heads/master | 2020-12-14T22:01:15.365949 | 2020-01-19T03:59:35 | 2020-01-19T03:59:35 | 234,836,993 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 91 | cxx | SimulationHitTPCnv_load.cxx | #include "GaudiKernel/LoadFactoryEntries.h"
LOAD_FACTORY_ENTRIES(ForwardRegion_EventTPCnv)
|
d3fad7d712308d749eac01655504d5a6eb530d48 | e9b7eb09a0d3bbd2994033d22825da8f6ca9e559 | /FYP/IMU/MPU6050/GY85/MagCal/MagCal.ino | 7f1af7b43e56623827acf7600b0707b0e0a46e8c | [] | no_license | aidansmyth95/Undergraduate-Final-Year-Project---Sensor-Fusion | b82a4cc76047253d9f0cf94706164d0076e6b16d | 3c23d85487cfecab6489f45b26dfb49ff237fb75 | refs/heads/master | 2021-06-13T12:12:34.506053 | 2017-04-03T17:57:42 | 2017-04-03T17:57:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,174 | ino | MagCal.ino |
#include "Wire.h"
#include "Kalman.h"
#include "GY_85.h"
#include "I2Cdev.h"
double magMin[3], magMax[3];
GY_85 GY85;
int16_t ax, ay, az, gx, gy, gz, m[3];
void setup()
{
Wire.begin();
Serial.begin(9600);
GY85.init();
for (int i = 0; i < 3; i++) {
magMin[i] = 10000000;
magMax[i] = -10000000;
}
S... |
0ef42267de2f3230d5395a22dd70abd10c5a17ea | fb59dcedeb1aae73e92afebeb6cb2e51b13d5c22 | /middleware/src/app/Setting/SettingModule.h | 49fccbb5abb6a01d2ff4da950d7683570a8d98cb | [] | no_license | qrsforever/yxstb | a04a7c7c814b7a5647f9528603bd0c5859406631 | 78bbbae07aa7513adc66d6f18ab04cd7c3ea30d5 | refs/heads/master | 2020-06-18T20:13:38.214225 | 2019-07-11T16:40:14 | 2019-07-11T16:40:14 | 196,431,357 | 0 | 1 | null | 2020-03-08T00:54:09 | 2019-07-11T16:38:29 | C | UTF-8 | C++ | false | false | 384 | h | SettingModule.h | #ifndef _SettingModule_H_
#define _SettingModule_H_
#ifdef __cplusplus
namespace Hippo {
class SettingModule {
public:
SettingModule();
virtual ~SettingModule();
virtual int settingModuleRegister() = 0;
SettingModule* m_next;
};
} // namespace Hippo
#endif //__cplusplus
extern "C" v... |
5365a02825249fdb2acd27cc306ad3c49fc0cda5 | 24680792208f6f37bcbfe181e2493c3295b3b6ec | /toH265/EncodeJob.cpp | e071e236645277d300c610851088176e1fd1b8a4 | [
"MIT"
] | permissive | ambiesoft/toH265 | ccdb2721526609f72212b48f68a32cf84e9d45bd | 8c9822fdeb93500637dad15d4e1d6760d46ebc98 | refs/heads/master | 2023-05-26T12:02:17.209107 | 2023-05-19T16:00:10 | 2023-05-19T16:00:10 | 181,141,404 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,227 | cpp | EncodeJob.cpp | #include "stdafx.h"
#include "EncodeTask.h"
#include "ListViewItemData.h"
using namespace System::Text;
using namespace System::IO;
namespace Ambiesoft {
namespace toH265 {
using namespace System::Collections::Generic;
using namespace System::Windows::Forms;
void EncodeJob::init(bool bReEncode... |
94d544a6daed195c882057c5c05a557b38e2f9be | 64a41423f567fe8973f57e26910cf1bb2f41b540 | /uva/uva00644_Immediate_Decodability/cpp/tests-uva.cpp | 194d957f39b5282c2498dbc7eabf336d378d7e48 | [] | no_license | lfmunoz/competitive_programming | 1d16b64d4b90214a0745da1460420361a7771f52 | cf6a90c780b422f4b4c0bdcaa7e9a1bcb4f50ad5 | refs/heads/master | 2023-01-24T18:15:01.234165 | 2020-11-23T02:43:19 | 2020-11-23T02:43:19 | 283,283,319 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 436 | cpp | tests-uva.cpp |
#include "../../../_lib/cpp/catch.hpp"
#include "main.cpp"
TEST_CASE( "clean string", "[uva]" ) {
REQUIRE( isPrefix("0001", "00") == true);
REQUIRE( isPrefix("0001", "01") == false);
REQUIRE( isPrefix("0001", "1") == false);
REQUIRE( isPrefix("0001", "10") == false);
REQUIRE( isPrefix("0001", "0... |
1bd3dd920a2e37914003176c884144059f749b9e | bae76888e633874c1278a43bb5773aae8201c44d | /CPSeis/spws_home/include/vaplots/va_iso_gui.hh | 58d90273a0c7e62dc32a8aff99fc9d195f371aa2 | [
"LicenseRef-scancode-unknown-license-reference",
"MIT"
] | permissive | Chen-Zhihui/SeismicPackage | a242f9324c92d03383b06f068c9d2f64a47c5c3f | 255d2311bdbbacad2cb19aa3b91ceb84a733a194 | refs/heads/master | 2020-08-16T05:28:19.283337 | 2016-11-25T02:24:14 | 2016-11-25T02:24:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,675 | hh | va_iso_gui.hh | /*<license>
-------------------------------------------------------------------------------
Copyright (c) 2007 ConocoPhillips Company
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 with... |
a1fa2fef9c54572f063b003d481cfb84dd971580 | ad8ecdec00c3cad400ddae7787811ba7a3b65a6e | /Hajo.cpp | 6d37286c05a51d849b5416f973b26a0e59810ef1 | [] | no_license | pappgr/bead_3 | 354ec7a40ee1725c5279cbb4770da8e1e3b55bf6 | 6fd4fdd1f3703dcdfcebdec71940dfccd98802a6 | refs/heads/master | 2020-03-17T05:18:33.601372 | 2018-05-14T05:50:22 | 2018-05-14T05:50:22 | 133,310,878 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 505 | cpp | Hajo.cpp | #include "Hajo.h"
#include "iostream"
using namespace genv;
Hajo::Hajo(int x, int y, int r, int g, int b, int db):Widget(x,y){
}
Hajo::~Hajo(){
}
int Hajo::xmeret() {
return pxmeret;
}
int Hajo::ymeret() {
return pymeret;
}
void Hajo::rajzol(){
for (int i=0; i<db; i++) {
gout << move_to(x()+(xmeret... |
2d98d1c3615beb933a9de5530b77c0ba031cea18 | a9ba883ccdd929e9bc748727aac8da706b6a526f | /Assignment_Smart_Pointers/Assignment_Smart_Pointers/StringBufferOP.cpp | bf79564fa70e65b86621e0bd8e19ebb4cf41ac23 | [] | no_license | zaheersm/AP_labs | e75fdebaae8dabb10379b3a2268d3fd485972ecf | 04a751b2203c172fa882da6e19f596bd98f4da16 | refs/heads/master | 2021-05-31T22:22:03.653752 | 2016-05-20T06:52:42 | 2016-05-20T06:52:42 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,590 | cpp | StringBufferOP.cpp | /*
* 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.
*/
#include <cstdlib>
#include <iostream>
#include "StringBufferOP.h"
using namespace std;
StringBufferOP::StringBufferOP() {
_lengt... |
76a25fad77dfec34ba349a6cff30697f2d4a1a67 | 9c079c10fb9f90ff15181b3bdd50ea0435fbc0cd | /Codeforces/946A.cpp | f10aa75b7004fc626aa61f598a8d7a9cd0f96969 | [] | no_license | shihab122/Competitive-Programming | 73d5bd89a97f28c8358796367277c9234caaa9a4 | 37b94d267fa03edf02110fd930fb9d80fbbe6552 | refs/heads/master | 2023-04-02T20:57:50.685625 | 2023-03-25T09:47:13 | 2023-03-25T09:47:13 | 148,019,792 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 295 | cpp | 946A.cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,b=0,c=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
int a;
scanf("%d",&a);
if(a<0) c+=a;
else b+=a;
}
//cout<<b<<" "<<c<<endl;
int x=b+abs(c);
cout<<x<<endl;
return 0;
}
|
828b91727d1eb3e88846a93815ee33da92c20ee0 | c742de2bad918ccf3618e365f911cb82a2ee897d | /src/Chunk.cpp | aac1d07a4757afc42c74348ff807dac3646e5f8c | [] | no_license | ferasboulala/wav-riff | 2dde37ee06471f1b2aefa8f37b42779e0229814b | ed27f99113b82c22925992daaeba4ebe9bdef6fb | refs/heads/master | 2020-03-22T22:07:03.155657 | 2018-07-18T15:03:12 | 2018-07-18T15:03:12 | 140,733,862 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,908 | cpp | Chunk.cpp | #include "Chunk.hpp"
#include "WavData.hpp"
#include <assert.h>
#define MAX_CHUNK_SIZE 0xffffffff
Chunk::Chunk(const std::string &name)
: size_(0), actualSize_(0), undefined_(false), variableSize_(false) {
assert(name.size() == 4);
name_ = name;
}
Chunk::Chunk(const std::string &name, const std::vector<Field... |
072777934c7559a88468d34d8418350058b16d52 | 7bf043a834dc8811e6d7f889617c07a1e9f22c70 | /chapter6/code/code6_51.h | fd62100dad12967f2fb5b1aaad0512941429b7a8 | [] | no_license | bug-code/Cpp_primer | 90a3133a33e33baa27e163800803b537887e4322 | 6b39b346ef896f47ec746984c7f55a3536e83cd2 | refs/heads/master | 2023-05-14T11:58:21.733526 | 2021-06-10T03:14:38 | 2021-06-10T03:14:38 | 357,915,126 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 474 | h | code6_51.h | #ifndef CODE6_51_H
#define CODE6_51_H
#include <iostream>
void f(){
#ifndef NODEBUG
std::cerr<<"The function is:"<<1<<std::endl;
#endif
};
void f(int ){
#ifndef NODEBUG
std::cerr<<"The function is:"<<2<<std::endl;
#endif
};
void f(int ,int ){
#ifndef NODEBUG
std::cerr<<"The function is:... |
daeb5b0a48e5b26b78c941e6cb8b60c5cd0c1048 | 0e846c2b93a09aa83064d8ad1a574f03184984af | /chapter10_Sorting_and_Searching/rankFromStream.cpp | d611d2a09707430a0bd3d55a24070a949996c829 | [] | no_license | ihsuy/CTCI | dcb49a2db03a70f9b3ba6fa7d54a1078c576db2d | b791e7325da3d3d9e8c1dabc33fee2068c5af850 | refs/heads/master | 2021-07-05T06:50:04.894758 | 2020-09-01T04:48:49 | 2020-09-01T04:48:49 | 174,632,606 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,384 | cpp | rankFromStream.cpp | #include <math.h>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
t... |
835dd1186130574da22f8d1df6790b44a082c07c | ba1e1e47a37b8e5c2f9597b496e27cf242f4ae15 | /字符串字符循环右移.cpp | b5d26ff0dbfe4cf953452fe96b074aa464efc686 | [] | no_license | LoveLei0427/Test | 8e742f04c0544cb23b1699142009500c8a83c8c6 | 39c40ba012500c320f252cd8b8bc56de6060ae5b | refs/heads/master | 2020-03-18T03:53:02.705584 | 2019-06-11T06:46:30 | 2019-06-11T06:46:30 | 134,260,690 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 231 | cpp | 字符串字符循环右移.cpp | //strcpyÓöµ½'\0'Í£Ö¹
void Loop(char* str,int step)
{
int n = strlen(str) - step;
char res[256];
strcpy(res,str + n);
strcpy(res + step,str);
*(res + strlen(str)) = '\0';
strcpy(str,res);
} |
0ede70a0773b37b3d317cfeff9a6c4d75a677341 | c7d98beb689410cbba2c712a01c25863f267b5dc | /src/normal_mean_prior.cpp | 9be5985d239b83795008f805cb4f20e81725c7c2 | [] | no_license | ml4ai/hamlet_experiment_py2 | 2b8d5b21e9c3c62bc17409da4971869aaf13f705 | 2d49f797d0ee0baa0447e0965468e7c15e796bb7 | refs/heads/master | 2021-03-27T11:41:43.494446 | 2017-11-06T14:31:18 | 2017-11-06T14:31:18 | 61,496,702 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,134 | cpp | normal_mean_prior.cpp | /* $Id: normal_mean_prior.cpp 21443 2017-06-28 18:13:50Z chuang $ */
/*!
* @file normal_mean_prior.cpp
*
* @author Colin Dawson
*/
#include "util.h"
#include "normal_mean_prior.h"
#include "mean_emission_model.h"
#include <boost/make_shared.hpp>
Mean_prior_ptr Normal_mean_prior_params::make_module() const
{
... |
3944429c0373de07743606fd0c9df2fdf76fda5c | 34231cb6ffbdce49ea37bb0f66bfa1a7513e51dd | /CGame.h | 2acbc068f3a6ab336ed2c79d851e895f157cdd0e | [] | no_license | Storaz/B_CPP_HERRMANNFlorian_SDL | fe907f2848a7ba6e8272d9f297740fdb11b9f92c | 2ef21baa1140e26cad5383f91e52d69821119a38 | refs/heads/master | 2020-04-07T10:42:06.018927 | 2018-11-22T09:27:58 | 2018-11-22T09:27:58 | 158,296,991 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 54 | h | CGame.h | #pragma once
class Game {
public:
void Play();
}; |
59407f069cbe4e79c473024e21626797b69cfca4 | 003d8fea3077ede86e4785411424a5acf622252f | /test/txpl/vm/eval_binary_gt_test.cpp | 2e9650716a9e6cf929616e8f54102b98655465bf | [
"BSL-1.0"
] | permissive | ptomulik/txpl | c43f961f160dcdee968fc214b5196b934a4ca514 | 109b5847abe0d46c598ada46f411f98ebe8dc4c8 | refs/heads/master | 2021-06-20T02:01:54.072229 | 2015-05-19T07:14:38 | 2015-05-19T07:14:38 | 31,542,106 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 26,477 | cpp | eval_binary_gt_test.cpp | // Copyright (C) 2015, Pawel Tomulik <ptomulik@meil.pw.edu.pl>
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#define BOOST_TEST_MODULE test_txpl_vm_eval_binary_neq
#include <txpl/test_config.hpp>
#include ... |
667fddf7cc264711d1e582747c8010e0da94cd37 | 55d2d0d5309b2a0502e0d95fac08bdb272085ee1 | /week5/courses/5_a.cpp | 0d2832113dd769cc48bdfbd0c6571349b9569f92 | [] | no_license | AssemAbdirashova/Algorithm | b8571d26800590256308a61c77b0427b958588cb | 4285d4a27449836e7b36952847774217ca7e61f2 | refs/heads/master | 2023-04-13T19:26:22.644803 | 2023-04-04T10:40:05 | 2023-04-04T10:40:05 | 279,627,693 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 576 | cpp | 5_a.cpp | #include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main(){
string s;
cin >> s;
int n;
cin >> n;
vector<bool> v;
vector<string> v1;
for(int i = 0; i< n;i++){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(s.substr(a-1, b-a+1) == s.substr(c... |
6083bcb4920387dc8f3d270c54e4b56e37352563 | b20b01a33fd3baa9b3bc76a795ede307a8c2ca8a | /src/dp/f.cpp | 934ab5f3fc624fa717e7e09fc9c5a062a9abad7f | [] | no_license | kmzn128/atcoder_cpp | 3479f4f25929ce60001ce762bf056d2bb23c90ad | 7aab230776a0e06a02f2f33df38ba92c05024efa | refs/heads/master | 2020-08-27T23:32:09.741027 | 2020-02-27T00:05:03 | 2020-02-27T00:05:03 | 217,520,785 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 615 | cpp | f.cpp | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, a, b) for (int i = (a); i < (int)(b); i++)
typedef vector<string> VS;
typedef vector<VS> VVS;
string Main(string &s, string &t) {
int ss = s.size();
int st = t.size();
VVS dp(st+1, VS(ss+1, ))... |
e91258b1a68466ba1431071fe2f8e46c88562483 | 10b859659f73ea3a41b62dad507273902a4d7daf | /Homework03/Task2_Sever/Task2Sever.cpp | 06b3dcc07af183ff3843628452437e92e58f9c73 | [] | no_license | thangnx97/network-programing | 8be61fd95693a50b331c4b94ef911c60dde86c2b | af2d50d50274190b221ad06194e1a08cb7bebaf9 | refs/heads/master | 2020-05-07T10:20:18.974615 | 2019-04-09T17:21:21 | 2019-04-09T17:21:21 | 180,414,129 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,354 | cpp | Task2Sever.cpp | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
/*
Define _WINSOCK_DEPRECATED_NO_WARNINGS to use some function
that not safe in VS2015
*/
#define _WINSOCK_DEPRECATED_NO_WARNINGS
#include <ws2tcpip.h>
#include <winsock2.h>
#include "myfileopt.h"
#include "mynetopt.h"
#define BUFF_SIZE 10240 //10Kb
#define F... |
956d61b20bee7be18a00571fc94d826713e582e8 | 09ddd2df75bce4df9e413d3c8fdfddb7c69032b4 | /src/LSVG/LDOMDocumentSVGFiltersImpl.cpp | 55da078485f0eb07e8d5858a0781c4134e70e0dc | [] | no_license | sigurdle/FirstProject2 | be22e4824da8cd2cb5047762478050a04a4ac63b | dee78c62a1b95e55fcdf3bf2a9bc79c69705bf94 | refs/heads/master | 2021-01-16T18:45:41.042140 | 2020-08-18T16:57:13 | 2020-08-18T16:57:13 | 3,554,336 | 6 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 5,744 | cpp | LDOMDocumentSVGFiltersImpl.cpp | #include "stdafx.h"
#include "LSVG2.h"
#include "SVGImplementation.h"
#include "SVGFilterElement.h"
#include "SVGFEBlendElement.h"
#include "SVGFEGaussianBlurElement.h"
#include "SVGFECompositeElement.h"
#include "SVGFEFloodElement.h"
#include "SVGFEOffsetElement.h"
#include "SVGFESpecularLightingElement.h"
#include "... |
71103017ff5fa1814addc62cc275e700f533e8d6 | 00f1cfc73ba05f72373fbdfd303f6f34dd3a533e | /JLJutil.m/src/ReentrantLock.cpp | 5d53179d39cac6e6b9df1025e84c12a9373382b4 | [] | no_license | weltermann17/just-like-java | 07c7f6164d636688f9d09cdc8421e51d84fdb25f | 6517f1c1015e0b17a023b1b475fcc2f3eed9bade | refs/heads/master | 2020-06-06T08:32:13.367694 | 2014-07-01T21:19:06 | 2014-07-01T21:19:06 | 21,002,059 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,058 | cpp | ReentrantLock.cpp | // ReentrantLock.cpp
//********************************************************************
#ifndef ReentrantLock_cpp
#define ReentrantLock_cpp
//********************************************************************
#include <jlj/util/concurrent/locks/ReentrantLock.h>
//**********************************... |
ee020338f480f78f06cbd4bff22019afd3fb5a04 | 0012cc471c9f138530597371280e6e7ae62b987c | /2개이하로다른비트.cc | 36d22977bca42372acd4bae9c70d3ec99fdcf428 | [] | no_license | hanbin9775/Programmers_Algorithm | a64c93622b6afe566799511d783ae7266853b698 | 81d27b179a82ef18878f5cc3cdb954c6eabfd59c | refs/heads/master | 2022-03-22T00:37:05.532863 | 2022-03-01T09:27:35 | 2022-03-01T09:27:35 | 212,008,366 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 684 | cc | 2개이하로다른비트.cc | #include <string>
#include <vector>
#include <cmath>
using namespace std;
int findLast0(long long num)
{
int cnt = 1;
while (num > 0)
{
if (num % 2 == 1)
{
cnt++;
num /= 2;
}
else
{
break;
}
}
return cnt;
}
vect... |
739750708f5f25676dc9a95d651e3585b9c9abdd | 03c3ca4bf21422db928dd2736cb05b71e1875a29 | /src/response/Response.cpp | 7fb809fd13b43b205159e06b409278ba986c8f98 | [] | no_license | Croco-byte/ft_webserv | 6780301d892c2e02f3b550cd34cd894b486d8ae4 | dab7463b6b8ba3d86f81feab47c2a5bd70bd998e | refs/heads/master | 2023-06-05T03:20:32.875790 | 2021-06-25T14:54:54 | 2021-06-25T14:54:54 | 380,270,118 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,063 | cpp | Response.cpp | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* Response.cpp :+: :+: :+: ... |
83f8d56e694321a78a973bc1b4020fb46b01662e | ea852cbf3ea88f163bdd06f060ad195f7e86a1a0 | /src/llltableget.cpp | a2da70627fd505a51531e7eadd534c7bc2d898fb | [
"MIT"
] | permissive | gligneul/Lua-Low-Level | 0063a701f80b577746142e6bc676d15750ea6967 | 1579b46e28d9ca16b70b9e9f3c11b389734eca00 | refs/heads/master | 2020-04-05T18:50:21.275492 | 2017-06-08T04:20:35 | 2017-06-08T04:20:35 | 42,790,724 | 14 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 5,275 | cpp | llltableget.cpp | /*
** LLL - Lua Low Level
** September, 2015
** Author: Gabriel de Quadros Ligneul
** Copyright Notice for LLL: see lllcore.h
**
** llltableget.cpp
*/
#include "lllcompilerstate.h"
#include "lllruntime.h"
#include "llltableget.h"
#include "lllvalue.h"
extern "C" {
#include "lprefix.h"
#include "llimits.h"
#include "l... |
4df1ead15375dde75fbfab36ae642a79b3fc81af | bec5d52c5185d032b2b81eccd008aa8e4e045790 | /lwip/src/apps/snmp/snmp_netconn.c | 70f8bfc057cdec9aecd8a806b2a1cd3b12590da0 | [
"BSD-3-Clause",
"BSD-2-Clause"
] | permissive | shadowsocks/badvpn | 2993b0da7c59870f0a550a842cabe3312761d541 | 40a0e5010aa4adb6d3ca1d1418dfde345c50107d | refs/heads/shadowsocks-android | 2021-12-08T06:17:04.546977 | 2021-08-23T04:05:27 | 2021-08-23T04:05:27 | 45,686,048 | 166 | 154 | NOASSERTION | 2021-08-23T04:05:28 | 2015-11-06T14:18:20 | C | UTF-8 | C++ | false | false | 3,508 | c | snmp_netconn.c | /**
* @file
* SNMP netconn frontend.
*/
/*
* Copyright (c) 2001-2004 Swedish Institute of Computer Science.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redistributions of sou... |
bee66d336e7da07d719b0d59dad6383497485761 | 9a75053ab744f4ef273aad57a7b4e6597fa52687 | /Projects/Arkanoid/Shader.cpp | 7d1a66253a6fb9d846ceb2a5a7c25b8fddcdbc56 | [] | no_license | billautd/workspaceCPP | 02c7fe881b16c74d2bba3b4873309e37037902f2 | 1a9f2bd74f842694f2564f17dbe8385fac9f61ea | refs/heads/master | 2023-07-29T14:25:35.664678 | 2021-09-22T11:51:12 | 2021-09-22T11:51:12 | 286,848,451 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,361 | cpp | Shader.cpp | #include "Shader.h"
#include <iostream>
const std::string VERTEX_TYPE{ "VERTEX" };
const std::string FRAGMENT_TYPE{ "FRAGMENT" };
const std::string GEOMETRY_TYPE{ "GEOMETRY" };
const std::string PROGRAM_TYPE{ "PROGRAM" };
const Shader& Shader::Use() const
{
glUseProgram(id);
return *this;
}
void Shader::Compile(cons... |
df06c7282baba807ab0cdbcfa2438fb18e6da06b | 51bd093a3a4546661da966b4ebfb2f3d10d8a9c8 | /overrideselect.cpp | 3febc7ac946d8fa2cbdcd3a369b32f2d06be00f4 | [] | no_license | brandon-t-nguyen/EM_Scheduler_QT | 26f1bb00a141964243bceb3730adc7b78ea107da | 62bb71e59baf59b70eea6ae8b686168eda5c2075 | refs/heads/master | 2021-05-29T12:09:40.182327 | 2015-08-17T01:43:02 | 2015-08-17T01:43:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,428 | cpp | overrideselect.cpp | #include "overrideselect.h"
#include "ui_overrideselect.h"
#include <QString>
#include <QMessageBox>
OverrideSelect::OverrideSelect(QWidget *parent) :
QDialog(parent),
ui(new Ui::OverrideSelect)
{
ui->setupUi(this);
}
OverrideSelect::~OverrideSelect()
{
delete ui;
}
void OverrideSelect::init(Schedul... |
58d2a9dd2d4e809eb5ad55fee00ea1a5c4bec1bf | d79894796fcd98a43f67011a644c6042078ebbb8 | /ExternalDependencies/DebugEngine/Profiling/AutoProfile.cpp | f3742c72ca6ed847be95a1560c72115f837a2674 | [] | no_license | TheJoshuaSalazar/3DRenderer | 17c9af9799a2cc5a97c2ea6fb29359289d876121 | 13f1eab39529fdb1759c4cb42cee9c6071528952 | refs/heads/master | 2021-01-22T09:57:49.883560 | 2014-07-29T04:10:57 | 2014-07-29T04:10:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,193 | cpp | AutoProfile.cpp | #include <stdio.h>
#include "AutoProfile.h"
int Profilers::curretFrame = 0;
float Profilers::Samples[MAX_FRAMES][MAX_CATEGORIES];
AutoProfile AutoProfile::AutoProfilerInstance;
AutoProfile& AutoProfile::getProfilerInstance()
{
return AutoProfilerInstance;
}
AutoProfile::AutoProfile()
{}
AutoProfile::AutoProfile... |
2cee50a83396c4ef16825df6343273e812f75adc | ca7ddc020a032bbc1b2e7b2d47e35d4159fcf33b | /tree/TRIE_tree/Hackerrank_Contacts.cpp | 8e9a11e0cfb9c3e947b91b1d2e6f37f5902b8b3e | [] | no_license | atique7465/Data_Structure_in_detail | dd31b719ba481025ad5a245ba1dc75d28b79332d | 003e90e7e696e19fa8818d1204dc15f30773e22b | refs/heads/master | 2022-10-12T03:08:33.345115 | 2022-10-10T18:45:36 | 2022-10-10T18:45:36 | 186,146,286 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,586 | cpp | Hackerrank_Contacts.cpp | /// solution 01: using trie data structure.
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
struct node
{
ll fullword;
node *next[26+1];
node()
{
fullword = 0;
for(ll i=0; i<26; i++)
next[i] = NULL;
}
};
class trie
{
private:
... |
8b8dbf9a22ba6e3447f96950d053a568acbbd42d | ddb07bc35f34da37b02fa5639c571795673090c4 | /src/main.cc | b3d4e94125e41b65cfbb33b868833bde16ed4cff | [] | no_license | jogloran/asobitomo | aa83267c70aad8388574b9cf2da770a791141049 | 19168d7c86f49523c94681ec6170c7889d2b2ad1 | refs/heads/master | 2021-05-01T10:15:17.041064 | 2018-02-16T06:10:11 | 2018-02-16T06:10:23 | 121,106,369 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 847 | cc | main.cc | #include <iostream>
#include <iomanip>
#include <fstream>
#include "types.h"
#include "cpu.h"
using namespace std;
int main() {
CPU cpu("Tetris.gb");
copy(cpu.mmu.rom.begin(), cpu.mmu.rom.end(), cpu.mmu.mem.begin());
// cpu.mmu.mem[0xff44] = 0x90;
while (!cpu.halted && cpu.pc != 0x100) {
cpu.step();
}... |
b8a90ac9f6139bf92d32c161499f93dba0da234e | cb428b16d983666b7e77f2e451cd0071c3f48f99 | /Robocup/Scene.h | d6f40cc620ea5e8be32b7e6ddb82e6a36a131b84 | [] | no_license | artulec88/Robocup | f62e9dd2451a7d9adb3b111160cda03bc3dcd18e | 20df8902281f6d59aa25e6788a56462f5953b2ba | refs/heads/master | 2021-03-12T20:13:09.406335 | 2013-11-17T04:10:10 | 2013-11-17T04:10:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,371 | h | Scene.h | //#pragma once
//#include <iostream>
//#include <string>
//
//#include "Controls.h"
//#include "Color.h"
//
//class Scene
//{
//public:
// Scene(std::string windowTitle, int windowWidth = 1024, int windowHeight = 768);
// ~Scene(void);
//
//public:
// static void KeyCallback(GLFWwindow* window, int key, int scancode, i... |
501f29b2c7d98b99276580ebbc82cf6719960de5 | 60dfb27511fd463c1664f411b537735c59a1eb83 | /ws04_inlab/Passenger.cpp | cbc1609655a3bba21511d8e27e3ea7b32f7300ef | [] | no_license | hrvali/SenecaCPA-OOP244 | 8b4461454044b79408a9ff4b2133edcfb86bc314 | 3065c602d4de3f63e1df51a56e03435cee858290 | refs/heads/master | 2022-01-16T07:37:11.643211 | 2019-05-27T05:21:04 | 2019-05-27T05:21:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,450 | cpp | Passenger.cpp | #include <iostream>
#include <cstring>
#include "Passenger.h"
using namespace std;
// TODO: add file header comments here
// TODO: add your headers here
// TODO: continue your namespace here
namespace sict
{
Passenger::Passenger()
{
*passenger_name = '\0';
*destination = '\0';
}
Pa... |
dfbf034c59b23d98da1c43509f3f24f63baf08d3 | 30c2631ed046d7662476b94fb7f5286c47377f60 | /examples/cpp/queries/group_by/src/main.cpp | a07e3c89fb4d458e34edb0ee30097bd3f2b73b51 | [
"MIT"
] | permissive | SanderMertens/flecs | a840093340f0d1eb2bd30ec1585296f81f2aab39 | 41fb856c4e1162f44b59d7881ef508d64d56bf10 | refs/heads/master | 2023-08-24T16:21:41.790084 | 2023-08-24T08:38:57 | 2023-08-24T08:49:52 | 146,155,284 | 4,731 | 456 | MIT | 2023-09-05T16:01:58 | 2018-08-26T05:53:05 | C | UTF-8 | C++ | false | false | 3,534 | cpp | main.cpp | #include <group_by.h>
#include <iostream>
// Group by is a feature of cached queries that allows applications to assign a
// group id to each matched table. Tables that are assigned the same group id
// are stored together in "groups". This ensures that when a query is iterated,
// tables that share a group are iterat... |
cc545d5f08e6121e5ede6658c19748f1515e7367 | 83d68569c42ef1aa08b60f66ed0558c4439fdbbf | /2017-07-24-practice/C.cpp | a458f510046d49284bcaa21cd1504b4960525e73 | [
"MIT"
] | permissive | tangjz/Three-Investigators | c4d91da24a9038e4e96f0af01e13974458415d2f | 49c72dc4c7674db46b8076c0264f7b157d362f8e | refs/heads/master | 2022-05-11T19:13:35.845309 | 2022-04-02T18:19:16 | 2022-04-02T18:19:47 | 127,548,373 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 765 | cpp | C.cpp | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
using namespace std;
const int ALPHA = 10;
const int NMAX = 1100, LMAX = 5001000;
int N;
char str[LMAX];
bitset<NMAX> mask[ALPHA], cur;
int main()
{
int i, j, x, cnt;
char tmp;
while(scanf("%d", &N) != EOF)
{
cur.re... |
0760839d583bddab94b78b3ab090a66ece8ecad5 | d2c59879cbaa8f657da7124594607293a9ea2761 | /rtsp_fd_fr/modules/inference/fdfr/include/mark_face_attr_sink.hpp | 10a6c167bbbeb923445a4852a1133c4090d2eb84 | [] | no_license | freewind2016/bm1880-ai-demo-program | 9032cb2845a79b3bfebf270f8771ea6ee3f1e102 | d1634e5c314e346a1229c4df96efe9c37401cdd7 | refs/heads/master | 2022-06-01T02:39:57.883696 | 2020-03-20T01:56:43 | 2020-03-20T01:56:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 600 | hpp | mark_face_attr_sink.hpp | #pragma once
#include "mark_face_sink.hpp"
template <typename ResultType>
class MarkFaceAttrSink : public MarkFaceSink<ResultType> {
public:
MarkFaceAttrSink(std::shared_ptr<DataSink<image_t>> &&sink) : MarkFaceSink<ResultType>(std::move(sink)) {}
bool put(image_t &&frame, ResultType &&result) override;
};
v... |
414e4f7ab170867490c0f4bbf5806d0858e4c075 | babe7014a4f8e5a24a055fbd35d8eedc75e14bd2 | /C++/9375.cpp | 151f1c34fea639559286cddda29ad70b1fd7b8d5 | [] | no_license | HaeKang/algorithm_study | 35235082727de80ed8b37bce83eba9253ec171cc | ba407dff6353c74c0fad7f7ab6e852009545a6c8 | refs/heads/master | 2023-09-01T20:08:42.203164 | 2023-09-01T14:12:28 | 2023-09-01T14:12:28 | 247,705,869 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 619 | cpp | 9375.cpp | #include <iostream>
#include <map>
#include <string>
using namespace std;
int t, n, ans;
string s1, s2;
map<string, int> m;
map<string, int>::iterator it;
int main() {
ios_base::sync_with_stdio(true);
cin.tie(nullptr);
cin >> t;
while (t--) {
n = 0;
ans = 1;
m.clear();
cin >> n;
for (int i = 0; i < ... |
e6ac6e17f6742ef9deff6ae4784f6e103e542ad5 | 6b84794b2b0aa23a2d2c3c5f1437001d103213ae | /Problems & Contents/URI/2-Ad-Hoc/1532-ArremessoDeBolas.cpp | 8f09463b4b54c6beeeed1a6d36ae66920cc8d160 | [] | no_license | mtreviso/university | 2406d3782759a75ef00af4da8e4e1ed99cfb89d8 | 164dbfc13d6dddb3bdbb04957c4702d0e0885402 | refs/heads/master | 2021-01-09T08:14:21.551497 | 2016-06-09T23:19:01 | 2016-06-09T23:19:01 | 16,703,296 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 655 | cpp | 1532-ArremessoDeBolas.cpp | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
bool verificar(int n, int v){
int i, vezes, total;
for(int j=1; j<=v; j++){
i = 1;
vezes = total = j;
while(i <= vezes and vezes >= 0){
if(total == n)
return true... |
6a558700036c3f2d69c6bcecee61b83a8b428fbe | eff9ac543ab58b2cc8c5658dab72b424830cc3c5 | /CAPTURE_MANAGER.h | cb88b3116dc82593f9d0bb16489901bf43deb081 | [] | no_license | ByungJoonLee/2D_Simulator_BackUp | 18b576e9a2c2ce4f525fc1d8f75f45491e5ce568 | dc711a6a968ac7580a55f274daa729fb30270ac9 | refs/heads/master | 2016-09-05T23:09:41.612900 | 2015-08-23T22:48:58 | 2015-08-23T22:48:58 | 38,921,093 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,208 | h | CAPTURE_MANAGER.h | /********************************************************************
CAPTURE_MANAGER.h
*********************************************************************/
#pragma once
#include <string>
class CAPTURE_MANAGER
{
public:
CAPTURE_MANAGER();
~CAPTURE_MANAGER();
void Initialize(std::string& script_abs_path);
... |
d137d0966ede72b125cffe1cedd3a1fc6793c7d5 | f3273eddfcc02f02c1326fae7c83bf51a3d2681b | /project.cxx | 85fecc57cccee1870446e5bac049622df69ba391 | [] | no_license | ashuGupta99/simple-stone-paper-sissor-CLI-game-using-python | 889ab478b7597371349a7e8f409004522990c3e9 | 21b00db9ab007cf408a1e27ff8fb83594be65d55 | refs/heads/master | 2022-12-20T01:23:28.445499 | 2020-09-10T01:45:57 | 2020-09-10T01:45:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 261 | cxx | project.cxx | #include <stdio.h>
int main(){
int a[10];
int b,ans=0,i;
scanf("%d",&b);
for(i=0;i<b;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<b;i++){
if((b%2)==0){
ans=(ans + a);
}
}
printf("Answer is %d",ans);
return 0;
}
//new changes
//added new features |
2ab7a15bd3d8512504d785a645d25550689d8e4f | e1bdbaf1143e5d66ffbfd76ca13b250bc2ac4a5c | /12 completed.cpp | 5352a13a47250eda7f91bd6da7bdf9342874fa5c | [] | no_license | kvitron/praktika_cpp | bb57925dd6e257e1a5aa265db47f2e9c7ba05857 | 696552620e16ea4fce48b1a42bfc53bb128ca8b5 | refs/heads/master | 2020-04-29T22:49:44.663067 | 2019-06-03T18:00:39 | 2019-06-03T18:00:39 | 176,459,913 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 16,056 | cpp | 12 completed.cpp | /*Реализовать класс _String, предоставляющий функционал работы со строками.*/
//#include "pch.h"
#include <iostream>
#include <cstdlib> //для функции перевода из массива символов в число: atoi(), atof()
#include <cmath> //для функции отсечения дробной части от числа: trunc()
using namespace std;
class _String {
protect... |
6c743a01403d3df779df866302adf3a1a882dbab | d26a93001382cd60dd9fa4002c25fee289c3e80c | /Leetcode/TRIE/longest_word_in_dictionary/trie.cpp | 4bcf768d526f53b97dc51f557330dc86fd1ab161 | [] | no_license | veedee2000/Competitive-Programming | cfb0e38d5534252f65eb266c24b19fd6c9f5124b | cebf93a994e10faf02138726435bb11b5b8ff807 | refs/heads/master | 2021-09-05T08:21:11.344179 | 2021-08-07T08:57:48 | 2021-08-07T08:57:48 | 207,164,471 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,328 | cpp | trie.cpp | class Solution {
public:
struct Trie{
struct Trie *child[26];
bool end_of_word;
};
struct Trie* getnode(void){
struct Trie* node = new Trie;
node -> end_of_word = false;
for(int i=0;i<26;i++){
node -> child[i] = NULL;
}
return nod... |
939417f223e123612942c8fa786639247ca28ab2 | 254ebe87d7ce06e8a5a616f437f600100dd2d4ba | /corsys-conquest/src/dgate/src/jpegconv.hpp | 39596ad59225bc4553db2476e1054b3fd4ea0b9d | [] | no_license | kerrylinux/corsys | 00c34a38cad56a451313a2bc7b2ede9e464751d1 | 62978b3e062ed929d41eadbd13612301d15d273d | refs/heads/master | 2023-04-03T23:45:22.298587 | 2019-09-13T01:04:25 | 2019-09-13T01:04:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,057 | hpp | jpegconv.hpp | //
// jpegconv.hpp
//
/*
20120710 bcb Created.
20131111 bcb Changed from #include<> to #include"" for Xcode
20131207 bcb Added JPeg_LS
20151203 bcb Moved some dependent defines from total.cpp to here.
20160203 bcb Fix VS 2015 Libjpeg bool redefine.
*/
#ifndef jpegconv_hpp
#define jpegconv_hpp
#ifdef _WIN... |
49db2ea6b485b6d16f629a392a28add15f3c421d | 5ef71f37dd27576256bb59676d48f3591b927d3f | /linkedList_44.cpp | 48b3a7a791a12144fd8885f8bf207d1737ffcd53 | [] | no_license | yashkapoor007/geeksforgeeks | 737e80926f489c9de03ab18103af814951326b85 | 6eb5d685eea556ed4bf191bf2525d0ecb1024e17 | refs/heads/master | 2018-09-29T19:22:32.802682 | 2018-06-19T13:52:48 | 2018-06-19T13:52:48 | 118,266,201 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,004 | cpp | linkedList_44.cpp | struct node* findIntersection(struct node* head1, struct node* head2)
{
int *arr1=new int[1001];
int *arr2=new int[1001];
for(int i=0;i<1001;i++)
{
arr1[i]=0;
arr2[i]=0;
}
node* result=NULL;
node* tail=NULL;
node* temp1=head1;
node* temp2=head2;
while(temp1)
{... |
863b136cc1e79a59c65652f8dca6132bff9216f3 | 4bcc9806152542ab43fc2cf47c499424f200896c | /tensorflow/tsl/platform/default/human_readable_json.cc | 1e842230056a8017617ccaa98a5fc41b0681921d | [
"Apache-2.0",
"LicenseRef-scancode-generic-cla",
"BSD-2-Clause"
] | permissive | tensorflow/tensorflow | 906276dbafcc70a941026aa5dc50425ef71ee282 | a7f3934a67900720af3d3b15389551483bee50b8 | refs/heads/master | 2023-08-25T04:24:41.611870 | 2023-08-25T04:06:24 | 2023-08-25T04:14:08 | 45,717,250 | 208,740 | 109,943 | Apache-2.0 | 2023-09-14T20:55:50 | 2015-11-07T01:19:20 | C++ | UTF-8 | C++ | false | false | 2,575 | cc | human_readable_json.cc | /* Copyright 2018 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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.