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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
25cb35b5638ba762a01fdb45190ec015c976b351 | 5d275c77d975d53c700d14a996ac9542467ac31b | /96/src/main.cpp | 6043dfe10df1b4602af1e0ad020d8f12477ac173 | [] | no_license | 0ria/ProjectEuler | 5c31c470b980912f7d5b51c293412e60f2844115 | c1ee42fe4d39cefab92feb2a42e9e89317b41646 | refs/heads/master | 2023-01-05T08:35:40.666674 | 2020-11-05T23:32:22 | 2020-11-05T23:32:22 | 303,120,586 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,468 | cpp | main.cpp | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
std::vector<std::vector<int> > sudokuMatrix;
void showMatrix(void) {
for (auto row : sudokuMatrix) {
for (auto number : row) {
std::cout << number;
}
std::cout << std::endl;
}
}
bo... |
fd634365aa57aec8754a8a1fc936859985b9c23b | 93837771b92a3f1345eaefbd7ca1f036c2dcd5a6 | /orthodox.cpp | 020d0b315c08a7c39221d8c2a7b4f4107b776252 | [] | no_license | gauravvsgithub/Codechef | 2e30628c0a4757d80041e27b96b2417760a9f4d9 | 3867c49a8d4c2ccb67dfd1fa3b163483c43a5540 | refs/heads/main | 2023-01-29T15:00:37.490613 | 2020-12-13T03:24:34 | 2020-12-13T03:24:34 | 320,974,221 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 581 | cpp | orthodox.cpp | #include<iostream>
using namespace std;
void sumset(int sum[],int i,int n,int N,int arr[])
{
static int k=0,m=0;
for(int j=0;j<n;j++)
{
int sum1=0;
for(int k=j;k<i;k++)
{
sum1=sum1+arr[k];
}
sum[m]=sum1;
}
for(int z=0;z<N;z++)
{
cout<<sum[z];
}
return;
}
void orthodox()
{
... |
3de982aaf7cfc455b2f1988c567cd6fd206bfbe0 | 70e6553122e9c4b272ac7ab36617a84a7630c5cb | /sdk/src/SignalKDocument.cpp | d664162d88e450f897f34708073c8da33bde4c9c | [
"Apache-2.0"
] | permissive | blog-neas/fairwindplusplus | 756d6e5c8b2c602c4474d62fcba20eab9104941a | 0b703050b2cdcf6936c4ae4e485faa50f246c7b1 | refs/heads/main | 2023-05-14T13:18:48.970770 | 2021-06-07T05:31:38 | 2021-06-07T05:31:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,324 | cpp | SignalKDocument.cpp | //
// Created by Raffaele Montella on 18/04/21.
//
#include <QJsonObject>
#include <QJsonArray>
#include <QFile>
#include <QJsonDocument>
#include <iomanip>
#include <sstream>
#include "SignalKDocument.hpp"
SignalKDocument::SignalKDocument() {
insert("version","1.0.0");
}
SignalKDocument::~SignalKDocument() {
}... |
f25a587e931b7ba7b5e72f6fee1d1df3302a7c69 | 0379269a408988bed4bc8ef82339aaf910489316 | /Untitled36.cpp | 507c8068ca89453050d33d1db1f541befb1cb596 | [] | no_license | Aakash-lpu-9961/C-plus-plus-Learnings | d52f8a9455ac171c3652e5c85d7027fbdd64d9ec | 3de10d34314a2849accb4708a2e8c26f5291af25 | refs/heads/main | 2023-07-20T00:42:58.076324 | 2021-09-04T18:56:40 | 2021-09-04T18:56:40 | 403,133,064 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 606 | cpp | Untitled36.cpp | #include<iostream>
using namespace std;
class total
{
private:
int n;
public:
void getdata(void);
void putdata(void);
void add(total, total);
};
void total::getdata(void)
{
cout<<"Enter Number:";
cin>>n;
}
void total ::putdata(void)
{
cout<<"Number Enterd By User:"<<n<<endl;
cout<<"Proceeding Please Wait!... |
8c8e5e14b1f2ec8d690485fd79e11fc8ec1ef427 | 592aa065ad0bb870f8210e1492b3764404e0c372 | /src/c++/Papyrus/ConsoleUtil.h | b3569b6c62eda6307ed97631f0b50cf774e66165 | [
"MIT"
] | permissive | clayne/ConsoleUtilF4 | 777fd00d58d9b4ca0b1a073ad8444e9e034fbc11 | 0939e09bbb7ff6b06f2e076d1cf12f97f24dcb44 | refs/heads/main | 2023-07-06T11:36:48.957086 | 2021-08-08T03:58:01 | 2021-08-08T03:58:01 | 366,190,499 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,304 | h | ConsoleUtil.h | #pragma once
#include "Papyrus/Common.h"
namespace Papyrus::ConsoleUtil
{
inline void ExecuteCommand(std::monostate, std::string_view a_command)
{
RE::Console::ExecuteCommand(a_command.data());
}
inline RE::TESObjectREFR* GetSelectedReference(std::monostate)
{
const auto ref = RE::Console::GetPickRef();
r... |
c29520ac017b2953b2b310a763d6681937477bce | 4a8f783118bd1bba8023f5dbd499b08e1822ce93 | /tests/Unit/PointwiseFunctions/MathFunctions/Test_PowX.cpp | c3f229da657b6150285e5361d8c1000e37ded11d | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | denyzamelchor/spectre | 8db0757005dea9bb53cd7bd68ee8d11551705da4 | 1c1b72fbf464827788dbbdb8782a8251a2921c48 | refs/heads/develop | 2020-04-26T05:57:25.244454 | 2019-06-22T04:11:17 | 2019-06-22T04:11:17 | 155,779,028 | 0 | 0 | NOASSERTION | 2018-11-01T21:38:07 | 2018-11-01T21:38:06 | null | UTF-8 | C++ | false | false | 3,693 | cpp | Test_PowX.cpp | // Distributed under the MIT License.
// See LICENSE.txt for details.
#include "tests/Unit/TestingFramework.hpp"
#include <array>
#include <cmath>
#include <cstddef>
#include "DataStructures/DataVector.hpp"
#include "Parallel/PupStlCpp11.hpp"
#include "PointwiseFunctions/MathFunctions/MathFunction.hpp"
#include "Poi... |
45d0d4de8322153e00eb8256a40dfec3e9e6bdcb | f7555d8b0f97073818d5c59b8025b04be20b0b19 | /Basics/UserInput.cpp | 1bfedc8741137808ab8c2879c64b540b361e77c2 | [] | no_license | Guhanganesan/cplusplus | 39860dd4f95c98303809bc4d9c0e6bd983e5c12e | 8a54d7b91ac6b5d96147255c538d95e1ea08a4c8 | refs/heads/master | 2022-02-25T23:05:15.732880 | 2019-10-14T09:04:00 | 2019-10-14T09:04:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 223 | cpp | UserInput.cpp | #include<iostream>
using namespace std;
int main()
{
int x,y,z;
cout <<"Enter Number1";
cin >>x;
cout <<"Enter Number2";
cin >>y;
z=x+y;
cout << "Sum of two number is" <<z;
return 0;
}
|
88bf936de1790e4bb67124703197b0ed04c0a349 | 6d088ec295b33db11e378212d42d40d5a190c54c | /contrib/brl/bseg/bvpl/functors/bvpl_edge2d_functor.h | 8045f8941f7e9dc1298f11321854cc51a7624cec | [] | no_license | vxl/vxl | 29dffd5011f21a67e14c1bcbd5388fdbbc101b29 | 594ebed3d5fb6d0930d5758630113e044fee00bc | refs/heads/master | 2023-08-31T03:56:24.286486 | 2023-08-29T17:53:12 | 2023-08-29T17:53:12 | 9,819,799 | 224 | 126 | null | 2023-09-14T15:52:32 | 2013-05-02T18:32:27 | C++ | UTF-8 | C++ | false | false | 1,097 | h | bvpl_edge2d_functor.h | #ifndef bvpl_edge2d_functor_h_
#define bvpl_edge2d_functor_h_
//:
// \file
// \brief Functor to find the 2D edges
//
// \author Gamze Tunali (gamze_tunali@brown.edu)
// \date June 02, 2009
//
// \verbatim
// Modifications
// <none yet>
// \endverbatim
#include <bvpl/kernels/bvpl_kernel_iterator.h>
template <class ... |
3eaf16eb957a3cc6a9af47847b7880428a35660d | 51d0519ea68a98734eb6bae3456b5df6de8445ea | /Provette/Interface/Varie.h | 677d6089404031cd622a8a70bdf870bab987e1e8 | [] | no_license | eleoracca/Alacre | e9c553b59ae174e132314577c31f099d52ac3bef | dd4a80fa7f268ad621a495948bac83d94defba9f | refs/heads/master | 2021-08-15T19:01:07.840717 | 2021-07-28T09:57:38 | 2021-07-28T09:57:38 | 135,583,869 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,387 | h | Varie.h | #ifndef Varie_h
#define Varie_h
/*~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
~ Implementazione dell'utility Varie ~
~ Autori: Racca Eleonora - eleonora.racca288@edu.unito.it ~
~ Sauda Cristina - cristina.sauda@edu.unito.it ~
~ Ultima modifica: 25/08/2018 ... |
0b3d3d985e3545a0e63aac8593b9f1be669fb34f | cf1b40dcd73f10b92d86a961141883abc6811d08 | /RepairCarInfoManage/UserMngQueryDlg.h | 1f745b5e1f546d3094474e286af305499c70a643 | [] | no_license | qingshanyijiu/RepairCarInfoManage | 0fa823beea3672a0c840a476b1d43cad80ddcab9 | ce2beb0a7d4334a8ecd274501b542793ead3e4a6 | refs/heads/master | 2021-01-17T06:08:15.832469 | 2016-07-01T07:46:05 | 2016-07-01T07:46:05 | 61,848,536 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,552 | h | UserMngQueryDlg.h | #pragma once
#include <vector>
#include <string>
using namespace std;
// CUserMngQueryDlg 对话框
typedef int (*pQueryfunc)(const char* lpLicNumer,int iPages,int iMaxCount,std::vector<UserTableInfo>& userInfoList,bool bOrderInc);
class CUserMngQueryDlg : public CDialogEx
{
DECLARE_DYNAMIC(CUserMngQueryDlg)
public:
CUs... |
fe180c9023fd005f4eb4c2c2ebd8b8b52477173f | e2466243f3163fa730a7cb1726677a1ba0f500c0 | /day03/ex03/ClapTrap.cpp | 753ad4abb96a1c7d6bc74f3ea2f940aad49c64ad | [] | no_license | Enedys/ft_CPP_piscine | 3f8e8575fd0cf9c724e0e36579f4041eba00a9aa | 315a586ccba369008af10cd5a9229bc0c14521fa | refs/heads/master | 2023-02-21T02:28:29.022807 | 2021-01-24T17:51:35 | 2021-01-24T17:51:35 | 328,935,757 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,160 | cpp | ClapTrap.cpp | # include "ClapTrap.hpp"
ClapTrap::~ClapTrap()
{
std::cout << "ClapTrap object " << _name << " was destroyed!\n";
}
ClapTrap::ClapTrap() : _name("Default_name"), _type("ClapTrap")
{
}
ClapTrap::ClapTrap(const std::string &name, const std::string &trapType) : _name(name), _type(trapType)
{
_lvl = 1;
_hitPoints = ... |
7843529d9945aa38d45ab8463f4fe4085e24bbc2 | ec22513427de8131cc57131257328626dbea1e1a | /minSwapToBringKtogether.cpp | eb63a8415e35440690e432f3ed73cface77c2ffa | [] | no_license | thanwin84/Array | 7c4f25883b6fc88ca8fa253b5b91dd5fbec14317 | 1629b1fa59d0484bb940d1da44061cbaa7495d04 | refs/heads/main | 2023-07-01T06:53:59.506732 | 2021-08-10T07:55:24 | 2021-08-10T07:55:24 | 356,995,257 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 589 | cpp | minSwapToBringKtogether.cpp | //time: O(n) using sliding window techniq
int minSwap(int *arr, int n, int k) {
// Complet the function
int count = 0;
for (int i = 0; i < n; i++) {
if (arr[i] <= k) {
count++;
}
}
int bad = 0;
for (int i = 0; i < count; i++) {
if (arr[i] > k) bad++;
}
... |
75359776c875436b88b301259daceb2a82c5fcd1 | 02e2accd33e8810cb50bd8555cdb92f2a49301e7 | /cegui/include/CEGUI/RendererModules/Null/Renderer.h | bf60504d0b9bbb556cfc451fcc22a091c4615eee | [
"MIT"
] | permissive | cegui/cegui | fa6440e848d5aea309006496d2211ddcd41fefdf | 35809470b0530608039ab89fc1ffd041cef39434 | refs/heads/master | 2023-08-25T18:03:36.587944 | 2023-08-12T15:50:41 | 2023-08-12T15:50:41 | 232,757,330 | 426 | 78 | MIT | 2023-08-12T15:40:02 | 2020-01-09T08:15:37 | C++ | UTF-8 | C++ | false | false | 6,949 | h | Renderer.h | /***********************************************************************
created: Fri Jan 15 2010
author: Eugene Marcotte
*************************************************************************/
/***************************************************************************
* Copyright (C) 2004 - 2011 ... |
d4c1fa33411195c615d7a134cad87a093e41cb83 | 0f399c573b88ef5ea3fffd3c475059ec694583bb | /82_Remove Duplicates from Sorted List II.cpp | fca5dfc416ca95a00db659f1c7e0cef08b103d36 | [] | no_license | EasonQiu/LeetCode | 31075bc2ca28d23509e290b4935949500e1fec24 | 5be348261bb5f45e471de3f44dd2f57ec671ffcf | refs/heads/master | 2021-01-12T22:21:30.725971 | 2017-09-22T02:42:53 | 2017-09-22T02:42:53 | 68,566,605 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,491 | cpp | 82_Remove Duplicates from Sorted List II.cpp | // Given a sorted linked list, delete all nodes that have duplicate numbers,
// leaving only distinct numbers from the original list.
// For example,
// Given 1->2->3->3->4->4->5, return 1->2->5.
// Given 1->1->1->2->3, return 2->3.
// 感想：每次试图获取node->next的时候一定要先确保node非NULL
#include <iostream>
using namespace std;
... |
a05f79d706de0469da43725576070f222a37dbae | e44bd6e8b06ab16b86e48d55f399873bd7f2652f | /Codeforces Round 551/Ques2/main.cpp | a5143534ce6bcb56192f361bef319b5cae7abf3a | [] | no_license | dalip98/Data-Structures-and-Algorithm | a254a91e60f23be462e2d005bd13725fb0e50ad9 | d4977a1fdac9606ea820dd2e69915fca77a6d133 | refs/heads/master | 2021-06-29T05:28:57.811883 | 2020-10-21T13:37:08 | 2020-10-21T13:37:08 | 179,121,547 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 724 | cpp | main.cpp | #include <bits/stdc++.h>
#include<algorithm>
#include<vector>
#define ll long long int
#define mod 1000000007
using namespace std;
int main()
{
ios::sync_with_stdio(0);
ll n,m,h; cin>>n>>m>>h;
vector<ll>fnt(m);
for(ll i=0;i<m;i++)
cin>>fnt[i];
vector<ll>side(n);
for(ll i=0;i<n;i++)
... |
5826a4eb334357332cede904a36ec456116e4cc4 | 5cad367b7a34f124a766cd075a183b44415bb3ee | /JUNGOL/나는 학급회장이다/main.cpp | d76f9465e4a9fe73bd59b537159f260be2891b8e | [] | no_license | Rkda8071/PS | f8078744397c58380755a5ad3cd238e484068b7a | fbf1cacf8851e100a3c6edc335db77172a24f3db | refs/heads/master | 2023-01-12T17:55:30.313774 | 2022-12-24T12:38:39 | 2022-12-24T12:38:39 | 237,006,211 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 555 | cpp | main.cpp | #include<bits/stdc++.h>
using namespace std;
int a[4][4];
int cmp(int x,int y){
for(int i=0;i<=3;i++){
if(a[x][i]>a[y][i]) return x;
else if(a[x][i]<a[y][i]) return y;
}
return 0;
}
int main(){
int n;
int x,y,z;
scanf("%d",&n);
for(int i=0;i<n;i++) {
for(int j=1;j<=3;... |
f903b0837fe8f01e88c4ea0053bc0dce06944839 | 6e2dd4cb04f2ae7b3ad189ddb0be9e22df6b5649 | /B4/B4c/include/CalcAngularRes.hh | 9b9207d10e9d3291f4f88082c147c9fcaaf5aba4 | [] | no_license | emberger/FwEcalAirGap | ecdb0bf1d30edb230f376183fea1bc0c29b780ce | bed340163ab977bcbb4215e2209d3bf39c231376 | refs/heads/master | 2021-05-14T07:49:03.366597 | 2018-01-09T12:27:04 | 2018-01-09T12:27:04 | 116,277,781 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,424 | hh | CalcAngularRes.hh |
#include "B4ROOTEvent.hh"
#include "TTree.h"
#include "TChain.h"
#include "TCanvas.h"
#include "TGraph.h"
#include "TGraphErrors.h"
#include "TH1D.h"
#include "TH2D.h"
#include "TLine.h"
#include "TBrowser.h"
#include "TColor.h"
#include "TH3D.h"
#include "TStyle.h"
#include "TColor.h"
#include "TGraph2D.h"
#include ... |
d246d91173117921987881330e4f62d5e298e2b2 | 84543cb24f6d641f98a28e6970ab63ea2fad4442 | /src/blizzard/pool.hpp | c1fa19b36db2859b093b28edc5f22bebbc00cc13 | [] | no_license | bachan/blizzard | 4731cbb653ac94e6aed4a534761e2ea0c86f747d | b29b51fa970a4c005a4e1c8e2d2b313b3de0a3dc | refs/heads/master | 2021-12-01T01:18:23.872440 | 2021-11-09T18:41:58 | 2021-11-09T18:50:12 | 2,143,009 | 10 | 5 | null | 2013-12-02T03:49:54 | 2011-08-02T14:39:04 | C++ | UTF-8 | C++ | false | false | 806 | hpp | pool.hpp | #ifndef __BLIZZARD_POOL_HPP__
#define __BLIZZARD_POOL_HPP__
#include <sys/types.h>
#include "pool_stack.hpp"
namespace pool_ns {
/* Memory allocator for fixed size structures */
template <typename T, int objects_per_page = 65536>
class pool
{
protected:
struct page
{
page* next;
T* data;
T... |
505625c143d09ba4ac39acbb79dd05b57010c7f6 | 5a34d529bd017e455fd113aa3ad612fbc982abd7 | /src/ZGZ_IoT.cpp | 9ee7aaad7946ffa8d77c45fe984afc62d791e5bc | [] | no_license | Timearchitect/ZGZ-IoT | 92d6c264ae9e710d6aa1ba84111bd5eb9d919126 | 782507d50eb32d791a6c9849b1377426c337f30c | refs/heads/master | 2020-05-29T09:52:40.105090 | 2015-06-10T12:55:33 | 2015-06-10T12:55:33 | 37,070,368 | 0 | 0 | null | 2015-06-08T14:02:18 | 2015-06-08T14:02:18 | Arduino | UTF-8 | C++ | false | false | 143 | cpp | ZGZ_IoT.cpp | #include "ZGZ_IoT.h"
String urlEncode(String s) {
for (int i = 0; i < s.length(); i++) {
if (s[i] == ' ') s[i] = '+';
}
return s;
}
|
9dbed55f4c316b24b9ed39fe24b60417c36b4d56 | c85134084b4015c63ee2557f4f711be512ac14a1 | /serverlibrary/src/main/cpp/mmap_util.h | 70d61bcdc868f82e15d2878ba39c79242e4b465f | [] | no_license | foryoung2018/PerformanceVideoCached | 9d4b93477250b674c5a131dba7494ecb6d6d4dc9 | c3239651973708c5003dbedc96b237d238da11f8 | refs/heads/master | 2021-02-13T02:46:17.459048 | 2020-10-28T17:29:29 | 2020-10-28T17:29:29 | 244,653,656 | 16 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 973 | h | mmap_util.h | //
// Created by foryoung on 2020/3/7.
//
#ifndef PERFORMANCEVIDEOCACHED_MMAP_UTIL_H
#define PERFORMANCEVIDEOCACHED_MMAP_UTIL_H
#include <stdio.h>
#include <fcntl.h>
#include <sys/mman.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <strings.h>
#include <android/log.h>
#include <string>
#include <stdio.h>
#i... |
37a18c951bb40d0e84d972d307c71da80a9c1e8f | d1e2d8db59d1a349562f96704ae049c777304311 | /src/engine_v0_2/src/ConstantSpeedRotation.cpp | 303bc2c489930f0ea06080df8d22756234f360bf | [] | no_license | minimaxwell/gameengine | d9d1780f3acdd4ef4d54bd246eb538c22ff96eba | eaec367194e9b4c5262114e4c21f8bc3f83faa37 | refs/heads/master | 2016-09-02T06:01:51.021281 | 2014-10-11T19:36:29 | 2014-10-11T19:36:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 569 | cpp | ConstantSpeedRotation.cpp | /*
* File: ConstantSpeedRotation.cpp
* Author: maxwell
*
* Created on 19 avril 2014, 18:07
*/
#include "ConstantSpeedRotation.h"
using namespace ge;
ConstantSpeedRotation::ConstantSpeedRotation( double angularSpeed ) : Rotation(), m_angularSpeed(angularSpeed) {
}
ConstantSpeedRotation::~ConstantSpeedRotati... |
d2db57a83b4e327972e3a8752b0b79a7a3a1d87d | 4bcc9806152542ab43fc2cf47c499424f200896c | /tensorflow/core/tfrt/mlrt/bytecode/executable.h | 2f6f9c0edea8aa29addb9c5c228fcff1142612be | [
"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 | 3,222 | h | executable.h | /* Copyright 2021 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... |
9ccf2384119a972e6f116ac9f360939f4aaac444 | db4ccd7115d180dee37b5e953aa065e48f8f68e6 | /node.cpp | ff88feb63be7393a372a79fb121361341dce26f3 | [] | no_license | scast/ci5437 | 53757dd9f6cc2d01875d7536a6abc49ba21e635c | 2bf645f37fdfe6a74328f50f4634b49be48759f4 | refs/heads/master | 2016-09-03T07:22:58.085361 | 2012-10-24T02:05:06 | 2012-10-24T02:05:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,635 | cpp | node.cpp | #include "node.hpp"
#include "clique.hpp"
#include "cstring"
/*
* Constructor de un nuevo nodo.
*/
node::node(state& _state, node *_parent, int _costo, int _action) :
s(_state), parent(_parent), cost(_costo), action(_action) {
#ifndef STATIC
h = find_disjoint_cliques_upto(g, s, N, MAX_GRADE);
#else
int t... |
e13664c66685cc69f3e82f36ad0a10b268a08503 | 4b76fa0a4f2001f10f2098f598c69eccae82a7e3 | /Graph Data Structure & Algorithms/Snake Ladder Problem!.cpp | 77d05dc71a8d7f1849c8fa68dac8bd529e890b36 | [] | no_license | KushRohra/InterviewBit_Codes | cb87b2485c3d63f41f3da22bc03e895be4cd5d05 | bd4aed23788ea800a08bb4a91e34c5b631ef763e | refs/heads/master | 2023-02-10T16:01:28.218120 | 2021-01-11T17:51:28 | 2021-01-11T17:51:28 | 328,747,526 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,133 | cpp | Snake Ladder Problem!.cpp | int Solution::snakeLadder(vector<vector<int> > &A, vector<vector<int> > &B)
{
int i, j, pos, n=10;
unordered_map<int, int> snake, ladder;
int ans=INT_MAX;
for(i=0;i<A.size();i++)
ladder[A[i][0]]=A[i][1];
for(i=0;i<B.size();i++)
snake[B[i][0]]=B[i][1];
queue<pair<int, int>> q;
... |
988975c74ec082af66a23161cdb4617bd29ba1ac | 5cef19f12d46cafa243b087fe8d8aeae07386914 | /codeforces/hello2019/f.cpp | 9db1c0525e5d2059ebada4622c83f61da3e1e350 | [] | no_license | lych4o/competitive-programming | aaa6e1d3f7ae052cba193c5377f27470ed16208f | c5f4b98225a934f3bd3f76cbdd2184f574fe3113 | refs/heads/master | 2020-03-28T15:48:26.134836 | 2019-05-29T13:44:39 | 2019-05-29T13:44:39 | 148,627,900 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,532 | cpp | f.cpp | #include<bits/stdc++.h>
#define sc(x) scanf("%d",&x)
#define sll(x) scanf("%I64d",&x)
#define F first
#define S second
#define mk make_pair
#define ALL(x) x.begin(),x.end()
#define maxn 8
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
const LL mod = 1e9+7;
const int maxm = 1e... |
670e1efa8eecb11e419abb968cf8b6db574acf27 | 3b1d92de37ac8f555279386a5722c508cb38dac7 | /WeeklyProjects/wa11/avlSort.cpp | bb0f4419444fa729a9208b40ffb06823c9851a0c | [] | no_license | jrross/csc300-data-structures | e0c701356439c54565c7aff4c239de4ca7ec176c | 49ba2e3492b98030d51965175babfb90ae91dba1 | refs/heads/master | 2020-04-19T07:44:42.248095 | 2019-01-29T00:11:50 | 2019-01-29T00:11:50 | 168,056,104 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,318 | cpp | avlSort.cpp | #include "avlSort.h"
AVLSort::AVLSort(std::string n) : Sort(n, false) {
root = nullptr;
}
AVLSort::AVLSort(std::string n, std::vector<int> v) : Sort(n, false, v) {
root = nullptr;
}
// You need to implement the sort method for AVLSort. See the InsertSort
// implementation for an example
void AVLSort::sort()
{
f... |
3cac6ab0165b41f8d6d7f1a0ea2d690f9796f829 | b91dbdb3d19021318cbd831f4ec46d37ac770ae8 | /kmcrypto/ikmcrypto.h | ee3c57c1ca7b3ed48d5ef0b8294fb02ea8a74ad8 | [
"MIT"
] | permissive | matteofumagalli1275/kmsecure | ff714b9f2c404701ddb2c3445f4abcecd4fbf735 | 8f86d252e23f5100e17766ea75f516c48ca8b9a5 | refs/heads/master | 2021-06-17T04:21:21.734031 | 2017-06-05T18:17:31 | 2017-06-05T18:17:31 | 45,756,135 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 678 | h | ikmcrypto.h | #ifndef IKMCRYPTO_H
#define IKMCRYPTO_H
#include <stdint.h>
#include <cstddef>
#include <vector>
#include <string>
#include <exception>
#include <stdexcept>
class ikmcrypto {
public:
virtual void set_key(const char *key, size_t byte_length);
virtual void set_key_with_iv(const char *key, size_t byte_length, c... |
85319e32b6cde5d5b4a8bdb0893e24a62e91678a | 13cdba7eabef5c8185f20de5e1e2a108c1825876 | /SWEA/1249.cpp | fa731ca5e07edc86c2d025714658c6dfc5c82df4 | [] | no_license | Hsue66/Algo | 7b43ec88a0fb90c01aa0bca74863daee4689f416 | 4c02a71edaf4ac994520f4ab017cb5f27edaffc2 | refs/heads/master | 2021-07-05T23:23:26.174809 | 2021-05-18T14:08:00 | 2021-05-18T14:08:00 | 43,046,465 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,795 | cpp | 1249.cpp | #include<stdio.h>
#define INF 987654321
#define MAX 90000
int Min,N;
int MAP[100][100],v[100][100];
int dir[4][2] = {{0,1},{0,-1},{1,0},{-1,0}};
struct Node{
int x, y;
};
struct Queue{
int fidx;
int bidx;
Node node[MAX];
void init(){
fidx = bidx = 0;
}
int e... |
0b60db9a7f3343db6e6e8d07ce4e0fc9552b30e2 | a10bdce64752b3723d2c8910d56bcfa20f63080f | /bioblocksTranslation/blocks/logicblocks.h | b8bda2e7fc8c5a04e5c79771a24d268952cdeb91 | [] | no_license | ponxosio/bioblocksTranslation | e53058f5cd28c941ee62eae52e7c3367a591e606 | 710abe68c93f8887f95778edf83525c56e73440a | refs/heads/master | 2020-12-30T17:51:01.827977 | 2017-09-06T10:25:55 | 2017-09-06T10:25:55 | 89,360,551 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,386 | h | logicblocks.h | #ifndef LOGICBLOCKS_H
#define LOGICBLOCKS_H
#define LOGIC_COMPARE_STR "logic_compare"
#define LOGIC_OPERATION_STR "logic_operation"
#define LOGIC_NEGATE_STR "logic_negate"
#define LOGIC_BOOLEAN_STR "logic_boolean"
#define LOGIC_NULL_STR "logic_null"
#define MATH_NUMBER_PROPERTY_STR "math_number_property"
#define BLOC... |
bc997836ab275c7a19d6403f8159cc21a40a91cc | 59047c50edad6f42ba3312c5e3f92a66d57afd0d | /src/add-ons/kernel/file_systems/packagefs/package/PackageLeafNode.cpp | 2c27f45e9921d7e87fd2749de329d2794d443427 | [
"BSD-2-Clause"
] | permissive | stasinek/BEFS-Explorer | b3d47954d8589e69d17502fdebe0f7f1adf9f161 | fa36e7745d3bbf51184122dfc25e411a933af539 | refs/heads/master | 2023-05-24T23:45:40.826752 | 2023-05-15T12:54:11 | 2023-05-15T12:54:11 | 79,050,937 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 529 | cpp | PackageLeafNode.cpp | /*
* Copyright 2009, Ingo Weinhold, ingo_weinhold@gmx.de.
* Distributed under the terms of the MIT License.
*/
#include <PackageLeafNode.h>
PackageLeafNode::PackageLeafNode(Package* package, mode_t mode)
:
PackageNode(package, mode)
{
}
PackageLeafNode::~PackageLeafNode()
{
}
String
PackageLeafNode::Symlin... |
3bc56bb89e050805f60d4c04c7801b511ad2e7f9 | bba23e9d20a6ba65b509b0a1196d2e06c6bc75af | /client/Controller/CerebotClient.hpp | 499b95dc62a20693b62287a8c99a5a64ae0c4e95 | [
"LicenseRef-scancode-warranty-disclaimer"
] | no_license | gaybro8777/Pic32Telemetry | 2c54e5a34ee6788f2f480bae3d3527b8962809d3 | 8418a12517e74007777536c97f0a0942c18bbf10 | refs/heads/master | 2023-07-22T02:11:52.209591 | 2016-02-24T18:54:30 | 2016-02-24T18:54:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,475 | hpp | CerebotClient.hpp | #ifndef CEREBOT_CLIENT_H
#define CEREBOT_CLIENT_H
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <termios.h>
#include <stdio.h>
#include <string.h>
#include <thread>
#include <string>
#include <iostream>
#include <vector>
#include "../../my_types.h"
#include "./UiServer.hp... |
09ac08fad32e328984ebb0ea08a636cdee98cc14 | cfeac52f970e8901871bd02d9acb7de66b9fb6b4 | /generated/src/aws-cpp-sdk-s3control/include/aws/s3control/model/SseKmsEncryptedObjects.h | de2a9af03ea965705f0efe9a72cf86e1177774f9 | [
"Apache-2.0",
"MIT",
"JSON"
] | permissive | aws/aws-sdk-cpp | aff116ddf9ca2b41e45c47dba1c2b7754935c585 | 9a7606a6c98e13c759032c2e920c7c64a6a35264 | refs/heads/main | 2023-08-25T11:16:55.982089 | 2023-08-24T18:14:53 | 2023-08-24T18:14:53 | 35,440,404 | 1,681 | 1,133 | Apache-2.0 | 2023-09-12T15:59:33 | 2015-05-11T17:57:32 | null | UTF-8 | C++ | false | false | 3,076 | h | SseKmsEncryptedObjects.h | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#pragma once
#include <aws/s3control/S3Control_EXPORTS.h>
#include <aws/s3control/model/SseKmsEncryptedObjectsStatus.h>
#include <utility>
namespace Aws
{
namespace Utils
{
namespace Xml
{
class Xm... |
359eb68ace7caf6267409f8dd50e5235847ca48e | b819c29719ecb14440dab9d5cbc49d9901fc2d04 | /Client/Header/Shot_WhiteFadeOut.h | 6035b46322d77bf843bf0be4c887ccaa7a847eca | [] | no_license | Underdog-113/3D_portfolio | d338f49d518702b191e590dc22166c9f28c08b14 | 6b877ff5272bea2e6d2a2bd53e63b6ee4728cd9c | refs/heads/develop | 2023-07-07T20:30:00.759582 | 2021-07-27T06:01:52 | 2021-07-27T06:01:52 | 371,051,333 | 0 | 1 | null | 2021-06-13T14:30:32 | 2021-05-26T13:52:07 | C++ | UTF-8 | C++ | false | false | 475 | h | Shot_WhiteFadeOut.h | #pragma once
#include "Shot.h"
class CShot_WhiteFadeOut : public CShot
{
public:
struct Desc
{
Engine::CFadeInOutC* pWhiteFade = nullptr;
};
public:
CShot_WhiteFadeOut();
~CShot_WhiteFadeOut();
public:
void Ready(CTake * pTake, _float startTimeline, _float endTimeline, void* pDesc, _float enterTimeline);
vi... |
afa4b3389d8ecf7a22039a1200c7fc104b2fe316 | b73fbe654a268f39492c5cc3545729b7efdd765e | /array/SpiralMatrixII.h | 38b6c6c8ca8331e5fbc583f1be76e6ff3be4fce8 | [] | no_license | Yory-Z/Algorithm | b33cf31bc1e6f42ba8dea4aa39d4995074c45ee0 | b3450e499d691b30c1229ba3843331a0d0f96f53 | refs/heads/master | 2020-04-25T14:23:54.435127 | 2019-03-22T02:49:05 | 2019-03-22T02:49:05 | 172,840,352 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,371 | h | SpiralMatrixII.h | //
// Created by Yory on 2019/2/22.
//
#ifndef ALGORITHM_SPIRALMATRIXII_H
#define ALGORITHM_SPIRALMATRIXII_H
#include <iostream>
#include <vector>
using namespace std;
class SpiralMatrixII {
public:
void test() {
int n = 5;
vector<vector<int>> res = generateMatrix(n);
for (vector<int> ve... |
84929573978d3f86f559d216e24d615e550f4b5d | 76bb2f1b416d78c2b4c951f071657b93e8f915c1 | /xlib/hall.cpp | 9223a405b4e648ae7d03136a7bdbda1f3ec7f530 | [
"LicenseRef-scancode-unknown-license-reference",
"BSD-2-Clause"
] | permissive | pcxod/olex2 | 2f48c06da586fb47d308defe9915bf63be5c8f4d | 17d2718d09ad61ad961b98e966d981bb50663e3e | refs/heads/master | 2023-08-11T20:01:31.660209 | 2023-07-21T10:55:35 | 2023-07-21T10:55:35 | 219,048,584 | 9 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,362 | cpp | hall.cpp | /******************************************************************************
* Copyright (c) 2004-2011 O. Dolomanov, OlexSys *
* *
* This file is part of the OlexSys Development Framework. ... |
51b2e2b31caba77d6c0710271c74e43a516ee2cc | f981471ebe62731ec6e1ea2c3e09907f49d9d99a | /Engine/Utility/ParameterFile.cpp | d997fa0ac68411beaf7953e5cfb45363a7eed27a | [] | no_license | techmatt/layer-extraction | a784be9681494ed7cc8d648859aea990b9f01200 | 0892665aa33d1fd072ebba01000d5825d1817387 | refs/heads/master | 2021-01-23T09:28:21.183874 | 2017-01-10T19:13:17 | 2017-01-10T19:13:17 | 32,225,935 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,875 | cpp | ParameterFile.cpp | /*
ParameterFile.cpp
Written by Matthew Fisher
the Parameter class loads a paramater file as a simple set of "Parameter=Option" lines.
*/
ParameterFile::ParameterFile(const String &filename)
{
Vector<String> baseDirectories;
AddFile(filename, baseDirectories);
}
void ParameterFile::AddFile(const... |
922347f35dae6cc05725edd5d36f66609ffc67ae | 63c71060f36866bca4ac27304cef6d5755fdc35c | /src/SmartDoc/SdocImport.h | 7de56652b9ad8eff5067ea4c42920295d0c81eb6 | [] | no_license | 15831944/barry_dev | bc8441cbfbd4b62fbb42bee3dcb79ff7f5fcaf8a | d4a83421458aa28ca293caa7a5567433e9358596 | refs/heads/master | 2022-03-24T07:00:26.810732 | 2015-12-22T07:19:58 | 2015-12-22T07:19:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,291 | h | SdocImport.h | ////////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2005
// Packet Engineering, Inc. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification is not permitted unless authorized in writing by a duly
// appointed officer of ... |
496125102b148da07f7a20135e0d1626494f12f5 | 8635e9e8cde70ce1f55aac7b50d8090add38a163 | /Problems/bzoj/2809.cpp | 37414cd9305b93e88f68fd5a9dab71346d5c56c8 | [] | no_license | 99hgz/Algorithms | f0b696f60331ece11e99c93e75eb8a38326ddd96 | a24c22bdee5432925f615aef58949402814473cd | refs/heads/master | 2023-04-14T15:21:58.434225 | 2023-04-03T13:01:04 | 2023-04-03T13:01:04 | 88,978,471 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,966 | cpp | 2809.cpp | #include <cstdio>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef long long ll;
vector<ll> vec[100010];
struct Node
{
ll val, fa, left, right;
} tree[100010];
ll dist[100010];
ll n, m, sj[100010], c[100010], l[100010], cases, x, y, sum[100010], num[100010], ... |
c3d4632badd736712e9f4c4d70d3185eeece7a86 | 343f7c1cb545ee1e24e78d023ad3c13fb7a9db39 | /leetcode/238-Product-of-Array-Except-Self.cpp | debcf3dc79f2b0751da1e9cfa169925e4fdc27ea | [] | no_license | nashirj/interview-prep | 393fe5d6a5bba13db5165639f084e2bdb149665c | 10541a4451eb559fe238010faeab5961bd5fc096 | refs/heads/master | 2022-12-08T01:49:08.042341 | 2020-08-12T19:11:44 | 2020-08-12T19:11:44 | 142,927,025 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,614 | cpp | 238-Product-of-Array-Except-Self.cpp | /**
238. Product of Array Except Self
Medium
4109
355
Add to List
Share
Given an array nums of n integers where n > 1, return an array output such that output[i]
is equal to the product of all the elements of nums except nums[i].
Example:
Input: [1,2,3,4]
Output: [24,12,8,6]
Constraint: It's guaranteed that the... |
7471aa99eb05d35da3ae03ab2d909ba05a89aaee | 86ed1578979219c7e2f8087fb81a658becba4a84 | /problem solving/Game of Thrones - I.cpp | c2d63e0f3440d2fdcdb32e7132e69eb32ff82acd | [] | no_license | aditya-kumar-129/hackerrankproblems | 28818996b05aea745e493559563a8bea7f8382a3 | 4a201dc008b1c906e8d558b78a130f080af937ae | refs/heads/main | 2023-06-30T06:27:55.300542 | 2021-08-11T17:52:38 | 2021-08-11T17:52:38 | 354,424,613 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 320 | cpp | Game of Thrones - I.cpp | #include <iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int ar[26]={0};
for(int i=0;i<s.size();i++)
ar[s[i]-97]++;
int count = 0;
for(int i = 0; i < 26; i++)
if(ar[i]%2 != 0)
count++;
if(count>1)
cout<<"NO";
else
cout<<"YES";
} |
693dc17c539fe709f2bb6ba8ded6eba2d4558204 | 89c44937dcb20d35fce120cfe5848df5f21f12d0 | /o3s/include/types/rotation.hpp | 4931d3811eb8015396b2734b16b2930b02612b65 | [] | no_license | aufheben1/Open3dSLAM | 4fdb8ee6a3c2ac697dba8793c96e483a41f5df64 | d2a21927aa828b87da6c6a5e5db3751b6757618b | refs/heads/master | 2020-05-03T09:34:25.483906 | 2019-04-07T07:02:52 | 2019-04-07T07:05:56 | 178,557,779 | 1 | 0 | null | 2019-04-07T07:05:58 | 2019-03-30T12:48:24 | C++ | UTF-8 | C++ | false | false | 853 | hpp | rotation.hpp | #ifndef _O3S_TYPES_ROTATION_HPP_
#define _O3S_TYPES_ROTATION_HPP_
#include "types/position.hpp"
namespace o3s {
class Rotation {
public:
Rotation();
Rotation(double x, double y, double z, double w);
// Operators
Rotation& operator=(const Rotation& rhs);
Rotation& operator*=(const Rotation& rhs);
const ... |
9ec77185b2624d738171fd0d7320fec0979e960f | bcd3b295451cc6b8f88b6e3ae3f83bd635578164 | /main.cpp | 47f3d0fb4556d0ce2cf81b95eb8bd2130e654a81 | [] | no_license | BenGreenfield825/OOP-Example | 20beae399dfd2ec59c50c6a90742fa34fa853c89 | 3d043e0e01e657d7ed1fc0e6cfe19673f984a1b5 | refs/heads/main | 2023-01-24T18:34:55.040672 | 2020-12-06T22:29:16 | 2020-12-06T22:29:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 114 | cpp | main.cpp | #include "Course.h"
#include "Controller.h"
using namespace std;
int main() {
Controller();
return 0;
}
|
0f31df31ac646e3c36d5a167df9576c4015bc0e1 | d344de8e32f82bc2596a01eac6ca1b109884bd06 | /Competive Programming/coding blocks/CodeChef/alogo.cpp | e457112e87962a4b50120df1c1d274a455efa68d | [] | no_license | vijaygwala/MyCodingStyle- | 214e9149ccbb33b21d2132dd0a7d85272d438f16 | 39d75463ec8af798df7d013efc940de89a447009 | refs/heads/master | 2022-10-06T07:55:46.928080 | 2020-06-05T15:55:31 | 2020-06-05T15:55:31 | 268,440,527 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 536 | cpp | alogo.cpp | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> grades(n);
for(int i=0;i<n;i++)
{
cin>>grades[i];
}
for(int i=0;i<n;i++)
{
int a=grades[i];
int b=grades[i];
if(b>=38)
{
while(true)
{
b=b+1;
if(b%5==0 && b-a<3)
... |
8ef38d8408a969ed8a56bd20eb73fa7aadae853d | 697d8dcb9b39ef858cad57d7eced694590821ded | /WorkingOut.cpp | fd11e9f5aa6b973f08a02d6d8022978e9578e6b4 | [] | no_license | KevinMathewT/Competitive-Programming | e1dcdffd087f8a1d5ca29ae6189ca7fddbdc7754 | e7805fe870ad9051d53cafcba4ce109488bc212d | refs/heads/master | 2022-02-14T09:37:31.637330 | 2020-09-26T16:15:26 | 2020-09-26T16:15:26 | 147,362,660 | 4 | 4 | null | 2022-02-07T11:13:38 | 2018-09-04T14:52:29 | C++ | UTF-8 | C++ | false | false | 1,366 | cpp | WorkingOut.cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Author - Kevin Mathew
// Birla Institute of Technology, Mesra
ll n, m, a[1010][1010], dp1[1010][1010], dp2[1010][1010], dp3[1010][1010], dp4[1010][1010];
void te(){
cin >> n >> m;
for(ll i=1;i<=n;i++)
for(ll j=1;j<=m;j++)
cin >> a[i][j];
... |
5c2bac48730e815178c136673c471954934fef8b | 26faed1887712d4815491eb521758d91c82b72ac | /ext/wxPoint.cpp | 1165094d51be1ff5c305627cc42812818d988f3c | [] | no_license | rinkevichjm/rwx | eb6dcdd62caf97bc3dc2fb203d2346438d28f059 | 314805fa548394ea9200b4c0dd4f8fe33dd48595 | refs/heads/master | 2021-01-25T02:29:26.861483 | 2015-06-03T06:42:53 | 2015-06-03T06:42:53 | 22,302,293 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,616 | cpp | wxPoint.cpp | /*
* wxRealPoint.cpp
*
* Created on: 21.04.2012
* Author: hanmac
*/
#include "wxPoint.hpp"
VALUE rb_cwxPoint;
ID rwxID_x,rwxID_y;
#define _self unwrap<wxRealPoint*>(self)
template <>
VALUE wrap< wxRealPoint >(wxRealPoint *point )
{
return wrapTypedPtr(point, rb_cwxPoint);
}
template <>
VALUE wrap< wxP... |
a2eb4abdaf39a8438fe224c907c83fc6a36b9a94 | 210c3400dd6718ad004e02df294cc9034ddb8a9d | /src/compass.cpp | 9150ed9248df1850181defff2d2a1d1112d43eff | [] | no_license | tanmaysinha18/OpenGL-Flight-SImulator | b3d8e32b9322375cb321ebe32f15aa3ae4d7845c | fc8f67bc22c71cf32c2bbfc9247b47da19920a1a | refs/heads/master | 2023-08-07T11:02:11.715741 | 2020-03-25T22:31:58 | 2020-03-25T22:31:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 787 | cpp | compass.cpp | #include "compass.h"
Compass::Compass(float x,float y,float z) {
this->position = glm::vec3(x,y,z);
GLfloat compass_buffer_data[] = {
0,0,0,
-0.5,0,-3,
0.5,0,-3,
};
this->compass = create3DObject(GL_TRIANGLES,1*3,compass_buffer_data,(color_t){255,0,0},GL_FILL);
}
void Compass::draw(glm::mat4 VP,... |
24d3fb447f46022b551c3bf930c3444ec40de70d | 5521a03064928d63cc199e8034e4ea76264f76da | /fboss/thrift_cow/visitors/tests/DeltaVisitorTests.cpp | 430a927e94de5ca098dfb68abe6341732d5db531 | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | facebook/fboss | df190fd304e0bf5bfe4b00af29f36b55fa00efad | 81e02db57903b4369200eec7ef22d882da93c311 | refs/heads/main | 2023-09-01T18:21:22.565059 | 2023-09-01T15:53:39 | 2023-09-01T15:53:39 | 31,927,407 | 925 | 353 | NOASSERTION | 2023-09-14T05:44:49 | 2015-03-09T23:04:15 | C++ | UTF-8 | C++ | false | false | 25,896 | cpp | DeltaVisitorTests.cpp | // (c) Facebook, Inc. and its affiliates. Confidential and proprietary.
#include <folly/String.h>
#include <folly/dynamic.h>
#include <folly/logging/xlog.h>
#include <gmock/gmock.h>
#include <gtest/gtest.h>
#include <fboss/thrift_cow/visitors/DeltaVisitor.h>
#include <thrift/lib/cpp2/reflection/folly_dynamic.h>
#incl... |
e5d73d1168a22852c7a34298fe42295c0989f7d4 | 1c33b6fd7fbf966a961ccd679ad2ba344f2fc05f | /2018/Number chain.cpp | 3de45f17163ded88e9b239b5cc0cdd5d54207300 | [] | no_license | zim2510/Online-Judge-Solves | f57170e5bf14f339944079ed62bed01bdc5b27e3 | 949ab3cfba0cc7ec4ffaa6f2b3e5b0c517d9377a | refs/heads/master | 2022-01-07T10:23:12.653572 | 2019-05-19T11:30:58 | 2019-05-19T11:30:58 | 135,351,009 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,227 | cpp | Number chain.cpp | #include <bits/stdc++.h>
#define Read() freopen("in.txt", "r", stdin)
#define Write() freopen("out.txt", "w", stdout)
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define TC(i, a, b) for(int i = a; i<=b; i++)
#define FOR(i, a, b) for(int i = a;... |
33fac2cf9738e7d1cace1508e063443cd0d27022 | b9331609646b216bfbd7df3f5b319e29d17801da | /serverAsync/server_async_one.cpp | 199f2bf4b33d22e780b3bd7704abe5d52e3eb52e | [] | no_license | clzhan/boostStudy | f196012c4a309d11cdec939f722c4d715e8d2ed3 | e57707833a67560d6fc9e2d7955d28ee195b718c | refs/heads/master | 2020-05-14T23:13:29.343764 | 2019-04-24T01:32:31 | 2019-04-24T01:32:31 | 181,993,041 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,370 | cpp | server_async_one.cpp |
#include <stdio.h>
#include "boost/asio.hpp"
#include <iostream>
#include <memory>
using boost::asio::ip::tcp;
class Connection: public std::enable_shared_from_this<Connection>
{
public:
Connection(boost::asio::io_service & service)
: socket(service)
{
}
~Connection()
{
p... |
329f687026af89b840f3a1696614f0088ae35be8 | 6f6709e98b12d9cb4b2dd725c22309aabff152ba | /blackJack.cpp | 9503f6400a59e7ed41c79bf53d1603ef7bc44a03 | [] | no_license | jonathanrgoh/Personal-Projects | e466e48a42a3429383a49b0b99d3864619dcde03 | 1edc316767281cd625d90e0c6b3671ba50d72e50 | refs/heads/master | 2020-11-30T11:43:26.004287 | 2020-08-23T17:53:59 | 2020-08-23T17:53:59 | 230,389,513 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,771 | cpp | blackJack.cpp | #include <iostream>
#include <ctime>
#include <cstdlib>
#include <string>
#include <time.h>
#include <windows.h>
using namespace std;
class Card
{
private:
string suit;
int value;
string face;
public:
Card()
{
}
Card(int v, string s)
{
... |
4f19f8192cdc911cd6cbe12b9803cd4fbaec260e | 5ad79fabc6b25bc380d6202fec094a1b69e5f5e6 | /src/cool-lex.h | 09a0a91b5db864b1958519e98a0b3c6a376e77d4 | [] | no_license | uganh/cool | 52c79f6d92686433d738d015f5b80e458dca6832 | 185cf3d0859417d803a3d7067074bd9a86a1152f | refs/heads/master | 2023-05-28T06:48:59.593377 | 2023-05-16T14:19:01 | 2023-05-16T14:19:01 | 340,672,120 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 615 | h | cool-lex.h | #pragma once
#include "cool-parse.gen.h"
#include <istream>
#include <iterator>
#include <string>
class LexState {
std::string yybuf;
const char *YYCURSOR, *YYLIMIT;
unsigned int curr_lineno;
public:
explicit LexState(std::istream &stream)
: yybuf(std::istreambuf_iterator<char>(stream), std::istreambuf_... |
5a2aa0b5a909bbec3d503cd75c02bcdb4c2af9fc | 7b1b9cff50f7afed4d1f15633f958884935b8e12 | /02-Bubble/GUI.cpp | d6951e1a7325e64f050da3117cd8fbba0cf837fc | [] | no_license | pabloiniesta/VJ | ff9097667e762a978e8036ce101f00fe97e435eb | e97d77933feab243ff9724715c454d247d9c0cc5 | refs/heads/master | 2023-01-27T11:50:07.935408 | 2020-12-15T21:18:40 | 2020-12-15T21:18:40 | 304,389,155 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,647 | cpp | GUI.cpp | #include "GUI.h"
#include "Constants.h"
#include <glm/gtc/matrix_transform.hpp>
#include <GL/glew.h>
#include <GL/gl.h>
#include <iostream>
#include <GL/glut.h>
#include <string>
#include <ft2build.h>
#include FT_FREETYPE_H
#include <iostream>
using namespace std;
GUI::GUI()
{
}
void GUI::init() {
//Shader
initS... |
ea69e99c511609cbaf61fba3e6b4edc73f789876 | 913f9a9ed223740923a87a57eb05ed1d5a83dfea | /IntroToArduino/3.1.3/controlContador/controlContador.ino | 9f6fc0bc2a355634c0f113f5b502cc09010779b8 | [] | no_license | tabris2015/Elemental | e40fdf238d6b88aaf388f70beba4f6bba4b4de81 | 3672cc17d0578e755d8811c33a05a1bd9057afe8 | refs/heads/master | 2020-04-06T03:33:57.465464 | 2016-11-07T16:35:38 | 2016-11-07T16:35:38 | 57,926,750 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,197 | ino | controlContador.ino | #define LED_PIN 13
#define IN1 5
#define IN2 4
#define BOTON_PIN 12
int estado;
int estado_ant;
int modo = 0;
int contador = 0;
void setup()
{
pinMode(LED_PIN, OUTPUT);
pinMode(BOTON_PIN, INPUT_PULLUP);
pinMode(IN1, OUTPUT);
pinMode(IN2, OUTPUT);
Serial.begin(9600);
}
void loop()
{
estado = digitalRead(BOTON_PIN)... |
12bc65f47f4a7ef4aca462b3232312f864d88be4 | c20d422cfc6f969b2dbefe670781aa94bd6474c3 | /oomact/src/model/FrameGraphModel.cpp | 2cb98ef5b43f21e060d01e35c9fb449c6f369408 | [
"BSD-2-Clause",
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | liuwenhaha/oomact | 4ea0a82aa28ba73cf16bbb6f9de97302963f29c0 | b157a1a3338358afb52a8754a9e9a38b35401894 | refs/heads/master | 2020-04-27T17:05:04.084384 | 2019-03-01T15:12:58 | 2019-03-01T15:12:58 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,627 | cpp | FrameGraphModel.cpp | #include <aslam/calibration/model/FrameGraphModel.h>
#include <aslam/backend/KinematicChain.hpp>
#include <aslam/backend/Vector2RotationQuaternionExpressionAdapter.hpp>
#include <aslam/calibration/model/fragments/So3R3Trajectory.h>
#include <aslam/calibration/model/Model.h>
#include <glog/logging.h>
#include <aslam/c... |
ba9c990e427f2c82a619b4fdfe2f63acb1fa841d | 425963de819e446a75441ff901adbfe5f1c5dea6 | /content/renderer/media/stream/media_stream_audio_processor_unittest.cc | 662e3b19cec275657d2991ae1eb105a2beb74d3a | [
"BSD-3-Clause"
] | permissive | Igalia/chromium | 06590680bcc074cf191979c496d84888dbb54df6 | 261db3a6f6a490742786cf841afa92e02a53b33f | refs/heads/ozone-wayland-dev | 2022-12-06T16:31:09.335901 | 2019-12-06T21:11:21 | 2019-12-06T21:11:21 | 85,595,633 | 123 | 25 | NOASSERTION | 2019-02-05T08:04:47 | 2017-03-20T15:45:36 | null | UTF-8 | C++ | false | false | 18,895 | cc | media_stream_audio_processor_unittest.cc | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <stddef.h>
#include <stdint.h>
#include <string>
#include <vector>
#include "base/files/file_path.h"
#include "base/files/file_util.h"
#include... |
20e7c496891915be8da9ce6d1dc328bcc9dd8024 | a0bc9908be9d42d58af7a1a8f8398c2f7dcfa561 | /SlonEngine/src/Physics/Constraint.cpp | ad8027fc6ae297f0a84cc48064f978b89160e43e | [] | no_license | BackupTheBerlios/slon | e0ca1137a84e8415798b5323bc7fd8f71fe1a9c6 | dc10b00c8499b5b3966492e3d2260fa658fee2f3 | refs/heads/master | 2016-08-05T09:45:23.467442 | 2011-10-28T16:19:31 | 2011-10-28T16:19:31 | 39,895,039 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,788 | cpp | Constraint.cpp | #include "stdafx.h"
#include "Database/Archive.h"
#include "Physics/Constraint.h"
#include "Physics/DynamicsWorld.h"
#include "Physics/RigidBody.h"
#include "Physics/ServoMotor.h"
#include "Physics/VelocityMotor.h"
#ifdef SLON_ENGINE_USE_BULLET
# include "Physics/Bullet/BulletConstraint.h"
#endif
namespace ... |
91a9f8906d45a6bbf7c419d439c1dd03257ac950 | 2757bb1c7fd14f5286757a5c247a41e537e914b6 | /USACO/rectbarn.cpp | 1e7343c41b483d1b4c6cdd22295cb7b0b4accbd6 | [] | no_license | ErickLin/competitive-programming | ad71814b9dd82062009df9c59f7462ee3c074837 | bca3e39c33e65f6fbfc3c297dc980bbaeae30291 | refs/heads/master | 2021-01-17T08:44:16.787115 | 2018-04-17T16:13:23 | 2018-04-17T18:56:20 | 39,700,329 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,952 | cpp | rectbarn.cpp | /*
ID: Jugglebrosjr2
LANG: C++
TASK: rectbarn
*/
#include <algorithm>
#include <fstream>
#include <iostream>
#include <set>
#include <stack>
#include <vector>
using namespace std;
struct cmp {
bool operator()(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second == b.second) {
return... |
800808410029763236ad64f1d6e544d8b0bebc69 | 9d91c336fe94fb0b78b66eda1d8704906ac40893 | /DetectFaces/JsonWriter.cpp | d0fbd1d1a89bede58e0029f31b881ece3b8021c3 | [] | no_license | AlexeiOgurtsov/Test | cc03e1648a4e718d6cc8c5a1e410cdb37c8e2dfc | bed47bc87581c4d2546797c854234a5e8ae95708 | refs/heads/master | 2020-03-26T13:52:05.210998 | 2018-08-16T14:11:17 | 2018-08-16T14:11:17 | 142,784,172 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,425 | cpp | JsonWriter.cpp | #include <filesystem>
#include "JsonWriter.h"
#include "Face.h"
using namespace std;
using namespace cv;
using namespace boost;
using namespace boost::property_tree;
using namespace std::filesystem;
JsonWriter::JsonWriter()
{
}
ptree JsonWriter::makeCoordinatesRoot(Face face)
{
ptree root, child;
vector<Point> vec... |
f5d30a6fdee2eacd3e67ab4ed28f0b42175de51a | a8b819ee884e173d92fd48e89f625ae6423f522c | /clases/clase23/entradasalida03.cpp | b45fa7295709f5023e87f5dff646aad07e3da71a | [] | no_license | lmvasquezg/Programming-Languages | 4c495a18648a004dd44351e3f1e1c8d6e6b1e37c | e8624ad3dadaa8e2d4bada816dd4ace28fda7916 | refs/heads/master | 2022-04-15T21:16:07.660114 | 2020-04-09T23:53:05 | 2020-04-09T23:53:05 | 192,031,654 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 423 | cpp | entradasalida03.cpp | /*
* fichero: entradasalida03.cpp
*
* proposito: Mostrar el formato de entrada y salida en C++
*
* compile: $ g++ -o entradasalida03 entradasalida03.cpp
* $ make entradasalida03
*/
#include <iostream>
#include <cstdlib>
using namespace std;
int
main(void) {
int i;
float j;
cin >> i >> j;
i ... |
d3a36e739b401d3fc43a3990b56265aa18bb138a | 11e9fdc832e174c35ee9f678890b319526e506c6 | /visualpower/FileV30.cpp | 5b930237ce11308e15e441812dacd83826691db9 | [] | no_license | wangdi190/ChengGong | 96a5c9073f8b269cebbdf02e09df2687a40d5cce | ae03dc97c98f5dc7fbdd75a8ba5869f423b83a48 | refs/heads/master | 2020-05-29T09:16:20.922613 | 2016-09-28T08:13:13 | 2016-09-28T08:13:13 | 69,441,767 | 4 | 2 | null | null | null | null | GB18030 | C++ | false | false | 73,543 | cpp | FileV30.cpp | // FileV30.cpp: implementation of the FileV30 class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "FileV30.h"
#include "DObj.h"
#include "bclass.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
///////////////... |
7a74fb1d3d2daf2ed12e2f1b1420363d573b9d61 | 0f55e487db3da823ae18f00e9d049bb0a82e32e0 | /WorkSpace/GameLibInclude/glMemoryHelper.h | e6dc8b052d9ab330139b751462bb14031260b52b | [] | no_license | RiverUp2012/Cat | d64dd9995922c904ce10bcb9e9ddab89e8a0aae5 | 29bdaaa352c659580751e8779875aa2f51f3ee87 | refs/heads/master | 2020-07-16T23:27:01.862743 | 2019-09-22T16:07:55 | 2019-09-22T16:07:55 | 205,890,421 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 217 | h | glMemoryHelper.h |
#pragma once
class glMemoryHelper {
public:
static void xor(unsigned char * buffer, const int bytesToProcess);
static void xor(unsigned char * buffer, const int bytesToProcess, const unsigned char factorChar);
};
|
96ee5ad93556ac9870ffa44856e2bb6ddc433592 | 11dc889c688e49b25972389a18614618b9480024 | /paddle/platform/dynload/curand.cc | 5c1fab992c98569d4a95b6e699d97d428511e48e | [
"Apache-2.0"
] | permissive | tangxiangru/Paddle | 632f41c81de1383e17510f141b36fd872001c973 | 2200ff5e3c8322b405395995bd6476058df0e8fb | refs/heads/develop | 2021-01-01T19:12:31.720146 | 2017-07-27T08:06:28 | 2017-07-27T08:06:28 | 98,535,637 | 1 | 0 | null | 2017-07-27T12:55:01 | 2017-07-27T12:55:01 | null | UTF-8 | C++ | false | false | 262 | cc | curand.cc | #include <paddle/platform/dynload/curand.h>
namespace paddle {
namespace platform {
namespace dynload {
std::once_flag curand_dso_flag;
void *curand_dso_handle;
#define DEFINE_WRAP(__name) DynLoad__##__name __name
CURAND_RAND_ROUTINE_EACH(DEFINE_WRAP);
}
}
} |
887c1eb56cb82501ea5038f312f34ab64b3ce481 | 7f62f204ffde7fed9c1cb69e2bd44de9203f14c8 | /DboClient/Lib/NtlGui/gui_effect_path_chase.cpp | f044c390bbf0ff74867583dfdaf1877092a29fb2 | [] | no_license | 4l3dx/DBOGLOBAL | 9853c49f19882d3de10b5ca849ba53b44ab81a0c | c5828b24e99c649ae6a2953471ae57a653395ca2 | refs/heads/master | 2022-05-28T08:57:10.293378 | 2020-05-01T00:41:08 | 2020-05-01T00:41:08 | 259,094,679 | 3 | 3 | null | 2020-04-29T17:06:22 | 2020-04-26T17:43:08 | null | ISO-8859-7 | C++ | false | false | 7,904 | cpp | gui_effect_path_chase.cpp | #include "gui_precomp.h"
/*
#include "gui_effect_path_chase.h"
#include "gui_renderer.h"
#include "GuiUtil.h"
START_GUI
GUI_DEFINITION_MEMORY_POOL( CPathInfo_Pos )
GUI_DEFINITION_MEMORY_POOL( CPathInfo_PosAlpha )
GUI_DEFINITION_MEMORY_POOL( CPathParticle )
///////////////////////////////////////////////////////////... |
6601b5e50f5d596a16671e51624d89d294c754fd | a3d6556180e74af7b555f8d47d3fea55b94bcbda | /third_party/protobuf/src/google/protobuf/reflection_ops_unittest.cc | 0ae697428f0dfae6ff0b9bee765cc3e489177a87 | [
"GPL-1.0-or-later",
"MIT",
"LGPL-2.0-or-later",
"Apache-2.0",
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-protobuf"
] | permissive | chromium/chromium | aaa9eda10115b50b0616d2f1aed5ef35d1d779d6 | a401d6cf4f7bf0e2d2e964c512ebb923c3d8832c | refs/heads/main | 2023-08-24T00:35:12.585945 | 2023-08-23T22:01:11 | 2023-08-23T22:01:11 | 120,360,765 | 17,408 | 7,102 | BSD-3-Clause | 2023-09-10T23:44:27 | 2018-02-05T20:55:32 | null | UTF-8 | C++ | false | false | 20,290 | cc | reflection_ops_unittest.cc | // Protocol Buffers - Google's data interchange format
// Copyright 2008 Google Inc. All rights reserved.
// https://developers.google.com/protocol-buffers/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// ... |
a5e1cc0c37d2c448a08341ec35c8b7ec12ec3a22 | 213b6b25c8606491e822b29f43e06305852c9e1a | /src/pipe.h | 1ce0519d82edf86b2c080cd2da6222abe5a4a612 | [] | no_license | NormenL/Hyperion | 112f9eea8b93fcf2298047d7417d857566e0339e | f820a52266f9156fbf1976b0e4324e67d4d0b4e1 | refs/heads/master | 2023-03-11T17:31:10.499468 | 2021-02-22T14:06:36 | 2021-02-22T14:06:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,184 | h | pipe.h | #pragma once
#include <inttypes.h>
#include "inputs/input.h"
#include "outputs/output.h"
#include "luts/lut.h"
using HandlerFunc = int (*)(uint8_t *data, int length, Output *out, LUT *lut);
const int MTU = 3100;
uint8_t data[MTU]; //i used to malloc this, but the MTU is 1500, so i just set it to the upped bound
//P... |
42f12aa3b89b81c45cb07527c277b190d6ab60be | 9a661069c8ec79402747d44e18cf7aec80ed453a | /heart/test/monodomain/TestMonodomainProblem.hpp | e1db705f435cf29e06a89d9e4994f6e361fe1bed | [
"BSD-3-Clause"
] | permissive | Chaste/Chaste | 474e589bc49995cd08674e1649c01d99bc920391 | f21282cbe6e3c644cba4c24e7a3fa9d55480d9b2 | refs/heads/develop | 2023-08-16T19:22:40.524860 | 2023-08-16T09:30:04 | 2023-08-16T09:30:04 | 62,891,278 | 116 | 62 | NOASSERTION | 2023-09-14T16:37:19 | 2016-07-08T13:37:56 | C++ | UTF-8 | C++ | false | false | 84,314 | hpp | TestMonodomainProblem.hpp | /*
Copyright (c) 2005-2023, University of Oxford.
All rights reserved.
University of Oxford means the Chancellor, Masters and Scholars of the
University of Oxford, having an administrative office at Wellington
Square, Oxford OX1 2JD, UK.
This file is part of Chaste.
Redistribution and use in source and binary forms... |
b31f4e12d0483f1904700de9ede7a641fd20ae34 | 7e45abc2361dd4cb31474b4442f93aef4b833d8a | /QT/day05/exec03/Test/mainwindow.cpp | e979709770f2df6a07d770a791ac7ee35e3d4724 | [] | no_license | qyqgit/MyDoc | 187da579fc920f9f9e2bd238cfa11387060eeb57 | 92f23732efa2ada09a4311520ebd1c8fd3e86e86 | refs/heads/master | 2020-06-12T05:40:27.691706 | 2019-11-17T08:49:44 | 2019-11-17T08:49:44 | 194,210,236 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 601 | cpp | mainwindow.cpp | #include "mainwindow.h"
#include "ui_mainwindow.h"
#include <QPainter>
#include <QRect>
#include <QDebug>
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow)
{
ui->setupUi(this);
mrc = new MyRect();
clock = startTimer(1000);
}
MainWindow::~MainWindow()
{
delete... |
4a0f61006a720ef12e6e677429276cc0320eaa48 | f2f70ca3e14bf57d9ef2d573ec4c946e4c289724 | /Mainfrm.cpp | 0081fec0b013cd991320ad4ae09f21ce001de3e2 | [] | no_license | KB3NZQ/hexedit4 | a746a46a25537cf88278a5bc863cbeaae2e8b41c | 39d64bf320a7712f7cc275d574598ab0a3f1d1f3 | refs/heads/master | 2021-01-22T13:42:55.317318 | 2014-08-02T16:26:53 | 2014-08-02T16:26:53 | 22,550,304 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 163,736 | cpp | Mainfrm.cpp | // MainFrm.cpp : implementation of the CMainFrame class
//
// Copyright (c) 2011 by Andrew W. Phillips.
//
// This file is distributed under the MIT license, which basically says
// you can do what you want with it but I take no responsibility for bugs.
// See http://www.opensource.org/licenses/mit-license.php for full... |
69acdb7b9a9cd7ca8bb2ce0f54d0f43b4d6d0b70 | f290a5a8ca8d4270ff3532bfd618734799de7dc3 | /Object-Oriented-Programming(C++)/lab_02/mathvector/iterator/Iterator.h | 649f3a380b0a7c67a3ca296112ed1630caef0bd8 | [] | no_license | Sakerini/BMSTU-4th-Sem | a96e7ec4bb8a6dff077a29a303d421a67a066822 | cd4c06101a74b9962d1ec540062a885bbb3840cf | refs/heads/master | 2022-11-05T11:58:04.888557 | 2020-06-18T17:32:58 | 2020-06-18T17:32:58 | 243,088,714 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 771 | h | Iterator.h | #ifndef LAB_02_ITERATOR_H
#define LAB_02_ITERATOR_H
#include <cstddef>
#include "BaseIterator.h"
namespace mathvector {
template <typename T>
class Iterator : public BaseIterator<T> {
public:
Iterator(const Iterator<T> &iter);
Iterator(std::shared_ptr<T> p, size_t pos = 0);
T &ope... |
ad88f81a245eca0d688b9cbd49f8e955139efd29 | 49a6b689080f73a545a36a2b78c4d19f5aa0dc27 | /Huysmans_Marnick_TheLegendOfZelda/Heart.h | bc46a4f697e01536adf58e7d449027ce663d72a4 | [] | no_license | MarnickHuysmans/TheLegendOfZelda | 97da3a83a8c10d7fe08f833241e1b3fa157e2396 | 42de7c18ce84df5e8ee34ce21ee2ab3229ae0a3a | refs/heads/master | 2023-08-29T05:47:43.391276 | 2021-10-11T20:04:12 | 2021-10-11T20:04:12 | 416,044,840 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 597 | h | Heart.h | #pragma once
#include "PickUp.h"
#include "StaticPickUp.h"
class Heart final : public PickUp, public StaticPickUp<Heart>
{
public:
Heart(const Point2f& location);
~Heart() = default;
Heart(const Heart& other) = delete;
Heart(Heart&& other) noexcept = delete;
Heart& operator=(const Heart& other) = delete;
Heart&... |
1d0c9ad938b91bfb10553ba84a0ee747844203ff | 9a3fc0a5abe3bf504a63a643e6501a2f3452ba6d | /tc/testprograms/BusSeating.cpp | 8c435e748d18017fa002ad1541b3c6ea0087e6eb | [] | no_license | rodolfo15625/algorithms | 7034f856487c69553205198700211d7afb885d4c | 9e198ff0c117512373ca2d9d706015009dac1d65 | refs/heads/master | 2021-01-18T08:30:19.777193 | 2014-10-20T13:15:09 | 2014-10-20T13:15:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,462 | cpp | BusSeating.cpp | #include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#define all(v) (v).begin(),... |
0d4520f5cbed3a950eff405c89ea95188a5e40a4 | ecb3f3c056c3c030444d09e5207617bacddffe3f | /Source/HarmonyFrameWork/Graphics/Shader/DirectX/ver.11/Private/SimplePolygon3DShader.cpp | 9ca7b325d142cac5c3efb1f438b8f23d7ce6a61a | [] | no_license | Hondy000/Reso | b5949b16f7803f1bb636d36f792316ef57495063 | fae9ed9041fca671de108d7689b873f581e3dbaf | refs/heads/master | 2020-04-16T23:42:55.168299 | 2016-11-24T02:55:01 | 2016-11-24T02:55:01 | 48,768,394 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,502 | cpp | SimplePolygon3DShader.cpp |
#include "../Public/SimplePolygon3DShader.h"
#include "../../../../RenderDevice/Basic/Public/RendererManager.h"
#include "../../../../VertexLayout/Public/BaseVertexLayout.h"
#include "../../../../RenderObject/Public/BaseRenderMeshObject.h"
#include "../../../../Texture/Public/BaseTexture2D.h"
#include "../../../../Re... |
ddce18e37977ade2d69b2203326d3f058de27720 | 1e60818de59b0b4be8ce5587f911f5244a23096a | /include/dataset.hpp | 9c57ac5269a0d7a32151d4d0d0e65fc6f7cfb711 | [
"MIT"
] | permissive | hantaolii/ClosedMDCOP-Miner | 694363f90569eb100df57316fc09b2c148519359 | d165e70a086a66d5fd6bc3deacabc1d4411e373c | refs/heads/master | 2020-04-08T01:44:50.305495 | 2016-11-15T11:07:28 | 2016-11-15T11:07:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 511 | hpp | dataset.hpp | #ifndef DATASET_HPP
#define DATASET_HPP
#include <fstream>
#include <map>
#include <memory>
#include <set>
#include "object.hpp"
struct Dataset {
std::set<EventType> event_types;
std::set<std::shared_ptr<Object>> objects;
std::map<EventType, std::set<std::shared_ptr<Object>>> objects_by_event_type;
... |
104e798a236ba3231b67b38bee098e24de6c47f5 | b517d05dadbeba3365beb1f1365938b421548a85 | /cpp/sum/sum.hpp | 2f5c83c17e20732afd8afa61c18432ce9c6cc998 | [] | no_license | shayne-fletcher/zen | d893219bf95e562c2a8f7234adc08598086f6498 | 5fefe328e223cf650d39e7d9dc14030544bd621b | refs/heads/master | 2023-07-05T21:36:35.241768 | 2023-06-25T18:15:38 | 2023-06-25T18:15:38 | 4,950,943 | 12 | 6 | null | 2021-07-24T17:59:17 | 2012-07-08T23:30:29 | OCaml | UTF-8 | C++ | false | false | 2,688 | hpp | sum.hpp | #if !defined (SUM_81D195F4_819A_4E24_A6BF_E9630B3495E8_H)
# define SUM_81D195F4_819A_4E24_A6BF_E9630B3495E8_H
# include "recursive_union.hpp"
namespace foo {
namespace detail {
template <std::size_t I, class T, class... Ts>
struct index_of_impl;
template <std::size_t I, class T, class... Ts>
struct index... |
4dcd2196aa7495a747f03f60a743d3c9f6f7543d | a492a87d24dbaaa9b239e98c43b7a70fe6cd95aa | /Graph/Edmond Karp.cpp | c40f594cc8a64c3d1221eaa494de7bcc2df99405 | [] | no_license | nhatlonggunz/Algorithm-And-Data-Structure | 58260e5650b4ffe5d4d16b67642e37ac2b656473 | 65d950ed1f883e3ec0f48a5a92924a4f6c4b718a | refs/heads/master | 2020-04-30T00:31:32.506070 | 2019-04-17T20:06:35 | 2019-04-17T20:06:35 | 176,504,868 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,258 | cpp | Edmond Karp.cpp | #include <vector>
#include <queue>
#include <iostream>
using namespace std;
#define maxN long(1e3) + 3
int n, s, t, mf, c[maxN][maxN], f[maxN][maxN];
vector<int> g[maxN], p;
bool findPath()
{
int u, v;
queue<int> q; q.push(s);
p.assign(n + 1, 0); p[s] = -1;
while(!q.empty())
{
... |
959556067b85359ea5f1afe19e6c1387e9c5c1ac | 1b3d6d58c08af7a7da22f5a1d712deb7fedc74f0 | /Classes/BombOther.h | dc0d4d079e176b41b304556c9d6b65140e104df8 | [] | no_license | Mike430/TGP_Second_Semester | 0f3260d1e5659e99537742e4e55ba66e3e3bd3d1 | 5c9ae305b3601f93566c2afac3190360e8a166fe | refs/heads/master | 2016-08-12T17:00:09.932635 | 2016-04-22T12:16:00 | 2016-04-22T12:16:00 | 49,950,763 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 234 | h | BombOther.h | #pragma once
#include "Ball.h"
class BombOther : public Ball
{
public:
static const int type = 8;
static BombOther* create();
virtual bool init() override;
virtual ~BombOther();
virtual int getType() override { return type; }
}; |
c1c4778cddf93fb316ab253bbe19de33975faa82 | 82b43d49b95d1f934fe901b88fdbf36d4c474412 | /src/graph/A-star.cpp | d9e953820e35d65d473f442ba9acb640b5897a3e | [] | no_license | isabella232/lib-cpp | 977074fbf5e9692ee14f0555258fbdc38b2bb806 | eb360cde5ad3e86a380de5745c7c741cfa165c37 | refs/heads/master | 2022-04-09T06:52:13.549878 | 2020-03-31T04:57:25 | 2020-03-31T04:57:25 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 719 | cpp | A-star.cpp | // @import header
// #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// @@
// @ A-star
// @snippet a_star
const ll inf = 1e18;
// A* {{{
{
using P = tuple< ll, ll, int >;
priority_queue< P, vector< P >, greater< P > > pq;
vector< ll > dist(n, inf);
pq.emplace(0, 0, s);
ll res = inf;
di... |
e52f2ab4ff7e4357046e8d2611c5ffb0a033c8a3 | 1588f7002ebfaceb9c382c73fce67ab435d0e840 | /utils/src/Predictor/CvSVMPredictor.cpp | d212c0d8fcda1966f0c93f3f658a4d96d48b5174 | [] | no_license | akosiorek/Tagger3D | ff04ac94a7f3bc9c0a189cc972e7cd3dcdb900ae | 6459f41517710168080badbfc09e3ea1625c6a09 | refs/heads/master | 2016-09-05T19:47:32.612709 | 2014-10-14T18:46:44 | 2014-10-14T18:46:44 | 12,671,025 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,298 | cpp | CvSVMPredictor.cpp | /*
* CvSVMPredictor.cpp
*
* Created on: Aug 22, 2013
* Author: Adam Kosiorek
* Description: svm predictor implementation
*/
#include "CvSVMPredictor.h"
#include <stdio.h>
#include <assert.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#include <iostream>
#include <fstream>
... |
61df6b20e8708f87b842053cd520c7e6b141fc8f | 399aa1e6ea4b4f356d0bdf4dd97214fe6d8e0a40 | /SomeProblemsOfCpp/defaultParameterInDerived.h | 91cb60baa5c65a6badbe0a7353ed9145d431a61d | [] | no_license | JianNL/cppstudy | 73d9740b04b8bce0e27eb885d60e8ba146763548 | 6fe878a796570f4b01f7ab9943beb3abf5b6e65d | refs/heads/master | 2016-09-06T09:09:27.816614 | 2014-11-12T05:34:33 | 2014-11-12T05:34:33 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 864 | h | defaultParameterInDerived.h | #include <iostream>
using namespace std;
class Base
{
public:
Base()
{}
Base(bool arg)
{
foo();
}
virtual void foo(int i = 42)
{
cout << "base" << i << endl;
}
};
class Derived :public Base
{
public:
Derived(){}
Derived(bool arg) :Base(arg)
{
foo();
}
virtual void foo(int i = 12)
{
cout << "derive... |
cf5f4edce0ac08926d70645b4547ab4eb70e0df7 | 5b6dccde35aaff457a863bc9a528db97e376058d | /src/cpp/SDLDriver.cpp | cd6bc9bfdc24e10940298ada44c1327d2d187e80 | [] | no_license | bigbrett/ENGS65_final_project | 22210d2a2d153310e67a71e43671e19de0b6f929 | 2cbd3003c1bb4a1083e5e06f55dd9f6c4193aa10 | refs/heads/master | 2021-01-22T09:54:51.991976 | 2017-04-08T18:34:57 | 2017-04-08T18:34:57 | 31,999,880 | 0 | 0 | null | 2015-03-12T18:12:45 | 2015-03-11T05:23:08 | C++ | UTF-8 | C++ | false | false | 483 | cpp | SDLDriver.cpp | //
// SDLDriver.cpp
//
// A wrapper class that encapsulates an SDL Graphics Application
//
#include "SDLDriver.h"
using namespace std;
SDLDriver::SDLDriver()
{
// should this be SDL_INIT_VIDEO ?
if (SDL_Init(SDL_INIT_EVERYTHING) != 0)
{
std::cout << "SDL_Init Error: " << SDL_GetError() << std::... |
87870a3f2531195bc1916e90557caee7b9c0f74e | ca17bdf7cf1fc1216701b15fbf070ae2991e91f4 | /3D_Animation_Native/OpenCLInfo.h | e0c127fc34b7ae363f032f34713039aab85a6da1 | [
"BSD-2-Clause"
] | permissive | bene51/3Dscript | f04c0de7288cd2970ad93db7801d968fa2a6d3e6 | 7633b956bfbed07af72eaae23f1fc5834e318089 | refs/heads/master | 2023-03-17T18:19:07.467098 | 2023-03-15T20:38:54 | 2023-03-15T20:38:54 | 151,570,665 | 61 | 11 | BSD-2-Clause | 2019-08-10T07:56:48 | 2018-10-04T12:49:06 | Java | UTF-8 | C++ | false | false | 281 | h | OpenCLInfo.h | #ifndef OPENCL_INFO_H
#define OPENCL_INFO_H
#ifdef __APPLE__
#include <OpenCL/opencl.h>
#else
#include <CL/cl.h>
#endif
class OpenCLInfo
{
private:
int w_max;
public:
OpenCLInfo() {};
~OpenCLInfo() {};
void printInfo(cl_context context, cl_device_id device);
};
#endif
|
b800bc47bc708e3a9f4fab2eb84b1a471750e9a3 | 59a2182bef1463e6807c6df774fea8ee61b8aaa2 | /Forth/3.cpp | 01ca80754ee8212a9a0199a6deb29c64c592aa1f | [] | no_license | Flaoting/Data_Structure | b67c15b36a1ea8f21973118b8baa0db8b0f82205 | 04c38dd33c0ad1844d2f851e1051229b282fed24 | refs/heads/main | 2023-02-13T07:44:08.178711 | 2021-01-07T17:05:35 | 2021-01-07T17:05:35 | 314,995,014 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,029 | cpp | 3.cpp | #include <iostream>
#include <fstream>
using namespace std;
int n,k,t,xl,yd,xr,yu;
int x = 0, y = 0;
int main()
{
ifstream file("3.txt", ios::in);
file >> n >> k >> t;
file >> xl >> yd >> xr >> yu;
int passby = 0, stay = 0, time = 0;
bool in = false;
bool candle = false;
for(int i = 1; i <= ... |
78f50fd01579b6d5c2e8324c2b7f45060ac39947 | 509455953fee1ed25ffbca8b5a00616378e14a5e | /Game/Game.h | d1c3b59d167969ff1c715b11ebd091b3614e6a80 | [] | no_license | Supetorus/GAT150 | 0b3f2111d094c482168c64c0a9ed9553a5694237 | 87f3490ed2518697da2afce3437e5fa4596a8a2a | refs/heads/master | 2023-07-27T03:08:27.651633 | 2021-08-16T23:46:15 | 2021-08-16T23:46:15 | 392,109,969 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,097 | h | Game.h | #pragma once
#include "Engine.h"
#include "Actors/Player.h"
#include "Actors/Asteroid.h"
#include "Actors/Enemy.h"
#include "Actors/Projectile.h"
#include "Math/Transform.h"
#include "Math/Random.h"
#include <fstream>
class Game
{
public:
enum class eState
{
Title,
Instructions,
StartGame,
StartLevel,
Game... |
97875c1950927773dc7ad38b243257ca2c41642a | 55143c088d1cdf0ea934c85828ef71f1eb94a87e | /GUI/LoadingDialog.cpp | b9985db1947a1171c0907f685b05deba05a85a6a | [] | no_license | maferland/FTB | 124afed4c08be7b607817fb8401009bcc01bb8cc | e96268e242f6546a8ba4272752f3d25ccd83c68a | refs/heads/master | 2021-05-16T02:50:10.658923 | 2017-02-27T03:53:41 | 2017-02-27T03:53:41 | 30,243,608 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 709 | cpp | LoadingDialog.cpp | #include "LoadingDialog.h"
#include "ui_gui.h"
LoadingDialog::LoadingDialog(int size)
{
this->setMinimumDuration(0);
this->setLabelText("Chargement...");
this->setValue(0);
this->setMaximum(size);
this->setCancelButton(0);
this->setWindowModality(Qt::WindowModality::WindowModal);
this->setWindowFlags(Qt:: ... |
9c77b57de880ca7966186fcc1703ba5bb98502f9 | 6f157d27ee466d5600e4f6af8ee38f168a8d0e8c | /asmodean/asmodean tools/exuni2/exuni2.cpp | 39057093847112324035cc281c7190cad8f21120 | [] | no_license | chrisdevchroma/galgametools | bd85333e440e10d6cf704167bbcd540e1cddf0d5 | d3fa44bf13e48757c57720ad6070e0e660e17f45 | refs/heads/master | 2023-08-21T13:45:02.524512 | 2020-08-12T03:21:21 | 2020-08-12T03:21:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,847 | cpp | exuni2.cpp | // exuni2.cpp, v1.0 2010/11/01
// coded by asmodean
// contact:
// web: http://asmodean.reverse.net
// email: asmodean [at] hush.com
// irc: asmodean on efnet (irc.efnet.net)
// This tool extracts UNI2 (*.uni) archives.
#include <windows.h>
#include <Xcompress.h>
#include "as-util.h"
stru... |
aa5becc47344023266b00ae7816d9fb7b58d9c83 | 16c2ab0383e8daf4ebbda9c215e1c230be9f7c15 | /Testing/H5FDdsmSender_cwrite_cread.cxx | ed02f59a2cdb09a6c4f55d20d8c552a2f45faa1c | [] | no_license | soumagne/h5fddsm | efcb44e4d01d63c1fb240fa488e059a55a8409a2 | 63d6b18d2f85ff383c7ee39552849e582360aad0 | refs/heads/master | 2021-07-23T23:17:39.765941 | 2014-10-23T09:25:58 | 2014-10-23T09:25:58 | 109,051,657 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,158 | cxx | H5FDdsmSender_cwrite_cread.cxx | #include "H5FDdsmTest.h"
#include "H5FDdsm.h"
//
#include <hdf5.h>
#include <cstdlib>
//----------------------------------------------------------------------------
int main(int argc, char * argv[])
{
MPI_Comm comm = MPI_COMM_WORLD;
H5FDdsmManager *dsmManager = new H5FDdsmManager();
senderInit(argc, argv, dsmMan... |
160d082a9e4173cce68aff8bd141f1073b22feb0 | 5677db59ac729652f4019bd7259d35ac2ff1a960 | /main.cpp | fc814c03bd9059c610989995e07403f45d2e9669 | [] | no_license | coffeine-009/MarioIsReturning | 39124476e3a76725ba69688e055f2636742a71ce | 6ac569c24e4e7670a032a259f65c6a3a2896fce6 | refs/heads/master | 2020-06-07T07:42:50.974448 | 2014-03-24T21:40:59 | 2014-03-24T21:40:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,941 | cpp | main.cpp | /// *** Main file(Point of entry) *** *** *** *** *** *** *** *** *** *** ///
/** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *
* *
* @copyright (c), 2013 by Vitaliy Tsutsman
*
* @author Vitaliy Tsutsman <vit... |
055d1c33bbb63ac080dc63cb2b2e26df853494b7 | 146698dcc3a2cbc9bdbf855add3fd7d6a1934c50 | /SampleCodes/Function/Lab9.cc | fb06d919a24474bf860ec86fae5f72710ed63a6a | [] | no_license | geunkim/CPPLectures | 1e0d80a6f7348d5abae6ea4fe7b0b0be3de3afee | a402e912777c2d280a2103fa968e6c91dab63435 | refs/heads/master | 2023-07-20T14:57:25.165971 | 2023-07-17T01:28:40 | 2023-07-17T01:28:40 | 210,631,519 | 32 | 104 | null | 2023-03-21T23:52:22 | 2019-09-24T15:05:32 | C++ | UTF-8 | C++ | false | false | 346 | cc | Lab9.cc | /*
File: Lab9.cc
Author: Geun-Hyung Kim
*/
#include <iostream>
using namespace std;
double div_eq(double x = 10, double y = 20) {
return x / y;
}
int main(int argc, char const *argv[])
{
cout << "출력(1): " << div_eq() << endl;
cout << "출력(2): " << div_eq(5) << endl;
cout << "출력(3): " << div_eq(50, 10) << endl... |
db303235b778cfaaeb8abde5053d379cba077c13 | 954377c3bb9f75826c959249c7f1f505366e9388 | /src/backdrop.h | 87b8ecf62717401ebea19c05de7ecb25f95384a2 | [] | no_license | bentglasstube/ld32 | 6dbd3b3cda7040113ce473d929da9c2be365674a | e7286ecddc239bff2c16379b6ef00c3ea72ae736 | refs/heads/master | 2021-01-17T15:23:24.761021 | 2016-05-02T15:58:43 | 2016-05-02T15:58:43 | 41,442,604 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 268 | h | backdrop.h | #pragma once
#include <SDL2/SDL.h>
#include <string>
class Graphics;
class Backdrop {
public:
Backdrop(Graphics& graphics, const std::string& file);
void draw(Graphics& graphics);
virtual void update() {}
private:
SDL_Texture* texture;
};
|
8d4960d698fb9cde5cfd9e3a23392bcb5e05a46a | 8a48bd1c0480698f5d8d7289f22e851ac6534fe2 | /BOJ11660.cpp | ec04fbbfcec3e92762c91ce89349b98ea4dd3309 | [] | no_license | luceinaltis/Algorithms | 9da76f7e712d3beb4309cd9023e565a77bc92bc7 | 383be527c2b412963c0422d5cb844a7e29ad07e4 | refs/heads/master | 2021-11-26T18:08:19.404362 | 2021-10-06T05:57:30 | 2021-10-06T05:57:30 | 240,202,816 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 998 | cpp | BOJ11660.cpp | #include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;
int n, m;
int board[1025][1025];
int cumSum[1025][1025];
void calculateCumulativeSum()
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
cumSum[i][j] = board[i][j] + cumSum[i][j - 1] +... |
553046089f309b16d5e28b1fefccf1bf058e65b5 | 34a5d9d2bd56d826e67d81d9943949d47d8e38fa | /ocl/PosixSlurp.cc | e2816d4dc500b55f01add76c761b39440f8d16f9 | [] | no_license | JensMunkHansen/dsp | 44443c20d9c3693d43d900653126a9dc8eecc77a | caf44ff30ebd245fff7e633c3f12ca55af6fbe61 | refs/heads/master | 2020-04-22T12:59:09.951339 | 2019-02-19T09:04:23 | 2019-02-19T09:04:23 | 170,393,062 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,163 | cc | PosixSlurp.cc | #ifndef SLURP_H
#define SLURP_H
class Slurp {
void *begin_{ nullptr };
void *end_;
public:
Slurp() = delete;
Slurp(const Slurp &) = delete;
Slurp &operator=(Slurp) = delete;
Slurp(Slurp &&other) noexcept = default;
Slurp &operator=(Slurp &&other) noexcept = default;
[[gnu::nonnull]] Slurp(const char *path);
... |
7041e92dec392a6891e77216adba7a469345c52f | 90f4fcb8f687fd885e64500dbbed980d292c123d | /include/meshloader.h | e6a3dd4e70ec29df527963ad923ca2f5f379c667 | [
"MIT"
] | permissive | smarchevsky/VisualEngine | 21738333745f5ddac2c8ced60aefeafe7a0a5937 | 47e1c8a018855fe27b90827ab66177ff73eae405 | refs/heads/master | 2022-01-09T21:50:00.645247 | 2019-06-25T18:45:04 | 2019-06-25T18:45:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 221 | h | meshloader.h | #ifndef MESHLOADER_H
#define MESHLOADER_H
#include <vector>
namespace Visual {
class Model;
class MeshData;
class MeshLoader
{
public:
static std::vector<MeshData> load(const char* path);
};
}
#endif // MESHLOADER_H
|
965e7dab930bb5fdedfae60fba3b4d031f727daa | ce1d9f8cf8e21cf5da20553b2460e43923c134e9 | /Times-fatec/Times.cpp | 279f414e8441cab4dc5c6be5fd7427e61115f58d | [] | no_license | devjaum/Fatec-exercicios | dce4d5a766b31439451a26744bc835c60c688b4b | 2067191ad3debdd323d42d1d562416a8669cda6a | refs/heads/master | 2022-11-16T21:08:35.125188 | 2020-07-10T01:39:04 | 2020-07-10T01:39:04 | 262,870,645 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,029 | cpp | Times.cpp | /*
Name: sistemadelogin.cpp
Author:Joao Carlos
Date: 10/05/2020 17:00
Description: Função para fazer um sistema de login
*/
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <string.h>
char ExibirLPontuacao(char[]);
char Resultado(char []);
void ExibirTimes(char[12][50]);
//Variavel global... |
e1d65e281d537e4e2ed346ee0910716afb69f6ca | cd57c848fcf53ba3c3ec38b90c1d29d7462cf717 | /FibonacciType/Staircase123.cpp | 1a20cfd5df2d030659a66619b4e1def3b38a7eb0 | [] | no_license | abhilasha007/Dynamic-Programming | a9a2267b7aa200ca169335ca2ed32e91758ebe91 | f03141ec7675f0ff9d2f68a9e456f331cdcb7635 | refs/heads/main | 2023-06-25T06:51:50.312865 | 2021-07-29T14:08:14 | 2021-07-29T14:13:04 | 341,320,089 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,141 | cpp | Staircase123.cpp | /**
* A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time.
* Implement a method to count how many possible ways the child can run up the stairs.
Examples:
Input : 4
Output : 7
Explantion:
Below are the four ways
1 step + 1 step + 1 step + 1 step
1 step + 2 step... |
584bebf30c4ddc423883b393a3d69841535749ad | a6d42343368589c7e7d83584959718a2bc360f79 | /Resource Robbers/physics/PhysicsEngine.cpp | 5a97a0be4597a5c002ffc371a6ba4790ad3cd81a | [] | no_license | wtacquard/resource-robbers | 6973077c0cdffa9012d67488fc2c031ed6b82182 | b150519979ce13eced8f0128ea228c026308ed62 | refs/heads/master | 2021-01-19T08:14:24.742120 | 2014-07-18T13:29:21 | 2014-07-18T13:29:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,035 | cpp | PhysicsEngine.cpp | #include "PhysicsEngine.h"
#include <boost/exception/exception.hpp>
#include <sstream>
#include <log.hpp>
#include "PhysicsMovableObject.h"
#include "common/MoreMath.h"
using RR::Log;
using boost::exception;
PhysicsEngine::PhysicsEngine() :
gravity(0, 0.000000000f, 0.0f), _pobjects(), onCollideFunction(NUL... |
a53bfbce85c4ddac2f031fe7d60df72b6c982d71 | 0a55aa9f81d38d10681a793d55b6831f0f5fed7f | /Application_tree.cpp | 6d69fd754a43eebb97b1c1e6cdca0617deddc997 | [] | no_license | DShcherbak/Module_test_2 | d3416031dd28bae9ad1f53d0337921830fab0920 | ed7fae43c89953ba909593cb1026fd63e645740f | refs/heads/master | 2020-05-24T08:14:09.954670 | 2019-05-23T12:46:34 | 2019-05-23T12:46:34 | 187,178,119 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,525 | cpp | Application_tree.cpp | #include <iostream>
#include <vector>
#include <cmath>
#include <random>
#include <algorithm>
#include <queue>
#include "Application.h"
const double probability = 0.1;
struct Node{
Application *app;
Node *parent;
int height, cnt_child, cnt_tree;
double min_mark, max_mark, sum;
std::vector <Node*>... |
7e07d4febefcf588df5e7da33475d93e80c6674d | 64cf9ab2677095c37b6924c55c36d00a519197bd | /creational_pattern/builder/builder.h | 004d48b41d9e7d62be47e899d47d324c022083db | [
"MIT"
] | permissive | heLi0x/design_pattern | 9346b7d94663d451617b1754a4df97c920c0c9e8 | 91ef376056e90e5de4deb0e6f08573716dc18a19 | refs/heads/master | 2023-01-22T12:56:28.837755 | 2020-11-25T12:03:24 | 2020-11-25T12:03:24 | 315,539,503 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 533 | h | builder.h | #ifndef _BUILDER_BUILDER_H
#define _BUILDER_BUILDER_H
#include "product.h"
#include <string>
class Builder{
public:
virtual void buildPartA(std::string s)=0;
virtual void buildPartB(std::string s)=0;
virtual void buildPartC(std::string s)=0;
virtual Product* getProduct()=0;
};
class ConcreteBuilder:publ... |
a7a162609fb048284655c299554f879354bf7852 | 54a29cf19d0962b9e5d9c535918a1c56bcfebdd3 | /test/snippet/core/algorithm/deferred_config_element_base.cpp | 6e993735021a4d64f0850805a0789f7c0e7ba599 | [] | permissive | giesselmann/seqan3 | c027ae539e92460371d0b354a9cf768d380a573b | 3a26b42b7066ac424b6e604115fe516607c308c0 | refs/heads/master | 2021-04-26T22:17:41.710001 | 2018-09-19T07:09:28 | 2018-09-19T07:09:28 | 124,063,820 | 0 | 0 | BSD-3-Clause | 2018-03-06T10:45:41 | 2018-03-06T10:45:41 | null | UTF-8 | C++ | false | false | 786 | cpp | deferred_config_element_base.cpp | #include <seqan3/core/algorithm/deferred_config_element_base.hpp>
using namespace seqan3;
int main() {}
//! [usage]
template <size_t I>
struct my_config
{
size_t value{I}; // Has to be named `value`.
};
struct my_deferred_config
{
template <typename fn_t, typename configuration_t>
constexpr auto invoke(... |
e60a84b3deb3ca0d07e1af2f4ce551c7aa6e8e1c | 2f38d24a58c50bf6b192e32313cc993e0a54f660 | /pytest/extend/vector2/RoadGenerateSDK/GRoadLinkModifierRoadSmooth.h | c48d897d8873766ce5b89f7dd1e16865d14f5514 | [] | no_license | lezasantaizi/stray_file | c0a9606eb8552b28034cef565d0e5385a60924ff | 0fd63963575f156dafc23563ee0ff35e788cf727 | refs/heads/master | 2021-01-20T01:17:47.538730 | 2017-12-26T06:30:47 | 2017-12-26T06:30:47 | 101,283,335 | 0 | 2 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 830 | h | GRoadLinkModifierRoadSmooth.h | /*-----------------------------------------------------------------------------
×÷Õߣº¹ùÄþ 2016/06/22
±¸×¢£º
ÉóºË£º
-----------------------------------------------------------------------------*/
#pragma once
#include "GRoadLinkModifier.h"
#include "SDKInterface.h"
/**
* @brief
* @author ningning.gn
* @remark
**... |
7050fb73a0dc49744163d8cd643c7342de11d0b1 | 91a882547e393d4c4946a6c2c99186b5f72122dd | /Source/XPSP1/NT/multimedia/dshow/filters/tsdvr/dvrfilters/shared/dvrpins.h | 45def8bf154dd6324ac1df73a0a1249cc98a5b1e | [] | no_license | IAmAnubhavSaini/cryptoAlgorithm-nt5src | 94f9b46f101b983954ac6e453d0cf8d02aa76fc7 | d9e1cdeec650b9d6d3ce63f9f0abe50dabfaf9e2 | refs/heads/master | 2023-09-02T10:14:14.795579 | 2021-11-20T13:47:06 | 2021-11-20T13:47:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 19,665 | h | dvrpins.h |
/*++
Copyright (c) 2001 Microsoft Corporation
Module Name:
dvrpins.h
Abstract:
This module contains the DVR filters' pin-related declarations.
Author:
Matthijs Gates (mgates)
Revision History:
01-Feb-2001 created
--*/
#ifndef __tsdvr__shared__dvrpins_... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.