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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
70490c70fc7aa556902e1fd8e0936bff5ce55ef4 | 0b737ef49ba9e3e7b0b27c3e5a4c45b30556aa4a | /Synatexer_Analizer.h | c89e0785bf6af43d153bbe8e9066e03b3c4860be | [] | no_license | liffert/Translator | 44ed05bbfbd654371069b7d2ec11162611994846 | 546e27e8aa19fa914c1aba311fca6a57f9b7ee77 | refs/heads/master | 2020-12-29T21:12:00.956009 | 2020-05-28T21:23:11 | 2020-05-28T21:23:11 | 238,733,488 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 920 | h | Synatexer_Analizer.h | #pragma once
#include <iostream>
#include "Tables.h"
#include "Tree.h"
#include "Lexical_Analizer.h"
#include <sstream>
class Synatexer_Analizer {
private:
bool program();
bool block();
bool declaration();
bool label_declaration();
bool label_list();
bool parameters_list();
bool identifiers_list();
bool statem... |
f2c4d4b7b29ce0d050d5ea8984f850ba9c863b75 | 6280dceebbfe6a0d85c2a7320413e2e4a7cb1223 | /Round_492_Div2/A.cpp | 7068cf1a63399e9a2dd41a051fd80184fff2bed9 | [] | no_license | AleksandarTulic/Codeforces | fbbccae1ba6be48efce3d62ba67e2cacb075a1fd | 78c9a39aa4c60df7668ee08bf5bb6c626e179ab1 | refs/heads/master | 2020-06-23T11:46:54.752711 | 2019-08-30T21:10:59 | 2019-08-30T21:10:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 361 | cpp | A.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <utility>
#include <map>
using namespace std;
int main() {
int n;
cin>>n;
int br = 0;
while (n>=100) br++, n-=100;
while (n>=20) br++, n-=20;
while (n>=10) br++, n-=10;
while (n>=5) br++, n-=5;
while (n>=1) br++, n-=... |
232851fb4139a1f900c6eb363c7721020dcae2a5 | 89bc274c951480d5d728294dcbabd9d11b5f00ec | /framework/JPetTSlot/JPetTSlot.h | 0db1f1c7c5dff6d8df0a980a4a46acd541d74024 | [
"MIT"
] | permissive | wictus/oldScopeAnalysis | f73c680e48155cfeba75a0ca99a578d60471f823 | e8a15f11c504c1a1a880d4a5096cdbfac0edf2de | refs/heads/master | 2020-07-19T07:26:11.618505 | 2019-09-04T20:02:42 | 2019-09-04T20:02:42 | 206,401,149 | 0 | 0 | MIT | 2019-09-04T20:02:43 | 2019-09-04T19:50:15 | null | UTF-8 | C++ | false | false | 1,776 | h | JPetTSlot.h | #ifndef _JPETTSLOT_H_
#define _JPETTSLOT_H_
#include <vector>
#include <map>
#include <TNamed.h>
#include "../JPetSigCh/JPetSigCh.h"
#include <TClonesArray.h>
/**
* @brief Data class representing a time window of the TRB board.
*
* A single TSlot contains many SigCh objects representing TDC hits recorded during a ... |
ed4c514468d7a9fc8c7eccbe77cafdf7b97b4706 | 3a082e44fd5297f5c461a5b8a54260547f09dbec | /309div2/test.cpp | efa7eced359e279aa57040ecc6807b4e5bb58915 | [] | no_license | atyamsriharsha/codeforces_contests | e7397f56ef2c391d35aaa0baeed5720a4da69ffc | a92180b1bebfcca834ee2dbb0bbc397637a5ea2c | refs/heads/master | 2021-01-19T07:49:23.325015 | 2015-08-03T04:04:32 | 2015-08-03T04:04:32 | 40,104,346 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 777 | cpp | test.cpp | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n,m) for (int i = (n) ; i < (m) ; i ++)
#define rp(i,n,m) for (int i = (n - 1) ; i >= (m) ; i --)
#define fr_(i,n,m,k) for (int i = (n) ; i < (m) ; i += k)
#define rp_(i,n,m,k) for (int i = (n - 1) ; i >= (m) ; i -= k)
#define pb push_back
#define mp make_pair... |
1cb794c560314cec6e256487606745caf3fd66c7 | 3938cada3da2235ae099cea44ca0294e9b03a225 | /303 Range Sum Query/Range Sum Query_cpp/Range Sum Query_cpp/Range Sum Query_cpp.cpp | c5d94955ebdc8c8a031addd2e8f7aa5fb433ef98 | [] | no_license | WuminWu/Leetcode-Project | 43618f0610a2545ae944ddbd0ee82c3a293405ed | ea2c340ef41058402363261b144285fee7fba613 | refs/heads/master | 2016-09-13T09:05:15.343889 | 2016-06-03T09:45:33 | 2016-06-03T09:45:33 | 58,518,080 | 0 | 0 | null | null | null | null | BIG5 | C++ | false | false | 463 | cpp | Range Sum Query_cpp.cpp | // Range Sum Query_cpp.cpp : 定義主控台應用程式的進入點。
//
#include "stdafx.h"
#include <iostream>
#include <vector>
using namespace std;
class NumArray {
public:
NumArray(vector<int> &nums) {
}
int sumRange(int i, int j) {
}
};
// Your NumArray object will be instantiated and called as such:
// NumArray numArray(num... |
93fe3bda9d1e2f2fe17528f92a3987a34b394e8d | 66286815cc5aa5e2598056060cc3a14d6bf297ef | /src/app/core/Entities/AbstractSeq.h | 5f05176874253bbc0e35644a1552c5841f0c0128 | [] | no_license | lukeulrich/alignshop-qt | 07b022d8b15a75a7474e13f7c0ef3c0e43275577 | 030614f8fcc6c5bb4f6ed7f10987b5e5d11fe764 | refs/heads/master | 2020-07-28T03:06:04.528197 | 2016-11-10T21:19:41 | 2016-11-10T21:19:41 | 73,421,548 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,000 | h | AbstractSeq.h | /****************************************************************************
**
** Copyright (C) 2011 Agile Genomics, LLC
** All rights reserved.
** Author: Luke Ulrich
**
****************************************************************************/
#ifndef ABSTRACTSEQ_H
#define ABSTRACTSEQ_H
#include <QtCore/QStrin... |
f6d5c4bf927169783f552deef35f7c23e96b59d9 | fb5b25b4fbe66c532672c14dacc520b96ff90a04 | /export/release/windows/obj/include/flixel/util/_FlxSignal/FlxSignal3.h | e71fa5b933c1682e6fd7a7cd8854780b338b293c | [
"Apache-2.0"
] | permissive | Tyrcnex/tai-mod | c3849f817fe871004ed171245d63c5e447c4a9c3 | b83152693bb3139ee2ae73002623934f07d35baf | refs/heads/main | 2023-08-15T07:15:43.884068 | 2021-09-29T23:39:23 | 2021-09-29T23:39:23 | 383,313,424 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,899 | h | FlxSignal3.h | #ifndef INCLUDED_flixel_util__FlxSignal_FlxSignal3
#define INCLUDED_flixel_util__FlxSignal_FlxSignal3
#ifndef HXCPP_H
#include <hxcpp.h>
#endif
#ifndef INCLUDED_flixel_util__FlxSignal_FlxBaseSignal
#include <flixel/util/_FlxSignal/FlxBaseSignal.h>
#endif
HX_DECLARE_CLASS2(flixel,util,IFlxDestroyable)
HX_DECLARE_CLASS... |
7ae55bf05e40505cdc8a15278616cf62822f66e9 | 7916ff49ef9e4233eb05094b79c839511044b0c0 | /HAL.CanModules/src/Real/Camera.h | 93cb7fac46fb8df9cce67b68cc904dc5dac781fe | [] | no_license | hadzim/fit-mbot | aa971a8cbd7201d4a4a80316c1b5980e02a76fd5 | 05405de4d7b9af876cad237009014fe859e3e150 | refs/heads/master | 2021-01-16T17:48:49.325883 | 2015-02-05T14:00:15 | 2015-02-05T14:00:15 | 10,641,921 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,327 | h | Camera.h | //------------------------------------------------------------------------------
//
// Project: VG20102014024
// Robot for search of human beings in crushes and avalanches
//
// Brno University of Technology
// Faculty of Information Technology
//
//-------------------------------... |
9355cdd2fc1b69341172b7aac4914efd1b09ae9c | 2fdcf56c5e791dd9a4605a41ef7bc601e2fc9135 | /Info/Closing Ceremony at Lolympics/main.cpp | 97f6229c2f36f259a99b44286e30dc01e834fe40 | [] | no_license | DinuCr/CS | 42cc4a7920fb5a2ac5e1179930169e4d8d71592e | 8d381a622e70dd234d7a978501dcb7cf67e83adc | refs/heads/master | 2020-06-02T14:11:49.223214 | 2020-05-24T01:27:46 | 2020-05-24T01:27:46 | 191,174,654 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 508 | cpp | main.cpp | #include <iostream>
using namespace std;
const int mod = 1e9+7;
int dp[100100];
int v[1100];
int n,i,j,k;
int main()
{
cin>>n>>k;
for(i=1; i<=n; ++i)
cin>>v[i];
dp[0]=1;
for(i=1; i<=n; ++i)
{
for(j=k-1; j>=0; --j)
if(dp[j] && j+v[i]<k)
dp[j+v[i]]=(dp[j... |
220bd0554735fbadcd7bd2fac402a9803db716e7 | 4b127c72de113ec8029652bb4fbf5b0956f19dcc | /TemplePlus/d20_levelup.cpp | 943c9d5d12f80821ccb544b50dbfa5e19b09fb80 | [
"MIT"
] | permissive | ema29/TemplePlus | d72a0cfef549e6433c0b46d48777d528ced68813 | 670c33574f8dedbde8e8eaacbfbd87f59bce1bea | refs/heads/master | 2021-01-16T19:42:04.116442 | 2016-02-04T17:57:48 | 2016-02-04T17:57:48 | 51,106,307 | 0 | 0 | null | 2016-02-04T21:19:53 | 2016-02-04T21:19:53 | null | UTF-8 | C++ | false | false | 576 | cpp | d20_levelup.cpp | #include "stdafx.h"
#include "d20_levelup.h"
#include "common.h"
#include "obj.h"
struct D20LevelupSystemAddresses : temple::AddressTable
{
int(__cdecl* LevelupApply)(objHndl objHnd, LevelupPacket* lvlPkt);
void(__cdecl * LevelupStateInit)(LevelupState *lvlStat, objHndl objHnd); // uses critter_pad_i_4 and critte... |
91c80a5e83bb5c1c4208688d082f3a3b4ec4a84e | 1a50923ab3c5a4c453de4780cdae59d4fb75137d | /C++/AssetInterfaces/resourceholder.hpp | 810069f2747793fa8f8a2a5f7fbabbb8b686c7dc | [] | no_license | hyptos/snz-server | 0c6b4a1b558512f8955a82597a49b9ff146fba29 | ca3eb16f02add590fcd0ac90dc4551e189efa140 | refs/heads/master | 2020-05-09T20:01:59.145831 | 2015-06-21T17:51:58 | 2015-06-21T17:51:58 | 34,102,520 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 8,949 | hpp | resourceholder.hpp | #ifndef RESOURCEHOLDER_H
#define RESOURCEHOLDER_H
#include "AssetInterfaces/internals.hpp"
#include "AssetInterfaces/isharedresource.hpp"
#include "AssetInterfaces/isharedresourceloader.hpp"
#include "AssetInterfaces/isharedresourcemanager.hpp"
class BaseResourceDescriptor
{
public:
virtual ~BaseResourceDescript... |
6ae81f3a8f5ab529212b64a071dd94ce93fea18e | 9db1720ff68ba7a5a3a042c4a79964c3cb77ef0e | /code/graphic/ctexture.cpp | a1d9cc858912e11f9b9b8dcd217eaea1f8f89730 | [] | no_license | mowenli/onyx2d | 5a09198dc0775556bcd4097ccfa7a79e21d7d4c9 | d993ff7281e5ba9049890cc4e4c361f795fa1df6 | refs/heads/master | 2021-06-08T14:26:42.822247 | 2016-10-28T16:11:03 | 2016-10-28T16:11:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,545 | cpp | ctexture.cpp | /*
cTexture - Class that loads and contain texture data
Copyright (C) 2010-2011 Josue Candela Perdomo (josuecp.com)
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either... |
853ccb2b8b7ab6e2e2a07ffd40838d6b4809c73d | c538893c989213f57b0233f760a3fff0e336b528 | /region_detection/gdg/main.cpp | 45cad493821b0105d0048400a10694dc49d9c609 | [] | no_license | tuanfeng/texture_transfer | bb2a82468059a9ec3445c1197e683281460fa77c | 1646e714c171a13d2dffee631e4f94120068eb0b | refs/heads/master | 2021-01-10T02:24:11.755949 | 2015-11-06T21:36:35 | 2015-11-06T21:36:35 | 42,999,420 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,570 | cpp | main.cpp | #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string>
#include <math.h>
#include <vector>
#include <random>
#include <ctime>
#include <opencv2/core/core.hpp>
#include "opencv2/imgproc/imgproc.hpp"
#include <opencv2/highgui/highgui.hpp>
using namespace cv;
int main( int argc, char** argv )
{
... |
809bc49b4c932fa836a9bd31a3a4266d23bc9af9 | 26ad30a699b4a7c06c263ba417ed3c66069f6533 | /person/client/client.h | 6dd41b693d8de87f4c55e1ca39e040a8867098dc | [] | no_license | Poodlers/aeda_hotel_projeto | 9e6f304bc693d635c7028137885d5b0b7225d430 | 6180832b214966a4dca645b97717c18cba6e99d7 | refs/heads/main | 2023-02-13T17:23:37.972062 | 2021-01-01T15:00:36 | 2021-01-01T15:00:36 | 306,400,321 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,331 | h | client.h | #ifndef CLIENT_H
#define CLIENT_H
#include <string>
#include <vector>
#include "../../hotel/reservation.h"
#include "../person.h"
#include "../../exceptions/exceptions.h"
#include "unordered_set"
/// \class Client
/// Class which represents a Client.
///
/// Is defined by a NIF and a name (inherited from class perso... |
a15314c4726557b7544eeec5df76bd84cca35935 | bbac388eb6b53daec63190e2f271a18fe9bfb163 | /abc197/FConstructAPalindrome.cpp | 004d81a3bd977433ee54fa68250180b974bc9117 | [] | no_license | tatsumack/atcoder | 8d94cf29160b6553b0c089cb795c54efd3fb0f7b | fbe1e1eab80c4c0680ec046acdc6214426b19650 | refs/heads/master | 2023-06-17T23:09:54.056132 | 2021-07-04T13:03:59 | 2021-07-04T13:03:59 | 124,963,709 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,914 | cpp | FConstructAPalindrome.cpp | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#d... |
f9bb28e73edb4be3697b32d475d531ad36d226f8 | e85338f6d8666eb476698de5025c742b9b838a50 | /ojs/cf/909C.cpp | 29e2e23e45fea0db7edb1d442911065df4119efe | [] | no_license | yancouto/competitive-programming | 8104bb3c45e0b385c2abb4cfcac14c35cce0619e | ac849e3aa858eea56b0aa6b7eb93e9a9e70f9475 | refs/heads/master | 2022-10-19T11:29:46.932829 | 2022-10-07T00:16:43 | 2022-10-07T00:16:43 | 66,641,933 | 7 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 824 | cpp | 909C.cpp | #include <bits/stdc++.h>
using namespace std;
#define fst first
#define snd second
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
const ll modn = 1000000007;
inline ll mod(ll x) { return x % modn; }
#ifdef ONLINE_JUDGE
# define debug(args...) ((void) 0)
#else
# define debug(args...) fprintf(stde... |
a2e43d23356798506d0845f90efc6669ce283381 | 1b93a9b3c023f8c82e92e36206a916302597e3d3 | /gl_05/include/objects/sceneObject.h | 6be4af4d08311e08dd17d1bbaa420fde8a3d2856 | [] | no_license | Demongo2009/GKOM_Crane | a7f66d3e251b324c269f745b27e9d2e94bc6a4f6 | 522b586ebfc4d6208b28512cbb0089e8d92e4dd6 | refs/heads/main | 2023-05-01T04:30:06.409509 | 2021-05-14T14:01:40 | 2021-05-14T14:01:40 | 367,379,931 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,543 | h | sceneObject.h | #pragma once
#include <memory>
#include <glm/gtc/matrix_transform.hpp>
#include "../meshes/mesh.h"
#include "../shader.h"
#include "../material.h"
#include "../transform.h"
#include "../meshes/cube.h"
class SceneObject
{
public:
SceneObject(SceneObject* parent = nullptr)
:parent(parent)
{
transform = std::make_... |
05893191cbd6ddc9c0ac2d986158e93298c1cd83 | ef6540bded332b928e87e9622548796d8307a1bb | /Lab01 - BinaryAlpha/Squidley/VertexShaderInfo.cpp | 16decb2a5d8b9073a7150363f153a76235ef6d53 | [] | no_license | JoshuaKauer/OldRenderEngine | 0f78593f38d717818aff34493277093c5f688b69 | ba44975cdb42cff29ad4007bb0709e177d4b5622 | refs/heads/master | 2020-05-03T19:08:28.124510 | 2019-04-01T07:27:42 | 2019-04-01T07:27:42 | 178,778,958 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 87 | cpp | VertexShaderInfo.cpp | #include "VertexShaderInfo.h"
VertexShaderInfo::VertexShaderInfo()
{
callback = 0;
}
|
b1bba7d3f8b8bf6a9380ca34ded9e7fde75e7de7 | a1248a74d6fb2a20a65567baeaae25af97e950e6 | /ProgrammingBeauty/Q1/main.cpp | e974ec783327a1d8112750c13d027b921422f814 | [] | no_license | mihawk2010/MyHihocoder | 289f74329b10c9d438cab63c8e799bf15e6cd6c0 | 9ea2e9dfcb910f9afeea12b309f370e234280952 | refs/heads/master | 2016-09-11T03:29:35.011709 | 2015-09-03T00:20:50 | 2015-09-03T00:20:50 | 41,847,528 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,253 | cpp | main.cpp | #include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
const int MAXN=1100;
const int INF=1<<28;
int g[MAXN][MAXN],Mx[MAXN],My[MAXN],Nx,Ny;
int dx[MAXN],dy[MAXN],dis;
int num[MAXN];
bool vst[MAXN];
bool searchP()
{
queue<int>Q;
dis=INF;
memset(dx,-1,sizeof(dx));
memset(dy,-1,si... |
028cf381ea62692cfeef51a6952b0764b18b42d8 | 12a2c698531896823b5252079a2869fde46a81d0 | /include/Managers/ConfigManager.hpp | 4f61a9c43894eb1794b78872fa30bf9fff89c2ae | [] | no_license | Phosfor/Pseudoform-2 | a189d00c20e17049e3f6d62b95d14c52ae818433 | cb07b44ef0d756aa244b7a6da5f03baf56275418 | refs/heads/master | 2020-12-24T18:32:10.953346 | 2010-09-05T09:39:11 | 2010-09-05T09:39:11 | 866,070 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,454 | hpp | ConfigManager.hpp | #ifndef _CONFIG_MANAGER_H_
#define _CONFIG_MANAGER_H_
#include <boost/property_tree/ptree.hpp>
#include <boost/property_tree/info_parser.hpp>
#include <boost/serialization/singleton.hpp>
#include <boost/foreach.hpp>
#include "Managers/LogManager.hpp"
#include <vector>
#include <map>
using namespace boost::serializa... |
219512e868aaa7457a5883e50295535737e513fd | 807285158038bf1f9c7b7d1666ce8c8f90ef7581 | /src/query/ops/join/JoinArray.h | ced4a5e547c479ac41ee31b24a654f2d192efe52 | [] | no_license | jonghunDB/SciDB19.3 | 177ccc421175977d45b679bd61841218c8ea8b17 | e413d086b715112b37b0ae9a2882e0fff3b4cfe6 | refs/heads/master | 2020-05-23T11:42:23.435694 | 2019-07-03T11:12:42 | 2019-07-03T11:12:42 | 186,736,377 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,315 | h | JoinArray.h | /*
**
* BEGIN_COPYRIGHT
*
* Copyright (C) 2008-2019 SciDB, Inc.
* All Rights Reserved.
*
* SciDB is free software: you can redistribute it and/or modify
* it under the terms of the AFFERO GNU General Public License as published by
* the Free Software Foundation.
*
* SciDB is distributed "AS-IS" AND WITHOUT ANY WARRANTY... |
730967b0e8170d897f57f8fe1558a1eba03d5909 | 8e02857c8d7c862652007cbbe147c6c363b094ef | /src/opt/ssa/ssa.cpp | cc68b4d592dcc1af1ee09b0268027738819e754c | [] | permissive | nlsynth/iroha | fb1d503c05f50c09dc928167e2fb84f8ff03565d | 7fc5da7408b7ffb449d28737ab01fe0feea885c1 | refs/heads/master | 2021-07-16T15:11:56.684866 | 2021-07-09T13:42:27 | 2021-07-09T13:42:27 | 47,931,688 | 37 | 5 | BSD-3-Clause | 2021-07-09T13:42:28 | 2015-12-13T18:46:24 | C++ | UTF-8 | C++ | false | false | 728 | cpp | ssa.cpp | #include "opt/ssa/ssa.h"
#include "opt/ssa/phi_cleaner.h"
#include "opt/ssa/ssa_converter.h"
namespace iroha {
namespace opt {
namespace ssa {
SSAConverterPass::~SSAConverterPass() {}
Pass *SSAConverterPass::Create() { return new SSAConverterPass(); }
bool SSAConverterPass::ApplyForTable(const string &key, ITable ... |
40c51086ac4f4a5c1512fdab6066ac5027a2cf20 | be07db027422115293c041bc805b24c1a16c7b9f | /Practice20160412/GenSubset01.cpp | 4b98bf2db03b0711b1e328578053b389bd194145 | [
"Apache-2.0"
] | permissive | mkhrussell/ExamPractice | 4dce4ab682dbb380a0c481a480ea1a0055d5518e | 17b7ffa0b62ea663fee5493290551d1007bbe83d | refs/heads/master | 2021-01-01T05:23:50.870222 | 2016-04-13T10:30:51 | 2016-04-13T10:30:51 | 56,027,664 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 398 | cpp | GenSubset01.cpp | /*
#include <iostream>
#include <cstdio>
using namespace std;
int A[100], N;
void readSet()
{
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
}
void printSet()
{
bool flag = false;
printf("{");
for (int i = 0; i < N; i++)
{
if (flag) { printf(", "); }
else { flag = true; }
printf("%d", A[i])... |
25a9df8902dee0b0fa125a0c7742c9c7133e2805 | 559207eb5beae4ba9fd638d19bd3009cbe3a6d11 | /src/mod_spdy/common/http_to_spdy_converter.cc | cbcb1cf56c96aeff0244714a00fe9c2a5785b278 | [
"Apache-2.0"
] | permissive | voku/mod-spdy | 2a8989668fe0c0f0de48c0b7ecd85b5b5b554ed1 | bcfb388cbc5415ee660c2b5dbcf61f6f43c2a5ca | refs/heads/master | 2023-04-05T09:50:46.847114 | 2015-03-19T17:58:09 | 2015-03-19T17:58:09 | 32,537,692 | 0 | 0 | NOASSERTION | 2023-04-04T01:40:41 | 2015-03-19T17:56:26 | C++ | UTF-8 | C++ | false | false | 6,839 | cc | http_to_spdy_converter.cc | // Copyright 2011 Google Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in... |
b127cd312a246f9ba33347b35113b5e4a1d60042 | 5e8d200078e64b97e3bbd1e61f83cb5bae99ab6e | /main/source/src/apps/benchmark/performance/FastRelax.bench.hh | 17e38ab3a9d16aa6286641d23cb7db1ee826e11e | [] | no_license | MedicaicloudLink/Rosetta | 3ee2d79d48b31bd8ca898036ad32fe910c9a7a28 | 01affdf77abb773ed375b83cdbbf58439edd8719 | refs/heads/master | 2020-12-07T17:52:01.350906 | 2020-01-10T08:24:09 | 2020-01-10T08:24:09 | 232,757,729 | 2 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 10,027 | hh | FastRelax.bench.hh | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the co... |
6ba3995b5406187f0e97eb641165318127684ef5 | 4a70206488bc1959ab347fbbcb6a0ddbabb920bb | /libraries/animation/src/AnimOverlay.cpp | e086413dde987341c59811bc73fe1fae9aef0280 | [
"Apache-2.0"
] | permissive | zzmp/hifi | 60dc87dffb67a315fc1334b28615dc33d381e421 | 9ae390853c6b28132ca9cec7c7f68b002ff8fc4a | refs/heads/master | 2020-04-05T14:58:33.041164 | 2017-06-25T15:17:16 | 2017-06-25T15:17:16 | 45,364,529 | 2 | 0 | null | 2017-07-11T04:41:54 | 2015-11-02T01:02:18 | C++ | UTF-8 | C++ | false | false | 6,597 | cpp | AnimOverlay.cpp | //
// AnimOverlay.cpp
//
// Created by Anthony J. Thibault on 9/2/15.
// Copyright (c) 2015 High Fidelity, Inc. All rights reserved.
//
// Distributed under the Apache License, Version 2.0.
// See the accompanying file LICENSE or http://www.apache.org/licenses/LICENSE-2.0.html
//
#include "AnimOverlay.h"
#include... |
3c82dc6c74a5b9af29bd77ec6b70dd8c2648c8f8 | f46e5258241338e79e062ead8ed8b6952ac5016a | /leetcode/dynamic_programming/413.arithmetic-slices.cpp | f3128edef63a4ce33254be5f5569b598f5088e96 | [] | no_license | riveridea/algorithm | a58fde65ac693b56329bc2dc064a131d9a519b69 | 6151ae9ae7684b020c03a85da154b1b9b00661e8 | refs/heads/master | 2021-01-02T09:32:25.500821 | 2019-11-04T00:32:13 | 2019-11-04T00:32:13 | 8,842,964 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,791 | cpp | 413.arithmetic-slices.cpp | /*
* @lc app=leetcode id=413 lang=cpp
*
* [413] Arithmetic Slices
*
* https://leetcode.com/problems/arithmetic-slices/description/
*
* algorithms
* Medium (54.75%)
* Total Accepted: 53.2K
* Total Submissions: 97.2K
* Testcase Example: '[1,2,3,4]'
*
* A sequence of number is called arithmetic if it cons... |
2bcd26218d869f9e0b97ad04f8446ff5066173ce | 869a9a78bd4f9ecc01005bfae35c30350c3d1f53 | /src/jimic/core/jimic_def.h | 3cba8dd3a5dbae3686235a09c22a43e20a9b2ae2 | [
"MIT"
] | permissive | bactq/jimi | d7f8f4e89803352bc9e7b4471b3c0b55ff08465a | 5dc585753ecfec4132e0582d919b725688ea6eaf | refs/heads/master | 2021-01-16T20:59:23.378992 | 2014-07-31T22:44:59 | 2014-07-31T22:44:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,054 | h | jimic_def.h |
#ifndef _JIMIC_DEF_H_
#define _JIMIC_DEF_H_
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
#pragma once
#endif
#include <jimi/platform/jimi_platform_def.h>
#include <jimi/platform/jimi_compiler_def.h>
#if JIMI_IS_WINDOWS
#include <jimic/platform/jimic_targetver.h>
#endif
#include <jimic/core/jimic_config.h>
#incl... |
68a8a2a355aa34cfaa0f9d98274c576af12dc43c | b37057fdb32850390e54d56fddbbe3d1f4ec6b14 | /checkOut.cpp | 01d3f00d537d0cb67250ef5ca870344842af7e18 | [] | no_license | AiSuna-Izumi/Mini-Project | 7eec5d927ed92f42633380c1b3b60f1d98a694b8 | 23309db6828854ca202263bc366bfaf81ee7df6c | refs/heads/master | 2022-06-20T16:14:04.044423 | 2020-05-01T14:48:36 | 2020-05-01T14:48:36 | 260,483,147 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,389 | cpp | checkOut.cpp | #include <iostream>
#include <string>
#include <fstream>
#include <iomanip>
#include <ctime>
using namespace std;
//create the structure of the list
struct hotel{
int number;
string guestName;
string date;
string time;
string room;
int price;
string phone;
string ic;
... |
cf87bc4bd777d419efd8ccd5f9274ef0b26bfacb | 81a41ec4979121564d3e7c9f0dc687adab460bde | /ToyMC/bin/simulate.cpp | 53e1fbc327fce9d78dee034d204afbbc8e9d4d95 | [] | no_license | allenji/StoppedHSCP | 01e37dc34b4c5f88b933164ebe5e8a2bf5561573 | c49f18914c7fa36b59c9fbb046e6c8be4f3aa42d | refs/heads/master | 2021-01-17T13:33:42.889485 | 2016-03-29T18:10:13 | 2016-03-29T18:10:13 | 35,041,646 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,335 | cpp | simulate.cpp | #include <iostream>
#include <fstream>
#include <string>
#include <cstdlib>
#include "StoppedHSCP/ToyMC/interface/Simulator.h"
#include "StoppedHSCP/ToyMC/interface/Experiment.h"
int main(int argc, char* argv[]) {
if (argc < 2) {
std::cout << "Insufficient arguments" << std::endl;
std::cout << "Usage : si... |
f0b903bcc4aa96c0fc8c47839f643dea42991aab | 62d48af115ea9d14bc5a7dd85212e616a48dcac6 | /src/communication/headers/SimpleSendObjectRequest.cc | 5b3a7fbd727b3ecfeeb6df15c21756ecae690b3a | [
"Apache-2.0",
"LicenseRef-scancode-public-domain",
"BSD-3-Clause"
] | permissive | asu-cactus/lachesis | ab1ab1704e4f0f2d6aef1a2bff2dc99ea8f09337 | 92efa7b124a23894485a900bb394670487051948 | refs/heads/master | 2023-03-05T11:41:35.016673 | 2021-02-14T21:50:32 | 2021-02-14T21:50:32 | 151,744,205 | 2 | 0 | Apache-2.0 | 2021-02-14T16:37:54 | 2018-10-05T15:49:15 | C++ | UTF-8 | C++ | false | false | 4,038 | cc | SimpleSendObjectRequest.cc |
#ifndef SIMPLE_SEND_OBJECT_REQUEST_CC
#define SIMPLE_SEND_OBJECT_REQUEST_CC
#include "InterfaceFunctions.h"
#include "UseTemporaryAllocationBlock.h"
#ifndef MAX_RETRIES
#define MAX_RETRIES 5
#endif
#ifndef HEADER_SIZE
#define HEADER_SIZE 20
#endif
namespace pdb {
template <class RequestType,
class DataTy... |
f8843796e0b24889faab617dade5183748f5fb1b | b955ab4d264001ac744831e98819fc1799d5c976 | /book/3_exercise.cpp | 47cffb1cc485270a1d1a75be1174a94769cad011 | [] | no_license | kdzmcqn/coding_studies | 4d9a84b9b94c87f45e84885c5dddcdbd5eee7f85 | 69a18909e7e532b0f89ac7d4f1551b099146eedf | refs/heads/master | 2022-12-27T09:01:45.867336 | 2020-10-08T06:33:20 | 2020-10-08T06:33:20 | 299,523,494 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,001 | cpp | 3_exercise.cpp | #include "std_lib_facilities.h"
int main()
{
cout << "Please enter a floating-point value: ";
double n;
cin >> n;
cout << "n == " << n
<< "\nn + 1 == " << n + 1
<< "\nthree times n == " << 3 * n
<< "\ntwice n == " << n + n
<< "\nn squared == " << n * n
<< "\... |
9405ee93c48b1a5f596f1a39b5773cb3b0e4be65 | e1c2c0d23f25256c1b913c7be0c19fe0ec3ffd61 | /potionstructure.h | 6ded41401d1d81fda72ab0a6dab6bf38fd2666c9 | [] | no_license | mbottini/lab2 | 468432da9a0f5b676af45426c45ff81c2299e79e | 430e03bfb44851b39bbce107f2526f860605b79d | refs/heads/master | 2020-12-24T15:22:48.206037 | 2015-07-19T19:31:31 | 2015-07-19T19:31:31 | 38,906,132 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 781 | h | potionstructure.h | // potionstructure.h
// Michael Bottini
// Created for CS 260
// Header file for potion structure base class.
#ifndef POTIONSTRUCTURE_H
#define POTIONSTRUCTURE_H
#include "potion.h"
#include <iostream>
class PotionStructure {
private:
PotionNode *_first;
PotionNode *_last;
int _size;
public:
Poti... |
afe06e64e989e96490d9fb722d5f19ff3ecfac1b | f2ee87ad057c80ed04fbfadf287f293aff1e3c5f | /Intersection/Bmpfile.cpp | 7eeb442aafea4143bf5e074ad180059739569544 | [
"MIT"
] | permissive | SylvainRajkoumar/ray-tracing | a8094701bfa229733458f16a53c580c233d56159 | 0c563fac1b167e21120f7f23fecaedc818d8c71a | refs/heads/master | 2020-04-19T00:59:30.592652 | 2019-01-28T21:11:17 | 2019-01-28T21:11:17 | 167,861,168 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,616 | cpp | Bmpfile.cpp | #include "Bmpfile.h"
#include <cstdio>
void BMPFile::SaveBmp(std::string fileName,unsigned char *img,unsigned int w,unsigned int h)
{
int filesize = 54 + 3*w*h; //w is your image width, h is image height, both int
unsigned char bmpfileheader[14] = {'B','M', 0,0,0,0, 0,0, 0,0, 54,0,0,0};
unsigned char bmpinfohead... |
e0ca58791475693843854facc7c3fe1724a83b7b | 4c6574534cc8dd7f582ee98603116b46ab608160 | /PhaseJump/PhaseJump/Classes/Render/RenderModel.h | b248bb3ab3790af9082050615a9c78fe79647321 | [
"MIT"
] | permissive | coinbump/PhaseJumpPro | 01b1805aac4a8dd0a17feb3ae9a06d76fbf63926 | 52f806cc7db9ef134a5e1786347c350cb8e2e4c3 | refs/heads/main | 2023-06-27T13:30:37.192977 | 2023-06-18T03:25:38 | 2023-06-18T03:25:38 | 127,684,651 | 50 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 1,510 | h | RenderModel.h | #ifndef PJRENDERMODEL_H
#define PJRENDERMODEL_H
#include "VectorList.h"
#include "Color.h"
#include "RenderMaterial.h"
#include "Vector3.h"
#include "Matrix4x4.h"
#include "SomeTexture.h"
#include "_Set.h"
#include "_Map.h"
/*
RATING: 4 stars
Simple type. Needs more features
CODE REVIEW: 4/17/23
*/
namespace PJ {... |
d9a9d28e5956107e44a253911b26de081f17e5bc | bee740fe778f9cf0404a483dfc135a91234e4865 | /ide/plugins/interpreter/external-system-template/src/ExternalSystem.hpp | 8fa007752f55700d650357455fb4993f5093059d | [] | no_license | ibrahimshiyam/SymphonyIDE | a1c6bb08f1f538ceeadd7ea474b65f5f5478d529 | 9b3d13160782c848c9f3a3193596c34c50148fdb | refs/heads/master | 2021-01-10T01:00:46.078501 | 2014-09-29T12:47:37 | 2014-09-29T12:47:37 | 25,225,245 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,321 | hpp | ExternalSystem.hpp | #ifndef EXTERNAL_SYSTEM_HPP
#define EXTERNAL_SYSTEM_HPP
#include <iostream>
#include <CoSimulationTransportLayer.hpp>
#include <CoSimulationFramework.hpp>
namespace ExternalSystem
{
template <typename S, typename D>
void LOG(S& stream, const D& data)
{
stream << data << std::endl;
}
//callback class, will b... |
00790124a056d971c4e9d0b52c6a6e7a877bfcde | b4f847577ef5e1784d3e0794e136e155f5d08949 | /src/Project.cpp | ee6e04e9aa9166478afc36e16bb85967427c40ad | [] | no_license | atduskgreg/Brat-Pack | f2fb8f21a8d5d9fd5fbccbecbe54641c4abb5c84 | c7c6e2c8751a9962b335c6a15c1af0886874e107 | refs/heads/master | 2020-06-01T13:50:03.976013 | 2011-04-17T17:49:42 | 2011-04-17T17:49:42 | 1,482,872 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,294 | cpp | Project.cpp | #include "Project.h"
Project::Project()
{
font.loadFont("Helvetica LT.ttf", 12);
startPressed = false;
stopPressed = false;
pos.x = 0;
pos.y = 0;
running = false;
start = new CustomButton("startserver.png");
stop = new CustomButton("stopserver.png");
}
void Project::update()
{
start->update();
stop->... |
6f92688dd4574a9410b0a8aad92015ccba4d8730 | b25a8c57cade3b090b8b4eb2026b3b57db0f5cc1 | /src/audio/Listener.cpp | 24e06895eede40fffa18c63a331f9459d7e75488 | [] | no_license | jacopocav/Maze | dd750bdb894f65938c560669171cb4f6eb5fa3ed | fcd5bcf6ed5069f6f21252fc051cac4b6347bf51 | refs/heads/master | 2021-05-04T09:30:18.840774 | 2016-10-11T10:32:56 | 2016-10-11T10:32:56 | 59,230,854 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 346 | cpp | Listener.cpp | #include <AL/al.h>
#include "Listener.h"
void audio::Listener::setOrientation(float atx, float aty, float atz, float upx, float upy, float upz) {
float ori[6] = {atx, aty, atz, upx, upy, upz};
alListenerfv(AL_ORIENTATION, ori);
}
void audio::Listener::setPosition(float x, float y, float z) {
alListener3f... |
cba548610dcc240cfb15718d36ecf8228e8fb9e2 | 50a0185de28f3d92594509009e271341803e934a | /lab1_binarization/bw/filter.cpp | 676723637659ec4e616192ae7c481250ef6f4dcd | [] | no_license | kr3r/ImageProcessing | 61cdc8795d20db7c1f0cf594dd8ddd0dd78c32a5 | 1aef2cf3edbc3635ad4c47806d65d84ac094589c | refs/heads/master | 2022-11-07T21:47:27.405242 | 2017-05-24T16:09:31 | 2017-05-24T16:09:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 261 | cpp | filter.cpp | //
// filter.cpp
// bw
//
// Created by Кирилл Рябинин on 03.03.17.
// Copyright © 2017 Кирилл Рябинин. All rights reserved.
//
#include <opencv2/opencv.hpp>
#include <stdio.h>
using namespace cv;
Mat filter(Mat& img) {
}
|
a429c30d8f7355390c7145544f3cc0639433de51 | c0f2b22ca32bbfa864ff965e1339f3656a2746df | /include/io/multistream.h | 2ea67fe1d93694846d090a192475e26d73445e90 | [
"Apache-2.0"
] | permissive | StanfordPL/cpputil | 2199e76b532e7eaa6b963b5dad609bedf58b80eb | f44bf5ff224536553105c912638dc34e14f05123 | refs/heads/develop | 2021-01-17T10:21:14.348417 | 2018-11-04T16:50:07 | 2018-11-04T16:50:07 | 2,747,319 | 15 | 5 | null | 2016-11-27T18:06:49 | 2011-11-10T08:25:03 | C++ | UTF-8 | C++ | false | false | 1,593 | h | multistream.h | // Copyright 2014 eric schkufza
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to i... |
90377257b0d346d076fa64d6e90f30317a49eacc | a6561d0a1886fedf3a23d74ba2a64e427a64697d | /bi-protocols/software-tagging-brain-invaders/boxes/ovpCBoxStimulationTransformer.h | fe4d97ce35f29ffaf1abc67891aa00f91c5f95bd | [] | no_license | Daeda88/BrainInvaders | f799bb464fc57cbab74fc4ce6178b85ae3e24b8c | fd321eec5c7a122d3cdf71fd73e7b6276842220b | refs/heads/master | 2021-01-10T17:39:04.337416 | 2015-05-25T12:54:15 | 2015-05-25T12:54:15 | 36,230,839 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,100 | h | ovpCBoxStimulationTransformer.h | #ifndef __OpenViBEPlugins_BoxAlgorithm_StimulationTransformer_H__
#define __OpenViBEPlugins_BoxAlgorithm_StimulationTransformer_H__
#include "../ovp_defines.h"
#include <openvibe/ov_all.h>
#include <openvibe-toolkit/ovtk_all.h>
#include <iostream>
#include <deque>
#include <vector>
#include <fstream>
#include <strin... |
aa3d65945555a8091ed00755b1494fb54c920163 | 41228f46efca8cfaf8ce4ccbf743680d73012ce0 | /test/operator_spacing_good.cpp | 91b28b2c27e247c27d316804585230c88af3b31d | [] | no_license | willwolfram18/183lint | 3951454d44b756d7ff66ad92cce4d487375a917a | b841db77d5229f79f0f5974009cec9268d2c93b5 | refs/heads/master | 2021-05-31T00:32:04.679067 | 2015-11-02T07:27:06 | 2015-11-02T07:27:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 725 | cpp | operator_spacing_good.cpp | #include <iostream>
#include <string>
using namespace std;
int main() {
int x = 0;
x = 2;
// check compound operators
x += 1;
x -= 1;
x *= 1;
x /= 1;
x %= 2;
x &= 1;
x |= 0;
x != 1;
x == 1;
x == false;
x >= 2;
x <= 2;
x && false;
x || true;
... |
44269f3bc9a7a1ec0351bf899b3226c28f3f6c01 | 0124333581ebbd1ce79ed72d9a4bfcf834f9b8d8 | /189-RotateArray.cpp | 304c99180bf8d3f527f9cbaf0a4c1462cc416f01 | [] | no_license | dufuhang/LeetCode | 48624e0bfee057dab756af3d429693c6d5672453 | 4306619cf133b292c465aa75245a836fad7ec1a9 | refs/heads/master | 2021-08-22T10:32:36.086335 | 2020-03-28T11:03:28 | 2020-03-28T11:03:28 | 147,092,349 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 414 | cpp | 189-RotateArray.cpp | class Solution
{
public:
void rotate(vector<int>& nums, int k)
{
//k为几，就进行几轮轮换：[1,2,3]，k=5 => [2,3,1]
//不要误认为k为从数组末往前数几个元素进行轮换
k %= nums.size();
vector<int> vec(nums.end() - k, nums.end());
nums.erase(nums.end() - k, nums.end());
nums.insert(nums.begin(), vec.b... |
fea348506391fd4031ae246c94e94066e1ed5716 | 269e4554569f5b6cbba877102f6b5b21e721a46f | /level B/B. Sum of Digits/main.cpp | 778f87f75ae343c6a94081c9acaddde9ad8b4921 | [] | no_license | KhaledAbdelgalil/sheet-mostafa-saad-problem-solving- | f1b289a8115579417b8f075ca4f792768e0c7e5d | 4e2a72caeb3b3752b7170723a7190b1745d2f5e2 | refs/heads/master | 2022-04-02T08:48:52.967835 | 2020-02-01T03:47:27 | 2020-02-01T03:47:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 572 | cpp | main.cpp | #include <bits/stdc++.h>
using namespace std;
long long s=0;
string in;
int main()
{
cin>>in;
if(in.size()==1){cout<<0;return 0;}
long long out=0;
for(long long i=0;i<in.size();i++)
{
s+=int(in[i])-48;
}
if(s/10==0){cout<<1; return 0;}
//cout<<s;
out++;
long lon... |
d37477ef237d15c1e0da44d00fd4817eafcf5ea2 | 8e388a3f334c60fbc6427020738e867c113940a4 | /DL_A10_c5_p8.cpp | e37b5eec2de951dbb743ea68dcce69ee1c03d62b | [] | no_license | Danloza/C-class | 4a94ef9f20b6cc864eec9e124cba23568a73c104 | 310b837635956b49cde51c0ac050cc9f7868571f | refs/heads/master | 2021-06-29T14:32:27.127420 | 2017-09-20T07:30:10 | 2017-09-20T07:30:10 | 104,181,294 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,330 | cpp | DL_A10_c5_p8.cpp | // Your Name: Daniel Loza
// Date:3/7/17
// Class C++, engr 1540
// Assignment Name Assignment 10
//Problem Pennies for Pay
// =========================================
#include <iostream>
#include <cstdlib>
#include <iomanip>
using namespace std;
int main()
{
//input days worked
double dayPay ... |
ce9661916d5dbdddd1b196d791ea348f6510d895 | bea698595acf98c96089a202c3606090c5bfeab2 | /Server/Core/Debug/DLSources/AMMO/AMMO-2/Ammo2.h | f68ae61addb60590db473da89e2c775939968c32 | [] | no_license | ekersale/RType | 1b904a1094820c150134d1152308c5874ec40d1a | 1ce77e9eb69efeeeebf83a3d049cc96ab5ce804f | refs/heads/master | 2020-12-25T10:34:32.068425 | 2016-08-01T13:05:57 | 2016-08-01T13:05:57 | 62,563,089 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 243 | h | Ammo2.h | #ifndef AMMO2_H_
#define AMMO2_H_
#include "IAmmo.h"
class Ammo2 : public IAmmo
{
public:
Ammo2();
~Ammo2();
DRect calcPos(DRect);
e_type getType() const;
int getPower() const;
void setMovement(int);
private:
int _movement;
};
#endif |
b166f0946c803ac913fb8910ab3543ea53634dfd | 07fe910f4a2c7d14e67db40ab88a8c91d9406857 | /game/mga/Object_Filter.h | c28f379e90736fbc96e7a11bd7ffbd6e4173431e | [] | no_license | SEDS/GAME | e6d7f7a8bb034e421842007614d306b3a6321fde | 3e4621298624b9189b5b6b43ff002306fde23f08 | refs/heads/master | 2021-03-12T23:27:39.115003 | 2015-09-22T15:05:33 | 2015-09-22T15:05:33 | 20,278,561 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,249 | h | Object_Filter.h | // -*- C++ -*-
//=============================================================================
/**
* @file Filter.h
*
* $Id$
*
* @author James H. Hill
*/
//=============================================================================
#ifndef _GME_FILTER_H_
#define _GME_FILTER_H_
#include "Project.h"
n... |
268cf1edc91831f136013bbec1026e15f12eb813 | fac2ca8a90115ccf3d1e0f4979c2f3cebf51deb3 | /LargeNumber/Large_Number1.cpp | 4ff5e5d86d6906d9a0df3c0a17016c0f02e4efa2 | [] | no_license | ITISStudy/CPP | da726cda5133096438abfbabd1524d88e5dc57cd | 8879001a814124f30288101cc20ee826f8376080 | refs/heads/master | 2023-01-27T14:09:54.078066 | 2020-12-08T11:01:05 | 2020-12-08T11:01:05 | 311,673,770 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 782 | cpp | Large_Number1.cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
string a,b;
int n,m;
void Nhap(){
cin>>a>>b;
n=a.length();
m=b.length();
}
void ins(string a,string b){
vector <int> c,d;
n=a.length();m=b.length();
for(int i=0;i<n;i++) d.push_back(a[i]-'0');
for(int i=0;i<n-m;i++) c.push_back(0);
for(int i=0;i... |
d7850cf807eede988239ac58a23c3557f1d2d98e | 32fa0ff7c6f84f19afcd9f38db443367e0002389 | /WJets/MergeVV_BVeto.cc | 68d6536b0075157faa8740e2ae7685909c600770 | [] | no_license | ahortian/WJetsTreeAnalysis | 6c8e253c5a806af60ece44e6b5add9af3baedc98 | fb966bafd82817c52188d6f55e9bb2735ae78840 | refs/heads/master | 2021-01-19T07:53:34.812185 | 2017-11-13T21:39:48 | 2017-11-13T21:39:48 | 87,585,370 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 9,677 | cc | MergeVV_BVeto.cc | // History
//---- 2015_05_17
// Also merge top and DY (and generate outputs) for the regions of QCD1,2,3.
#include <iostream>
#include <TH1.h>
#include <TH2.h>
#include <TFile.h>
#include <sstream>
#include <RooUnfoldResponse.h>
void runMergeVV_BVeto(string lepSelection = "DE", int systematics =0 , int jetPtCutMin =... |
9a15add0329800d39c0b9ea553156d905f48f5a4 | fc751a4cfa36fe067fe746b05dae58628c994ae2 | /manager/filemanager.h | bb581788f3abadc2ba789f90ac7af160a37c340e | [] | no_license | RolandoAndrade/NubeUCABManager | e21152c54a24dc721f1f2e9d980015dfcc4749fd | 9c148c077f502548c9c76ac3b6e55f1f09d35727 | refs/heads/master | 2020-11-29T16:34:10.273910 | 2020-01-06T00:11:55 | 2020-01-06T00:11:55 | 230,169,276 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 876 | h | filemanager.h | #ifndef FILEMANAGER_H
#define FILEMANAGER_H
#include <QObject>
#include <QQmlApplicationEngine>
#include "../server/NubeUCAB-servidor/commands.h"
using namespace std;
class FileManager : public QObject
{
Q_OBJECT
private:
string getNameOfFile(string);
string getTypeOfFile(string);
v... |
4d76e377e93f6c1a9e5dc317b7d1cb211b1a3f8d | 906784701763ff93539eff9c15b43dbbdabc8046 | /main/page7.cpp | c1d588fd9a5f18b82552f71b8ba356a92083415e | [] | no_license | sandeep123patel/Tao | f964f1a36712017abcb1c76223602444cd23efff | 8dfbca53362582e26afe7d5fa554db93a7c6cd74 | refs/heads/master | 2021-01-20T10:05:33.396743 | 2017-12-28T19:06:50 | 2017-12-28T19:06:50 | 101,622,044 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 297 | cpp | page7.cpp | #include "page7.h"
#include "ui_page7.h"
#include "page8.h"
page7::page7(QWidget *parent) :
QDialog(parent),
ui(new Ui::page7)
{
ui->setupUi(this);
}
page7::~page7()
{
delete ui;
}
void page7::on_pushButton_clicked()
{
page8 pag8;
pag8.setModal(true);
pag8.exec();
}
|
e72bb4f0f846e2d72ddc75082053abd5c5920550 | d9a642ed3b0047b56045a05e243a018069dc8133 | /source code/1676_팩토리얼 0의 개수.cpp | 3065b25ce41e1611c61c3e83ac56dccb4b10e52a | [] | no_license | kingkk31/BOJ | 7562c7b92a1761120ad159653107e0ec23be2b29 | 03335203cd880607803d28a1fb5cd862e7013e4b | refs/heads/master | 2021-05-04T11:39:05.781066 | 2018-01-09T16:52:15 | 2018-01-09T16:52:15 | 49,325,443 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 368 | cpp | 1676_팩토리얼 0의 개수.cpp | #include <iostream>
#include <algorithm>
using namespace std;
int main(void)
{
int n;
cin >> n;
int cnt2 = 0, cnt5 = 0;
for (int i = 1; i <= n; i++)
{
int t = i, c2 = 0, c5 = 0;
while (t % 5 == 0)
{
c5++;
t /= 5;
}
while (t % 2 == 0)
{
c2++;
t /= 2;
}
cnt2 += c2;
cnt5 += c5;
}
... |
1baa11cedd9b5e3045d5acb185b59b17fdc6336f | ffd0a067ddf3502dacb3aea30988a28241f7aee3 | /walksat/Walksat.h | dcc09344e47bee2d7df1973c35b15f1eec802c55 | [] | no_license | lcymq/walksat | 71a5fb625b9f5b40d0b3286d0bc8783bb6f5e08f | 4622cff5f2245080e3a78e9b269246e9a6926fcd | refs/heads/master | 2022-12-03T18:02:55.032677 | 2020-08-25T23:28:25 | 2020-08-25T23:28:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,196 | h | Walksat.h |
#include <iostream>
#include <string>
#include <map>
#include <vector>
#ifndef WALKSAT_H
#define WALKSAT_H
using namespace std;
class Walksat {
private:
vector<vector<int>> clauses;
int num_vbles;
int num_clauses;
public:
Walksat();
~Walksat();
// getters
vector<vector<int>> get_clauses();
int get_num_... |
3c43da35ebae88be6bdc4b77eb863be02bc66783 | 86b49295796e559a01fd9495d6d5e6bf3030ce05 | /EventAnalyzer/interface/ProductMakerUnion.h | 91e1a4b76019e4f5aa1d28faf4a4a698b13df95f | [
"MIT"
] | permissive | peterthomassen/RutgersIAF | 88310697bd4fc8e1df913cac55c2c4486710ce7c | 50fd20b79b8bce30478d49e1ce7c763424e094f1 | refs/heads/master | 2020-05-29T09:15:38.571846 | 2016-09-22T10:27:09 | 2016-09-22T10:27:09 | 69,040,707 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 396 | h | ProductMakerUnion.h | #ifndef ProductMakerUnion_h
#define ProductMakerUnion_h
#include "ProductMaker.h"
class ProductMakerUnion : public ProductMaker{
public:
ProductMakerUnion(TString,TString);
virtual ~ProductMakerUnion() {}
void addSource(TString);
virtual std::vector<SignatureObject*> makeProduct(BaseHandler*);
private:
s... |
c9d388b155fb823d97eae33841883b33564cd644 | 5ee0eb940cfad30f7a3b41762eb4abd9cd052f38 | /Case_save/case9/2500/k | ce4bb34d45aeaf603381bb8905aa5a81eec1386d | [] | no_license | mamitsu2/aircond5_play4 | 052d2ff593661912b53379e74af1f7cee20bf24d | c5800df67e4eba5415c0e877bdeff06154d51ba6 | refs/heads/master | 2020-05-25T02:11:13.406899 | 2019-05-20T04:56:10 | 2019-05-20T04:56:10 | 187,570,146 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,779 | k | /*--------------------------------*- C++ -*----------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Version: 6
\\/ M anipulation |
\*-------... | |
1a8d24fe471b0872545b79a55f9558d1d14c578d | d8aabc7cfff208a358f60e83a2db4af7d1e505a9 | /P-7.5 Binary/BST.cpp | 480f2ad68463daf87bd2b31521164c1fe0ef89ad | [] | no_license | Buenz/cprojects | 4b91bf0b33ce3249c6d02da19ca56dc669cda4ab | c90dff5b6e8a4550f032233f0e768aa587ee9209 | refs/heads/master | 2020-04-28T02:37:54.718826 | 2019-08-25T03:43:25 | 2019-08-25T03:43:25 | 174,906,185 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,923 | cpp | BST.cpp |
#include <iostream>
#include <cstdlib>
#include "BST.h"
using namespace std;
#define SPACE 5
BST::BST()
{
root=NULL; //make sure root doesn't point to anything
}
BST::node* BST::CreateLeaf(int key){
node* n=new node;
n->key=key;
n->left=NULL;
n->right=NULL;
return n; //return pointer to null... |
1cf7d498c0de3b5e191cff384901380ccdbc1272 | 79e74cd79429165826afb3418e26221f94760695 | /week10.2/map.h | 15a16bf0d4055c44844451692c5e77c3f64a705a | [] | no_license | Camthack13/cs235 | c06271af4b2026f7fe475ef5f0c371f3127cf953 | a74879f953f2d2283d66d1c72d75d73228f72051 | refs/heads/master | 2020-03-22T00:43:12.548344 | 2018-07-07T16:36:56 | 2018-07-07T16:36:56 | 139,261,427 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,299 | h | map.h |
#ifndef map_H
#define map_H
#include <iostream>
#include <cassert> // because I am paranoid
#include <string>
#include "bst.h" // for Stack
#include "pair.h"
// a little helper macro to write debug code
#ifdef NDEBUG
#define Debug(statement)
#else
#define Debug(statement) statement
#endif // !NDEBUG
namespace cus... |
e2cfd20910f1cece452400965485e666ca702d42 | f6b790075314a5cd82d73f1c3560e0a7b91c4166 | /classes/union.cc | fb4e00ebda8356b31c0b8bae993c760650aedf04 | [] | no_license | yshivatest/cplusplus | 6e81c786e32925c4169fd20f4eb100c5226844ff | b8c25f91f182def40a8b6c154664ef6bd73a4f2e | refs/heads/master | 2021-01-17T11:11:40.489949 | 2016-05-20T19:40:07 | 2016-05-20T19:40:07 | 35,382,629 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 525 | cc | union.cc | #include<iostream>
using namespace std;
enum class Type {str, num};
union Value {
public:
char *s;
int i;
ostream& operator<<(ostream& out) { out<<i<<endl;}
};
struct Entry {
Value v;
Type t;
};
void print_entry(const Entry& x)
{
if (x.t == Type::str)
cout<<x.v.s<<endl;
else
... |
b49f07dfe2b4e2308fbf1ae30050e6d503ba6d23 | 29a1640379e728b15b4f20a8a1f4e216eb769681 | /sorts/sorter.cpp | 2534c78b9d447fa6e924b4fe4bee7cdbfa4776d8 | [] | no_license | minivesper/ProjectBits | 5b05bfe4178e64e0de415ae24f6b8c92a8e44c67 | d909dd3c877d3cd2f4e2347e9a533c2f4b80e244 | refs/heads/master | 2021-05-06T00:32:37.038192 | 2017-12-15T00:51:38 | 2017-12-15T00:51:38 | 114,310,505 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,538 | cpp | sorter.cpp | #include<stdlib.h>
#include <array>
#include <iostream>
#include "sorts.h"
using namespace std;
class Sorter {
int listlength;
int nummax;
int* unsorted;
public:
void init_list (int,int);
void print_list(int*);
int * getList();
bool sortTest(int*, int);
};
int * Sorter::getList()
{
return unsorted;
}
... |
f64f2632c67937d32e0a0e0ed10f2dd4b86aac5a | aa8a3d6d26aef12652ad842d3bddd4e71fb7f8d7 | /uViewAllResourcesWindow.h | a6d84630e4b49e17f5df9e954273b5cc38b75e75 | [] | no_license | GrzegorzSol/MojaBibliaNG | d8137b7d50040d168aeec155c50769771962a0a4 | f05bbcf4cc2a1143ae19a5760f240611db0e714d | refs/heads/master | 2023-09-01T08:57:13.146588 | 2023-08-30T04:12:19 | 2023-08-30T04:12:19 | 187,962,830 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,844 | h | uViewAllResourcesWindow.h | //---------------------------------------------------------------------------
#ifndef uViewAllResourcesWindowH
#define uViewAllResourcesWindowH
//---------------------------------------------------------------------------
#include <System.Classes.hpp>
#include <Vcl.Controls.hpp>
#include <Vcl.StdCtrls.hpp>
#include <V... |
235946b56a5a453378c8c264e9303456cf3e3a42 | 25c38d440e06d362d053a58aa1f20158ccdae003 | /src/ast/stmt_ast/cond_stmt.h | 85b397b61f7f7dce2fc4222f4f369391655dc251 | [
"MIT"
] | permissive | Zx55/c0-cli | 76fe308903b5097c9d9d88abb15d7ca09c5b337b | e17d1f682c00937884e52b81bc4e160f61dc69a1 | refs/heads/master | 2020-09-15T01:15:32.724240 | 2019-12-21T12:21:56 | 2019-12-21T12:21:56 | 223,313,564 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,496 | h | cond_stmt.h | /*
* Created by zx5 on 2019/11/28.
* Copyright (c) zx5. All rights reserved.
*/
#ifndef C0_COND_STMT_H
#define C0_COND_STMT_H
#include "basic_stmt.h"
#include <unordered_set>
namespace cc0::ast {
class IfElseStmtAST final: public StmtAST {
private:
_ptr<CondExprAST> _cond;
_ptr<StmtAST> _... |
0f662946722e3fb291108598e67cc460ce7e136c | 820b6af9fd43b270749224bb278e5f714f655ac9 | /Rendering/LICOpenGL2/vtkImageDataLIC2D.h | af51577c843664b8acebe58281d99e0d2b5a5246 | [
"BSD-3-Clause"
] | permissive | Kitware/VTK | 49dee7d4f83401efce8826f1759cd5d9caa281d1 | dd4138e17f1ed5dfe6ef1eab0ff6643fdc07e271 | refs/heads/master | 2023-09-01T10:21:57.496189 | 2023-09-01T08:20:15 | 2023-09-01T08:21:05 | 631,615 | 2,253 | 1,243 | NOASSERTION | 2023-09-14T07:53:03 | 2010-04-27T15:12:58 | C++ | UTF-8 | C++ | false | false | 4,179 | h | vtkImageDataLIC2D.h | // SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
/**
* @class vtkImageDataLIC2D
*
*
* GPU implementation of a Line Integral Convolution, a technique for
* imaging vector fields.
*
* The input on port 0 is an vtkImageData with extents... |
9ce57c7401a14c9d335d43a51b388ffe8768eb97 | cbcb499c8196b4a7e9c4fb153440a1ab56fe7fe5 | /SciDac2007/test.cpp | c8ec0118fe0632c88ccd085e78f562f445e8e1fe | [] | no_license | mdipierro/fermiqcd | 6b8a2526f1f41c2eef7d0a498aabd91ceae6744c | 49870936e1555bf50686c9f7de963f874893586d | refs/heads/master | 2021-01-21T13:41:11.625537 | 2013-06-23T09:09:55 | 2013-06-23T09:09:55 | 48,326,329 | 7 | 7 | null | 2016-05-23T10:59:43 | 2015-12-20T15:28:34 | HTML | UTF-8 | C++ | false | false | 1,361 | cpp | test.cpp | /*
python qcd.py code +hot TxXxYxZ=4x4x4x4 +loop n=10 { +heatbath +plaquette } +loop n=1 { +ape_smear steps=1 +plaquette +topological_charge_vtk }
+hot warning: assuming default argument nc=3
+heatbath warning: assuming default argument beta=5.0
+heatbath warning: assuming default argument steps=1
... |
310e72bd9af27aa1f87727fbf415c361a923a5bc | 171b27ba265922de7836df0ac14db9ac1377153a | /include/eve/module/real/core/function/regular/simd/x86/average.hpp | 4e553b8a75798d157ef9bf7ffdb673c5af835dda | [
"MIT"
] | permissive | JPenuchot/eve | 30bb84af4bfb4763910fab96f117931343beb12b | aeb09001cd6b7d288914635cb7bae66a98687972 | refs/heads/main | 2023-08-21T21:03:07.469433 | 2021-10-16T19:36:50 | 2021-10-16T19:36:50 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,392 | hpp | average.hpp | //==================================================================================================
/*
EVE - Expressive Vector Engine
Copyright : EVE Contributors & Maintainers
SPDX-License-Identifier: MIT
*/
//==================================================================================================
#pr... |
168ec887e2d9160cce01a41a5672fc9e8a0527c3 | e0dca452f8ebf10b8575576b688053ab523c33fc | /tests/MockCopier/AllTests.cpp | bbdd4093b14f8f70d3ee1fd70a13aa603f963ca5 | [] | no_license | KevinWMatthews/CppUTest-examples | 8c44dcd8b858e2fbbf77fb89644eee6366bbd4e6 | fb85efa23b2f5a7a0529627bbd18a447c77e6d33 | refs/heads/master | 2020-03-08T04:58:01.300712 | 2018-04-10T15:11:44 | 2018-04-10T15:11:44 | 127,935,558 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 840 | cpp | AllTests.cpp | #include "CppUTest/CommandLineTestRunner.h"
#include "CppUTest/TestPlugin.h"
#include "CppUTest/TestRegistry.h"
#include "CppUTestExt/MockSupportPlugin.h"
#include "SomeStructCopier.h"
#include "SomeStructInitParamsComparator.h"
#include "HiddenStructCopier.h"
int main(int ac, char **av)
{
SomeStructCopier some_st... |
32c2cd95c9bd3b48a1a7579b2bd4919d5010d063 | f9359a88f0f81929eb73774e8685b11d532cbab4 | /configurator.cpp | b47775ee5b4fa6e30a8ab47ef034fc3858175d15 | [] | no_license | newmen/diamond_easy | 63991d18d154896d31a69c849d7f0c826c4ea76d | 9d1c787cc46786b9d41d4bbedeb4c8e31bee0684 | refs/heads/master | 2020-05-07T17:19:55.399512 | 2013-05-07T06:39:44 | 2013-05-07T06:39:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,589 | cpp | configurator.cpp | /*
* configurator.cpp
*
* Created on: 30.05.2011
* Author: newmen
*/
#include <boost/regex.hpp>
#include <sstream>
#include "configurator.h"
#include "parse_error.h"
#include "parse_params_error.h"
namespace DiamondCA {
Configurator::Configurator() : _need_help(false), _config_file_name(CONFIG_FILE),
_... |
d6911fd37d1f6a547099d4998f29c9a4c1d1edb8 | 4a963c126bd43b990a7c55a281870f77b4d7eed0 | /ctrldesk/cli.cpp | f21f4d170019a3ad7bd3683c0dd3b64b715b886e | [] | no_license | Arancreat/ctrldesk | eb9e8395a6a94e348cca81d7514ffba3afcf831c | ca5c04a1583a2033abed2ad6178742c5b72cb8a2 | refs/heads/master | 2023-03-03T23:44:22.217161 | 2021-02-16T08:57:06 | 2021-02-16T08:57:06 | 337,785,858 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,569 | cpp | cli.cpp | #include "cli.h"
//Private
string CLI::ConvertWideToUtf8(wstring wstr)
{
if (wstr.empty())
{
return string();
}
int count = WideCharToMultiByte(CP_UTF8, WC_ERR_INVALID_CHARS, wstr.c_str(), (int)wstr.size(), NULL, 0, NULL, NULL);
string str;
if (count)
{
str.resize(count);
... |
8a81e5732b64e77e63488c5b13a554431536d8b4 | 920fe5fac4eb93493b14905801ca9f13a4dd2d11 | /src/p10789.cpp | d6020a5eb002eeb8a630c52f75e951d3a81d83c1 | [] | no_license | jamesdjuhartono/UVa-Problems | e11ec667178f608c5dd59c5f9bb7268e6e6bb61f | 96ec3552d13b3141d82fad91824ae64e8063170e | refs/heads/master | 2021-01-13T02:30:06.934691 | 2014-06-10T08:05:04 | 2014-06-10T08:05:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,479 | cpp | p10789.cpp | #include <iostream>
#include <string>
#include <string.h>
using namespace std;
bool prime[1000000];
void fill_prime()
{
for(int i = 0; i < 1000000; i++)
prime[i] = true;
prime[0] = false; prime[1] = false;
for(int i = 2; i < 1000000; i++)
{
if(prime[i])
{
for(in... |
cadb6eb716f7d799eef8afe0f2d6c2f99180782d | 8596f63928ef8a3bf643322516dbe2d7011caec3 | /114.flatten-binary-tree-to-linked-list.cpp | 78f1d004d33ae8bcd98694e0aba2863428abe41b | [] | no_license | Joory2016/MyLeetCode | 0965777bc9608ef937aa3045c85cbd7bb687a68d | 1e7fe42b31ba25295acff4930465a65cd3da4df9 | refs/heads/master | 2020-06-01T06:44:21.112925 | 2019-07-15T10:58:16 | 2019-07-15T10:58:16 | 190,684,218 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,695 | cpp | 114.flatten-binary-tree-to-linked-list.cpp | /*
* @lc app=leetcode id=114 lang=cpp
*
* [114] Flatten Binary Tree to Linked List
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution
{
public:
void ... |
cada1a57315336d5da0e4a0bf979f43095aee953 | c46fe10e8074e4a1deacb68054c10c1aa978347b | /InputExample/inputcontex/iconfont/iconhelper.h | 504adc8c6e3d7948100d9edc5ca19179f9eb8db9 | [] | no_license | birdman1992/toolmodules | bc5c6cd13cacae75ff7675b8df6beee81987cae9 | 532105dcafd4e8e40ade41d3bc38371a5af5c7c4 | refs/heads/master | 2021-09-19T01:42:53.796967 | 2021-08-13T14:10:22 | 2021-08-13T14:10:22 | 97,546,453 | 1 | 1 | null | 2020-04-27T12:30:03 | 2017-07-18T03:04:10 | C++ | UTF-8 | C++ | false | false | 1,147 | h | iconhelper.h | #ifndef ICONHELPER_H
#define ICONHELPER_H
#include <QObject>
#include <QFont>
#include <QFontDatabase>
#include <QMutex>
#include <QLabel>
#include <QIcon>
#include <QList>
#include <QPushButton>
#include <QApplication>
class IconHelper:public QObject
{
Q_OBJECT
private:
explicit IconHelper(QObject *parent = ... |
fc1e7321b27c6dbc7e996d57f50a22822dfddc7e | 7454f4cb2e49186ce11013469fc8508d458b48a5 | /src/lib/utils/column_ids_after_pruning.hpp | 1e23941e26886cdbfceab85cc17d5580a1dabfde | [
"MIT"
] | permissive | bengelhaupt/hyrise | 0f8f5af736dae0b98adb09627c8e9d4d52fea822 | dc2b6d9f205b9f31f989dc8821b6167ad7202fab | refs/heads/master | 2023-07-15T11:40:23.813975 | 2021-08-24T17:07:19 | 2021-08-24T17:07:19 | 373,451,697 | 1 | 0 | MIT | 2021-08-24T10:28:11 | 2021-06-03T09:27:16 | C++ | UTF-8 | C++ | false | false | 504 | hpp | column_ids_after_pruning.hpp | #pragma once
#include "types.hpp"
namespace opossum {
// Stores the updated ColumnID at the index of the original ID if the original column was not pruned.
// If the original column with ColumnID c was pruned, the id_mapping vector contains nullopt at index c.
std::vector<std::optional<ColumnID>> column_ids_after_pr... |
63b62a4030170f5785cf234716aa976b681db10e | bcf138c82fcba9acc7d7ce4d3a92618b06ebe7c7 | /gta5/0xB096419DF0D06CE7.cpp | 33372ddf06d3efc73602293e43cf0b4711ea937f | [] | no_license | DeepWolf413/additional-native-data | aded47e042f0feb30057e753910e0884c44121a0 | e015b2500b52065252ffbe3c53865fe3cdd3e06c | refs/heads/main | 2023-07-10T00:19:54.416083 | 2021-08-12T16:00:12 | 2021-08-12T16:00:12 | 395,340,507 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 412 | cpp | 0xB096419DF0D06CE7.cpp | // main_persistent.ysc @ L332066
void func_5245()
{
int iVar0;
if ((func_5260(Global_110719) != 4 || func_5259(Global_110719) < 40) || func_5259(Global_110719) > 50)
{
iVar0 = Global_110719;
func_5250(&iVar0, 0, 2, 0, 0, 0, 0);
CLOCK::SET_CLOCK_TIME(func_5260(iVar0), func_5259(iVar0), func_5249(iVa... |
a155e908b2e55c8765f2eef0596788f57ea7338c | 9aea695ff093bd979e923a5fcfc0b2319d2309cf | /src/browse.cpp | 3da421a757b6ad60c0b92514b9f6602c57f1e6e6 | [] | no_license | Sedisan/TODO | 11be865c4652ef6a1d634ad9e2990e9e2ecb8209 | d19c25c9aa928d5871f3f16b1e08bc8825650a96 | refs/heads/master | 2020-03-14T13:39:34.617312 | 2018-05-02T14:45:46 | 2018-05-02T14:45:46 | 131,637,352 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,793 | cpp | browse.cpp | #include "../Header/header_for_all_files.hpp"
void Browse::make_basic_activity(Keep &keep, std::vector<Keep> & vector_with_all_activity, std::string day)
{
std::string var_to_split = OpenFile().get_all_lines_from_file(StaticClassToTest::name_of_base);
auto splitted_vector = OpenFile().split_file_by_delimeter(... |
166997d265796bb6090430bf239d6e1ca2cf4dd7 | 037c7a8bc39146c31449e248f8a9c025ec1c01d0 | /02.device/c++/chapter8/ex03_deepcopy.cpp | 374604a7017483e095fe643c8a7e4b344c5b0994 | [] | no_license | cooluks2/iot | e62874624bc06acbe5647fed35f6ec62bd582e7f | e452b29f0c6967dad9b11207c3b5189cec385497 | refs/heads/master | 2023-01-22T17:19:58.456577 | 2020-11-20T11:36:34 | 2020-11-20T11:36:34 | 292,755,019 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 368 | cpp | ex03_deepcopy.cpp | class MyArray{
public:
int size;
int *data;
MyArray(const MyArray& other){
size = other.size;
data = new int[other.size];
for(int i=0; i<size; i++){
data[i] = other.data[i]; // 복사 생성자 호출
}
}
~MyArray(){
if(data != NULL){
de... |
a7566006177418f98c731df48228df50917de81b | 1584d1af83996c63adb25973cc61abf31c6364d8 | /BaseDefender/common/QuadTree.h | e457cd9514c763c73edd85a0b5ef9aa1058e2ed3 | [] | no_license | bcboschTU/BaseDeffender | 2275c0d45531fe0e0076248e99168e634615d108 | a441ae3d2fecac4e7d2d7e858c6297b549266d36 | refs/heads/master | 2020-04-10T11:55:30.064199 | 2015-06-02T11:34:15 | 2015-06-02T11:34:15 | 31,467,799 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 957 | h | QuadTree.h | //
// QuadTree.h
// BaseDefender
//
// Created by Bert Bosch on 03-03-15.
// Copyright (c) 2015 Bossos. All rights reserved.
//
#ifndef __BaseDefender__QuadTree__
#define __BaseDefender__QuadTree__
#include <stdio.h>
#include <vector>
#include "Bullet.h"
class QuadtreeBullet {
public:
QuadtreeBullet(float x,... |
09accffc7532d66cd0dcd639e356b118013009e5 | 9e5ec0f973fdd062760a607a6cfc086abd61a257 | /src/AHZArmorInfo.cpp | 3ef8f416bd0ee9a706205bbde9f5382fdfb971c2 | [
"MIT"
] | permissive | ahzaab/moreHUDSE | c3f42ffd74942a49a1238c29eb75b75cdcb3ddca | 0b6995a8628cec786f822d2e177eae46dcee0569 | refs/heads/master | 2023-02-03T06:43:57.914016 | 2023-01-31T16:02:46 | 2023-01-31T16:02:46 | 107,052,110 | 4 | 5 | MIT | 2022-09-22T22:39:56 | 2017-10-15T21:56:24 | C++ | UTF-8 | C++ | false | false | 2,619 | cpp | AHZArmorInfo.cpp | #include "pch.h"
#include "AHZTarget.h"
#include "AHZArmorInfo.h"
auto CAHZArmorInfo::GetWornExtraList(RE::BSSimpleList<RE::ExtraDataList*>* extraList) -> RE::ExtraDataList*
{
if (extraList) {
for (auto entryListIT = extraList->begin(); entryListIT != extraList->end(); ++entryListIT) {
auto ext... |
08473746d00438f4816fdada0096ae0e44752ce1 | b8653e310e55f38af2ef26e6a1ccc67b97870bb8 | /lib/my_objects_lib/Panel.cpp | e30ae4498e3d4921efb95efc6ef2566311b931ca | [] | no_license | MonkeYKonG/Enchiladas-s-shmup | d73221038d3eb5412418b639215610050317e8e9 | 509f6f54d2d3853e49e2ce3d93722b7e1ea06160 | refs/heads/master | 2021-09-03T10:51:19.146507 | 2018-01-08T12:41:14 | 2018-01-08T12:41:14 | 106,934,528 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,562 | cpp | Panel.cpp | #include "Panel.hpp"
namespace my
{
Panel::Panel()
{}
Panel::~Panel()
{}
bool Panel::IsIntersect(const sf::Vector2f & point) const noexcept
{
return (false);
}
bool Panel::IsIntersect(const sf::FloatRect & square) const noexcept
{
return (false);
}
const sf::FloatRect Panel::GetHitBox() const noexc... |
c5e02cff1d130f189fdd4c16007ccf431bb641cc | 7ab41799fd38489c93282f1beb3b20e7ef8ff165 | /cpp/76.cpp | 281f26930350c41a4ae46279962b52a46592ac8f | [] | no_license | scturtle/leetcode-sol | 86c4095df6b31a9fcad683f2d63669ce1691633c | e1a9ce5d9b8fe4bd11e50bd1d5ba1933de845db7 | refs/heads/master | 2020-04-23T00:01:37.016267 | 2015-11-21T04:15:27 | 2015-11-21T04:15:27 | 32,385,573 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,124 | cpp | 76.cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <utility>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <climits>
#include <numeric>
using namespace std;
template<typename T>
void prints(vector<T> &v){
cout << "[";
for(uint i=0; i<v.size()... |
c8ec3dbaaef7144e23b326e695430c83504b71e2 | 76a5686e643a6e2903eb17990a16b2bc40368fe9 | /tool12-scanTest4 (dataformat)/src/testApp.h | cbf1a4af8d0b086c96b26c4492aa76e370d37632 | [] | no_license | carlesgutierrez/HanRiver-openFrameworks | cb42aeaef06d6cf1d9679e2fb0cb3e629e1dcb0c | 0fc4ba45846d9b9bfa67e3fcef674fbea7ba7a1d | refs/heads/master | 2021-01-17T21:32:57.938974 | 2012-05-09T05:21:39 | 2012-05-09T05:21:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 857 | h | testApp.h | #pragma once
#include "ofMain.h"
#include "ofxOsc.h"
#include "ofxCvGui.h"
#define SERVER_PORT 5588
#define CLIENT_PORT 5588 + 1
#include "ofxGraycode.h"
#include "CameraHead.h"
using namespace ofxGraycode;
class testApp : public ofBaseApp {
public:
~testApp();
void setup();
void update();
void draw();
void... |
af9ccea58a866b24e83bb7f1b9341fed844b45f3 | aa7817e54c6bdb42a9983c7ea8ee71131e414c30 | /rod-cut/main.cpp | d9cc622824dd49331238d7bbbea29def2463b51a | [] | no_license | mndxpnsn/cut-rod | 37aa9e279a644b7b9aadda9266e4be7ae0565616 | 7fe6da2afbe8d154152fbaed06cbd1923a9f3f56 | refs/heads/master | 2023-08-20T05:17:28.393386 | 2021-10-26T11:04:03 | 2021-10-26T11:04:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,375 | cpp | main.cpp | //
// main.cpp
// rod-cut
//
// Created by mndx on 26/10/2021.
//
#include <iostream>
#include <stdio.h>
#include <vector>
#include <stdlib.h>
#include <time.h>
#include "cut_rod.hpp"
#include "cut_rod_ref.hpp"
#include "user_types.hpp"
int main(int argc, char* argv[]) {
int N = 100; //Total length of the ro... |
eab880f84d95ccd64f4c1bcaf8a1424eb256df94 | 029fffd176559418ed867631eac063ed895f88a8 | /Input/TransformInputDialog.h | a6516b53fbcb087b329bca1a713080abd240531c | [] | no_license | CISMM/sketchbio | 451200a8c9cf3a96abb221e11917e10dd1d80a2d | eb40df18ecd38750fe7597f51d59e0041afa9aef | refs/heads/main | 2023-06-26T23:35:31.301054 | 2021-07-29T13:50:03 | 2021-07-29T13:50:03 | 390,739,422 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,638 | h | TransformInputDialog.h | #ifndef TRANSFORMINPUTDIALOG_H
#define TRANSFORMINPUTDIALOG_H
#include <QDialog>
#include <QVector>
class QDoubleSpinBox;
class TransformInputDialog : public QDialog
{
Q_OBJECT
public:
// Creates a new TransformInputDialog with the given title
explicit TransformInputDialog(const QString &title,QWidget *... |
1ab8014419e2ffb3bfea2b2f0de24681c619d735 | 449dbc9c7d26de12588ac27c4628ce75da0629c6 | /db/Db_redis.cpp | 8123d3aa16f00e9467e0d32f7c22c2cfbe2e3a52 | [
"BSD-3-Clause"
] | permissive | berak/opencv_smallfry | fde87d2b9aa0698cfc3cdd2d3ac286e0da7e0509 | 2653a3b823499d1412c5a1d6dd977502d88d6590 | refs/heads/master | 2022-07-07T23:41:39.914141 | 2022-07-03T19:58:06 | 2022-07-03T19:58:06 | 12,484,192 | 61 | 28 | null | 2019-01-16T07:01:08 | 2013-08-30T10:39:40 | C | UTF-8 | C++ | false | false | 4,811 | cpp | Db_redis.cpp | //
//
#include "opencv2/core/core.hpp"
#include "birds/birds.h"
#include "opencv_db.h"
#include <cstdio>
#include <iostream>
using namespace cv;
using namespace std;
//
// table and image names get concatenated to a key: "tab.img"
// each item is a list: type,w,h,pixels(binary) (RPUSH,LRANGE,LINDEX,..)
//
struct Red... |
70d1e842ac5cdebcbd12e0e0cbfe3487ab9e0de9 | c6f08f2bb8b812bcb63a6216fbd674e1ebdf00d8 | /ni_header/NiShaderToolkit.h | f9f64cd333db7421ea93928492c02434a0fe1a7e | [] | no_license | yuexiae/ns | b45e2e97524bd3d5d54e8a79e6796475b13bd3f9 | ffeb846c0204981cf9ae8033a83b2aca2f8cc3ac | refs/heads/master | 2021-01-19T19:11:39.353269 | 2016-06-08T05:56:35 | 2016-06-08T05:56:35 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,620 | h | NiShaderToolkit.h | // NUMERICAL DESIGN LIMITED PROPRIETARY INFORMATION
//
// This software is supplied under the terms of a license agreement or
// nondisclosure agreement with Numerical Design Limited and may not
// be copied or disclosed except in accordance with the terms of that
// agreement.
//
// Copyright (c) 1996-2004... |
a345cbdda8d81655d8b96b76710c02c269e78826 | 045945f2556a0f03e08b5f251fa295016ba1b4a1 | /src/models/andortree.h | d0677c67d0062056323c5ce5028bcfc364088625 | [] | no_license | Rextuz/And-or-Tree | 50d792305955971741ee0f75f1e447e790652428 | 2a93b95358ccb5df8b2165ee646f8b40b45ae551 | refs/heads/master | 2021-03-24T12:45:31.587590 | 2017-06-16T22:09:04 | 2017-06-16T22:09:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,265 | h | andortree.h | #ifndef ANDORTREE_H
#define ANDORTREE_H
#include <QJsonObject>
#include "node.h"
// Polymorphic tree container
namespace kkcs {
template <class T>
class AndOrTree
{
private:
Node<T> *root;
AndOrTree(AndOrTree const&);
AndOrTree& operator= (AndOrTree const&);
public:
AndOrTree(NodeType type)
{
... |
8a46320636897e03e5cb876b5e0ac01bb7c36f6a | abaa47fb6e684f280036cdc4c5fe7f2083f56d06 | /day04/ex01/srcs/Undead.cpp | 2e6d415f313e77ceb3c5e24fcf1009744c3d0564 | [] | no_license | Althis974/PiscineCPP | 91b4015a1b96f0e39289a1463e61a67edd03c741 | b4fc4e44a8be4882275b22260b82bba9821fdc98 | refs/heads/master | 2020-09-13T08:38:15.834788 | 2020-02-05T11:12:23 | 2020-02-05T11:12:23 | 222,714,310 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,574 | cpp | Undead.cpp | /* ************************************************************************** */
/* LE - / */
/* / */
/* Undead.cpp .:: .:/ . .:: ... |
0eb8f136350ffc8ca9b5ed68953b93ec4a5ad9ea | 0107598661343ef29e33f4b45ad88d3159383147 | /programmi usati/DHT11/DHT11.ino | 1945ee29020eb1c2076270d325e9b5d422201d01 | [] | no_license | CampanelliEmanuele/High-school-graduation-project | f31616242f6e126b8fbe1b02e06fb39b1f540343 | dc524a61e58465fb7f88dc9d2d05156c86464e11 | refs/heads/main | 2023-08-03T01:32:20.242390 | 2021-09-19T01:40:58 | 2021-09-19T01:40:58 | 350,371,457 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 716 | ino | DHT11.ino | #include <SimpleDHT.h>
SimpleDHT11 dht11;
#include <LiquidCrystal.h>
LiquidCrystal lcd (7, 6, 5, 4, 3, 2);
bool FIRST = true;
byte t = 0;
byte h = 0;
void setup() {
Serial.begin(9600);
lcd.begin(16,2);
}
void loop() {
int err = SimpleDHTErrSuccess;
if ((err = dht11.read(9, &t, &h, NULL)) ... |
5638bd4dbc2e54db256c7d91f9fd6650efc3632c | 03602b1b1350a4a7500da9625580f96adc48e765 | /src/main/moc_mainview.cpp | a2578af6788bbfb8e73b635b031299d8be1d474e | [] | no_license | fernandobt8/cg | c70e9314619615332f866ddcee935957cec90ee8 | 0fc45d5b0e423d80b4e8878484ed470ab6b14304 | refs/heads/master | 2021-01-22T08:14:22.645410 | 2020-09-21T22:46:04 | 2020-09-21T22:46:04 | 18,000,422 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,396 | cpp | moc_mainview.cpp | /****************************************************************************
** Meta object code from reading C++ file 'MainView.h'
**
** Created: Wed May 14 22:51:37 2014
** by: The Qt Meta Object Compiler version 63 (Qt 4.8.4)
**
** WARNING! All changes made in this file will be lost!
**************************... |
003e65e1a3c3f67c925dc5758b1c631e88688f73 | 2dd21c84aea35b1c140e1e937f56bd49605a614c | /include/Contrac_twopoint.h | 82c7a03ccc30157172f40069f843896b59ac54a6 | [] | no_license | CT0322/coupled_4channel_code | e7c9fb3c7b6298a96103e7824f1492adce3b2150 | 461638a06e59a8b31873e00d7f3e72a319f06776 | refs/heads/master | 2021-01-20T06:17:53.867865 | 2017-05-25T04:57:43 | 2017-05-25T04:57:43 | 89,864,193 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,319 | h | Contrac_twopoint.h | /*
* Contrac_twopoint.h
*
* Created on: Mar 26, 2013
* Author: knippsch
*/
#ifndef CONTRAC_TWOPOINT_H_
#define CONTRAC_TWOPOINT_H_
#include <iostream>
#include <complex>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <typeinfo>
#include <fstream>
#include <Eigen/Dense>
#in... |
1982abc1c9c844c7cbce84cba67173b4966b0178 | 3cbea0497545c00ffc87fe1fa8a74dfe88dc9509 | /454_4SumII.cpp | 87abad016b405ed1c60f505f0a291a1f0aeed73c | [] | no_license | yuhenghuang/Leetcode | 40b954676feb3a2ef350188a6d86dadc44e84d71 | 3c5aafa7969a5a1eb01106676a5b94d404d07d9f | refs/heads/master | 2023-08-30T18:17:16.209053 | 2023-08-25T01:05:49 | 2023-08-25T01:05:49 | 249,166,616 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 763 | cpp | 454_4SumII.cpp | #include "utils.hpp"
#include <unordered_map>
class Solution {
private:
unordered_map<int, int> product(const vector<int>& a, const vector<int>& b) {
unordered_map<int, int> m;
for (int i=0; i<a.size(); ++i)
for (int j=0; j<b.size(); ++j)
++m[a[i]+b[j]];
return m;
}
pu... |
6ac0d3933a77aa5ff4b2a792decb4a04f9fc96ab | 5e7098aa1d4cac17873f77a626d95e97f2d5c07b | /dijkstra.cpp | b7cc1312d3cad3b84c5924c7a0376ce53c98e145 | [] | no_license | vartulbiet/uva | e73f82ae5f0b9d82baa9612be73322574919a91d | 85d3328185cbf9df8b0e18a1902b27dcd6b6eb68 | refs/heads/master | 2016-09-03T07:13:04.510472 | 2015-07-09T06:52:42 | 2015-07-09T06:52:42 | 38,802,883 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,419 | cpp | dijkstra.cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<map>
using namespace std;
int arr[100][100];
int ans;
int r,c;
int dist[100][100];
int m,n;
map<pair<int,int>,bool>mymap;
int find_set(int*arr,int m)
{
if(arr[m] == m)
return m;
else
return arr... |
c74bb666ccdd3a81a7f7f7163d538265942bcdce | 3cd21e6bcc24db8b9f71c1fef5232a37267ad66f | /interviewbit/KnightOnChessBoard.cpp | 64da50634d98ebf2a931f6f78e7e70236bd394ad | [] | no_license | nishantydv97/competitive_coding | 4f3df9a140ca42cfb923af8669ebe386e1e1fb43 | b4f07331087b7ee3b82cc6c286392736655048fb | refs/heads/master | 2022-05-18T02:59:50.626798 | 2022-04-07T19:18:58 | 2022-04-07T19:18:58 | 101,529,239 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,284 | cpp | KnightOnChessBoard.cpp | /*
Given any source point, (C, D) and destination point, (E, F) on a chess board, we need to find whether Knight can move to the destination or not.
Knight's movements on a chess board
The above figure details the movements for a knight ( 8 possibilities ).
If yes, then what would be the minimum number of steps for... |
ffaedad85a800c61f963047734c7068091e11155 | 39a0387458aeb07aeb8aebd195a3ce53109ef6c9 | /Homework2/Solution/pq.cpp | bb30ff26e3ce093965de5aaf624cf74cfcf9f819 | [] | no_license | incesubaris/Analysis-of-Algorithms-I | 943de5e3a289e90cb01d46ac08a33cbd998e7d85 | 7176c9dd328673f1ad9d33dababf937636c41084 | refs/heads/main | 2023-05-11T23:41:33.354908 | 2021-04-25T12:13:36 | 2021-04-25T12:13:36 | 318,811,590 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,956 | cpp | pq.cpp | // priority-queue using vector implementation of binary heap
#include <bits/stdc++.h>
#include <vector>
using namespace std;
vector<double> taxi;
int size = -1;
// Function to return the index of the parent node of a given node
int parent(int i)
{
return (i - 1) / 2;
}
// Function to return the index of the lef... |
db3ce38470a3878fea0c450245cf68f672e0a141 | 485f702cf2b637e37e90e21a2eaf01b6a8716fa5 | /mainwindow.cpp | 2768094f89a287cd8f51952aab11680fe20223bf | [] | no_license | alikanarya/metergui | c9731364e2f680e48001a4bca0fbd388d690a4f7 | eef1219727da803e05e84e8164c5f16570afac86 | refs/heads/master | 2020-12-10T01:07:07.071290 | 2020-01-13T21:56:17 | 2020-01-13T21:56:17 | 233,466,922 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,271 | cpp | mainwindow.cpp | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <QDebug>
MainWindow::MainWindow(QWidget *parent)
: QMainWindow(parent)
, ui(new Ui::MainWindow)
{
ui->setupUi(this);
}
MainWindow::~MainWindow()
{
delete ui;
}
void MainWindow::on_loadButton_clicked()
{
loadedFileNamewPath = QFileDialog... |
9c0d2f0ae412fa7e61ab3f695b53c745a0144af5 | a92c5102c20986eadd02145925bd1e825d94bc29 | /COMP371-Project/Object.cpp | b462adbc5ddbad506de5022520c8f3c6b5099b38 | [] | no_license | mwPlouffe/COMP371-Project | 43c89208717feea45df30a0224ac30bb69cc0c16 | b395fc7fbabe1da626d12269ece02110fe0ff47e | refs/heads/master | 2020-03-20T22:26:16.221936 | 2018-06-18T19:49:54 | 2018-06-18T19:49:54 | 137,798,791 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 968 | cpp | Object.cpp | //
// Object.cpp
// COMP371-Project
//
// Created by Mathew Plouffe on 2018-06-04.
// Copyright © 2018 Mathew Plouffe. All rights reserved.
//
#include "Object.h"
Object::Object(void)
{
material = Material();
}
Object::Object(const Point& p) : Entity(p)
{
material = Material();
}
Object::Object(const Point& p, ... |
603f647c2810a838a0448de13659d97567f74999 | 0a8588d8e9df1dfaec54224fe6d55cc5b8091257 | /uva/106-fermat-pythagoras.cpp | d4155749d96b81641fedb33ae8cd1c5d9d0e1a13 | [] | no_license | skalyanasundaram/BrainTuners | 17e686e540bad3e809c78e0a9462e95fc12b5370 | 2605550e18750485b693804c3d83c3c97706362b | refs/heads/master | 2021-01-06T20:41:45.395191 | 2019-02-04T08:45:36 | 2019-02-04T08:45:36 | 12,889,243 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,272 | cpp | 106-fermat-pythagoras.cpp | #include <iostream>
#include <math.h>
using namespace std;
// #define MAX_SIZE 1000000
// #define COUNT(x) if(!flags[x]) { count--; flags[x] = 1; }
// inline int GCD(unsigned long a, unsigned long b) {
// unsigned long temp = 0;
// while(b > 0) {
// temp = b;
// b = a % b;
// a = te... |
9a9f7bb0f8ae91c4853526291dc2a4ddcbb004dd | 477877d03637c6ceeb24d25d7537ef3ea71899e9 | /Stemmer/Stemmer.cpp | 69cdcf54360a4565666fae38989b23748796b440 | [] | no_license | abokov/tools | 88a978105071008fb6498b1b83aaba9c43adac63 | ee35c28a9cacd8aef719bf0e858bbf985c4f0006 | refs/heads/master | 2021-03-12T21:20:47.599404 | 2017-10-16T14:42:51 | 2017-10-16T14:42:51 | 35,889,235 | 0 | 0 | null | null | null | null | WINDOWS-1251 | C++ | false | false | 5,429 | cpp | Stemmer.cpp |
#include <iostream>
#include <string>
#include "..\..\dllobjs\Lang_dll.h"
#include "..\..\common\ini_log.h"
#include "..\..\common\utils.h"
#include "..\..\common\errdefs.h"
// dummy object for linking with ini_log.cpp
char Section[]= "";
enum LanguageTypes { lang_russian, lang_english };
void usage(void);
void do... |
b025168d4c5c65c526300c2443d5c7538a74f8a9 | d05555aa4da349b8a1cc219b4c3fae881577f7ab | /A1599/1599笨重的石子.cpp | a374ef2ab07ad83e1d447955b8d7b0634c0acac2 | [
"MIT"
] | permissive | instr3/BZOJ-solution-legacy | c95cc0882d24c8b74b72a546cf9f2b84d541faea | a71f7df2241602ad744e8ca2453a8423590d5678 | refs/heads/master | 2021-01-11T05:19:01.069622 | 2016-09-26T03:19:38 | 2016-09-26T03:19:38 | 69,208,796 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,310 | cpp | 1599笨重的石子.cpp | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
#define each(i,n) (int i=1;i<=(n);++i)
#define every(i,a,b) (int i=(a);i<=(b);++i)
int tres[81];
int n1,n2,n3;
int main()
{
freopen("1599.in","r",stdin);
freop... |
ca801c5c9728daebe8a126bb71c65f3d62bf157b | 70549e8671ea72b9c4e460e135783b6917a39860 | /NewPageTable.cpp | 178e2fd46d3df8222af238abea9bea29908e2672 | [] | no_license | isha97/Custom-Memory-Manager | ec91c1d410d5e309aecf962ac77783ffa635f9de | f48afad45a5b56ff1c3ab22bf8d028749679ac99 | refs/heads/master | 2021-01-01T05:13:58.588472 | 2016-09-21T14:14:33 | 2016-09-21T14:14:33 | 57,883,141 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,453 | cpp | NewPageTable.cpp | // It uses overrode new and delete functions
#include <sys/types.h>
#include<bits/stdc++.h>
#include<time.h>
#include<stdio.h>
#include "mmanager.h"
//#define POOLSIZE 32
class PageTable
{
public:
PageTable (double a, double b): frameno (a), pageno (b) {}
inline void* operator new(size_t);
inline void o... |
5af6f7aed65d5945d46424371e743365421a8008 | 951309889c9cf4b3a0deb2fc424fe39cdedc4860 | /tasker.h | a2494d99fc5996ea1986c096b21bb3358935555e | [] | no_license | urizilber/Schular | 9bd4f607fcee5c101330a4b63ee5636397e03604 | 376d4cf67c38f717efc48928fa7e044615209314 | refs/heads/master | 2023-04-04T02:52:16.334754 | 2021-04-10T20:57:01 | 2021-04-10T20:57:01 | 356,282,076 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 436 | h | tasker.h | #ifndef TASKER_H
#define TASKER_H
#include <iostream>
#include <chrono>
typedef void (*Callable)();
class Tasker
{
public:
Tasker(std::chrono::system_clock::time_point &timt_a,Callable f);
std::chrono::system_clock::time_point getTime();
bool operator< (class Tasker* rhs) {
return this->timt_t < rhs->getTime()... |
60c2571e36fcd55ca8c0564ab58d1e0b54b83a78 | 165be8367f5753b03fae11430b1c3ebf48aa834a | /source/backend/cpu/CPUArgMax.hpp | 0314091bd809c64abf85e77781e1924efb947677 | [
"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 | 979 | hpp | CPUArgMax.hpp | //
// CPUArgMax.hpp
// MNN
//
// Created by MNN on 2018/07/17.
// Copyright © 2018, Alibaba Group Holding Limited
//
#ifndef CPUArgMax_hpp
#define CPUArgMax_hpp
#include "core/Execution.hpp"
namespace MNN {
class CPUArgMax : public Execution {
public:
enum ArgMinOrMax {
ARGMIN,
ARGMAX
};... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.