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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cae9de73d46ee049510db4fd19901182a8829c67 | 72102e9f9106dbb1a6cee25f55c8bcf5ac014f36 | /HackerEarth/October18Circuits/QuestionPaper.cpp | a68f5bfadc4e08a8bcc9954ae74a16aed34360e6 | [] | no_license | harshitdiit/CompetitiveCoding | 07ad7b08f596395614fbecfaa68837b56a3be539 | c5c35d8d360eff227d572132a16d7d7c36e184bb | refs/heads/master | 2021-08-17T08:30:42.594898 | 2020-04-08T00:50:01 | 2020-04-08T00:50:01 | 154,908,713 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 467 | cpp | QuestionPaper.cpp | #include<bits/stdc++.h>
using namespace std;
int gcd(int A,int B){
if(A==0)
return B;
return gcd(B%A, A);
}
int main(){
int T;
cin>>T;
while(T--){
int N, a, b, combis;
cin>>N>>a>>b;
int A = min(a,b)/gcd(a,b);
int B = max(a,b)/gcd(a,b);
int S=A+B;
... |
56d08c454b683cd8346d1f6d9e74fd8db5858e09 | 34880511948870687a27160e067d572ffe16c076 | /core-cpp/src/main/c++/javolution/lang/Runnable.hpp | e4a609162ceb86c117757e3376c0e44416c4ceb7 | [
"BSD-2-Clause",
"BSD-3-Clause"
] | permissive | alicanalbayrak/javolution | 60a7482b7fa309155998a75cdabf2b171a85b48b | 1bed60dee5c9ab358680181544962b2df84c8c14 | refs/heads/master | 2021-01-13T04:20:24.437022 | 2016-12-23T18:24:31 | 2016-12-23T18:24:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,013 | hpp | Runnable.hpp | /*
* Javolution - Java(TM) Solution for Real-Time and Embedded Systems
* Copyright (C) 2012 - Javolution (http://javolution.org/)
* All rights reserved.
*/
#ifndef _JAVOLUTION_LANG_RUNNABLE_HPP
#define _JAVOLUTION_LANG_RUNNABLE_HPP
#include "javolution/lang/Object.hpp"
namespace javolution {
namespace lang {
... |
da6e2bc5fb27e611067f3e0831ae5ce5c5f5620b | 00693763ac68c6151211e19355e633e45cecbbb4 | /Fourier_Transform/ipTool.cpp | 09c8c8066c16225762b471dbd33af25947c4fc4c | [] | no_license | sjitb/ImageAlgorithms | a735838309bdf0044689090c561146707d733390 | 9b348096cc11897eee8b40e4b0f49a507eacb596 | refs/heads/master | 2020-12-24T13:17:08.438511 | 2020-01-23T07:30:36 | 2020-01-23T07:30:36 | 38,796,133 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 22,861 | cpp | ipTool.cpp | // ipTool.cpp: implementation of the ipTool class.
// Please see the README.txt for comments
//////////////////////////////////////////////////////////////////////
#include "ipTool.h"
//////////////////////////////////////////////////////////////////////
// Construction/Destruction
///////////////////////////////////... |
169e76221583a9b4f46bd60e60ae07bab2bdcdf8 | 457bff26da2a4205d94892727553e372b358cc0e | /more_map_main.cpp | 2efff22ba783c2473ceebad19c7236aee0f938dc | [] | no_license | karta2164480/DSA_final_project | e180c71398cb9bdb5905bfd5413bea9a995866ed | faa4fd68e2e1df308dd8a90a3984f2356c8d1d76 | refs/heads/master | 2022-11-06T05:15:58.838368 | 2020-06-22T13:08:37 | 2020-06-22T13:08:37 | 266,141,093 | 1 | 0 | null | 2020-06-05T07:42:44 | 2020-05-22T15:13:47 | C++ | UTF-8 | C++ | false | false | 7,264 | cpp | more_map_main.cpp | #include "string.h" //strtok
#include <map> //map
#include <vector> //vector
#include <algorithm> //sort
#include "email.h" //email
#include "parser.h" //parser
#define MAX_STRING_LENGTH 10000
int main(){
string opr;
unsigned int to_delete_id;
char file_path[MAX_STRING_LENGTH];
char query_filter[MAX_STRI... |
46274a1dd5379af6e2e5cd476d7d87cd78e5e946 | 47ab3c1144428bfcdad475e404182e49fe18aa3a | /30DaysOfCode/2DArrays.cpp | 3ff6aacd5d2c7b24fd8e8527d03888f8624c1342 | [] | no_license | adc-code/HackerRankPractice | 0748e4b4fa6c3fefc156d95826762fdbad955941 | 031e56bbd2311b5375609e2469f280a567d1dbbe | refs/heads/master | 2022-12-25T02:57:18.089761 | 2020-09-27T20:42:12 | 2020-09-27T20:42:12 | 277,374,557 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 742 | cpp | 2DArrays.cpp | #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<vector<int>> arr(6);
for (int i = 0; i < 6; i++) {
arr[i].resize(6);
for (int j = 0; j < 6; j++) {
cin >> arr[i][j];
}
cin.ignore(numeric_limits<streamsize>::max(), '\n');
}
int maxValue ... |
2a76c39c46070b2245e34ae35f5671bacc1c5d12 | 033679d90f6a483e7a07c8ac34130affe25dc7a5 | /src/nfa/shengcompile.cpp | c4094cedc720968fecc0ed0c9e6dfb58431c807c | [
"BSD-3-Clause",
"BSL-1.0",
"BSD-2-Clause"
] | permissive | kunpengcompute/hyperscan | 199948aa6a40126a44a22bc26aaca2786f84e8fe | ef46fc7c88b667d6a3b1ec54d001b417612c3759 | refs/heads/aarch64 | 2023-08-06T13:57:24.146289 | 2021-03-19T11:08:15 | 2021-03-19T11:08:15 | 233,202,598 | 83 | 28 | NOASSERTION | 2020-11-27T03:23:26 | 2020-01-11T08:49:52 | C++ | UTF-8 | C++ | false | false | 17,110 | cpp | shengcompile.cpp | /*
* Copyright (c) 2016-2017, Intel Corporation
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of conditions and the f... |
02752eaccaaf85852e1c75314925181a53787835 | 525f8fc59b58c82926f7e4cb6c60393014f7daaa | /c++/hight_and_diameter_of_tree.cpp | c53166cfe19e2be1ed26afc9e033e0f748872ea0 | [] | no_license | Ayushaps1/coding | 4211663fd418af0594271b8f43502b422fc7ee7f | 7391650f11d86fb2217fe895146ce593c5c212b2 | refs/heads/main | 2023-08-22T22:22:32.929673 | 2021-09-28T06:09:38 | 2021-09-28T06:09:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,374 | cpp | hight_and_diameter_of_tree.cpp | #include<iostream>
#include<queue>
using namespace std;
struct node{
int data;
node* left;
node* right;
node(int val){
data=val;
left=NULL;
right=NULL;
}
};
int hight(node* root){
if(root == NULL){
return 0;
}
return max(hight(root->left),hight(root->r... |
7a885dd70112a12d45f95b135c96030d2c98db83 | 57d1302ecad42af168f6e958852708f8766e35be | /WoW/DX9/Graphics/Model/X/SkinnedMesh.h | de34592d16812c46da45b32a954e74ff72ab24c3 | [] | no_license | KeeJuneLim/WoW_Team_Project | ce86c96fa24c2f73deb12e4451911026910d176e | ebd82c9d9f5f9f7028b7f59a0b26f6dd9247357c | refs/heads/master | 2020-04-10T17:17:43.544086 | 2018-12-20T07:30:36 | 2018-12-20T07:30:36 | 161,169,945 | 1 | 0 | null | null | null | null | UHC | C++ | false | false | 1,979 | h | SkinnedMesh.h | #pragma once
class SkinnedMesh : public IUnitObject
{
protected:
LPD3DXFRAME m_pRootFrame;
LPD3DXANIMATIONCONTROLLER m_pAC;
int m_animIndex;
float m_fBlendTime;
float m_fPassedBlendTime;
LPD3DXMESH m_pSphereMesh;
bool m_bWireFrame;
bool m_bDrawFrame;
bool m_bDrawSkele... |
95f7979a83722c3bbeb317d0f2bc5d052b105c74 | 0d47255822ebb007e50a96887e1778ae74807989 | /CS32-DataStructures/BugBlast/BugBlast/Actor.cpp | 04b4901375d930cba3e4e466adc8c54caad89d25 | [] | no_license | tgaldes/UCLA | 7eadb28edf8fcbe3861e0c3b48cc40ed0df02280 | b0593fcc1b1b54d7372ad2c7ccc9eeac3a049b9c | refs/heads/master | 2021-01-11T03:28:38.313042 | 2016-10-16T03:33:56 | 2016-10-16T03:33:56 | 71,027,445 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,048 | cpp | Actor.cpp | #include "Actor.h"
#include "StudentWorld.h"
#include "GameConstants.h"
#include <iostream>
#include <queue>
using namespace std;
// Students: Add code to this file (if you wish), Actor.h, StudentWorld.h, and StudentWorld.cpp
Actor::Actor(int image, int x, int y, StudentWorld* pt) : GraphObject(image, x, y)
{
set... |
9e992cb5ab888538495777a9911ca5aa047eee0c | 17ad1146e6213ac7fae7847351419a5c1064509c | /Lark.cpp | 3ea9775178da36756e120ecbe629f0162bf268a9 | [] | no_license | e-workman/Object_Oriented_Programming_Birds | d1fc63718e81a55442b9fc252517bfd50afe4f8c | ca0ce8457b21c742d85f173bfd5421b53a86220d | refs/heads/main | 2023-02-26T17:40:49.870502 | 2021-02-04T21:15:43 | 2021-02-04T21:15:43 | 336,079,688 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 713 | cpp | Lark.cpp | #include "Lark.h"
#include <cmath>
Lark::Lark(TwoVector position, TwoVector velocity)
:Bird(position, velocity){}
Lark::~Lark(){}
//update calculates velocity and position of each bird:
void Lark::update(TwoVector v_steer1, TwoVector v_steer2 , TwoVector v_steer3) {
//larks more strongly align, but have wea... |
a429fabca8f53fff3c3f3cb79b5a2a2ea2309c94 | 36431b5717030e7933aa74eaef2b948697fdd684 | /src/misc/char_input_dialog.cpp | 1924cec32feed155efdcdfcfbe632f263f89886d | [] | no_license | children-of-gazimba/companion-qt-tool | af9ce544b5bbdfb148ae2d5353a5439f2d775be9 | 7bcc4733f7677bc708c509b134d7ebbad4cdc67c | refs/heads/master | 2021-06-19T21:02:47.248815 | 2018-10-27T21:38:34 | 2018-10-27T21:38:34 | 106,701,749 | 0 | 0 | null | 2018-12-18T16:38:31 | 2017-10-12T14:13:12 | C++ | UTF-8 | C++ | false | false | 1,968 | cpp | char_input_dialog.cpp | #include "char_input_dialog.h"
#include <QHBoxLayout>
#include <QRegExp>
#include <QDebug>
CharInputDialog::CharInputDialog(QWidget *parent)
: QDialog(parent)
, selected_char_(' ')
, label_(0)
, edit_(0)
, ok_(0)
, cancel_(0)
{
setWindowTitle(tr("Select Key"));
initWidgets();
init... |
eb9b7c29348b9cfa0cb8fb02d892c83768924d9e | ee21530730a7d843ca6dae2d2394f1b9fda0f464 | /DividedMethod/Source.cpp | 09075e1e7993f66c0f3cbf07074ab5c24d831c03 | [] | no_license | devvados/numeric-methods | 5303a9f8df60615ba067864bf4fb89034bc77299 | b85326d23116b613855761e48fcbfafc5b5ca5b1 | refs/heads/master | 2021-09-10T10:43:12.450991 | 2018-03-24T18:20:21 | 2018-03-24T18:20:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 573 | cpp | Source.cpp | #include <conio.h>
#include <cmath>
#include <iostream>
#define pi 3.14
#define eps 0.001
using namespace std;
double f(double x) {
return x*x*x - 6.0*x - 8.0;
}
double f1(double x)
{
return tan(0.58*x + 0.1) - x*x;
}
int main() {
int n = 0;
double a, b, c;
cout << "a="; cin >> a;
cout << "b="; cin >> b;
do {
... |
43025e29c654b4d7137153c990df85de412d2982 | 8ff0c1b6daa5ebc58dda4e41300af3b3b74e56a1 | /deletearray.cpp | 8a403d76bb3b8f69b3eff051b2287a92725f17f0 | [] | no_license | vridhi-sahu/nau | f8ab7c62d3b21e70064d4e211dfa156b6c1bea52 | dfde773c95e30326231540b670abbde64e831a5e | refs/heads/master | 2020-04-14T16:28:16.467275 | 2019-01-10T17:37:21 | 2019-01-10T17:37:21 | 163,952,661 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 434 | cpp | deletearray.cpp | #include<stdio.h>
int main(){
int loc, num, i, arr[100];
printf("Enter the number of elements in the array.");
scanf("%d",&num);
printf("Enter the location of the element in the array.");
scanf("%d",&loc);
printf("Enter the elements in the array.");
for(i=0;i<num;i++)
{
scanf("%d",&arr[i]);
}
for(i=0;i<=num... |
a40525389d4f51d3998883c0b02151d7e285c50d | 5428c966ec3f2054ad7dd700816afee40983729e | /src/null_character_control.h | 044663ae31a3f815886cd47f2cb33316c925e5c4 | [
"MIT"
] | permissive | quinsmpang/MagicalGirlMica | 98dc7cc9c24ad7652590b21da85749de0bb4c825 | f061641e49aefd67cacef642e498efd3a666c14f | refs/heads/master | 2021-01-18T09:51:43.480935 | 2015-03-18T16:27:49 | 2015-03-18T16:27:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 413 | h | null_character_control.h | /*
* null_character_control.h
*
* Copyright (C) 2014-2015 Ming Tsang, Nathan Ng
* Refer to LICENSE for details
*/
#pragma once
#include "character_control.h"
namespace mica
{
class Character;
}
namespace mica
{
/**
* A CharacterControl that could only tell the Character to stand
*/
class NullCharacterCon... |
40a36ae27fa489c5684c541069bd0567ae2a7beb | f621882d8e358963c3f454e53ed12f1662ee882a | /src/operator/contrib/gradient_cancel-inl.h | 049bce922957aba1939d9fa0934ed11dc2777a0e | [
"Apache-2.0",
"NCSA",
"BSD-2-Clause-Views",
"BSD-3-Clause",
"LicenseRef-scancode-generic-cla",
"Zlib",
"BSL-1.0",
"BSD-2-Clause",
"Intel",
"MIT",
"LicenseRef-scancode-unknown-license-reference",
"Unlicense"
] | permissive | rayjs/BMXNet-v2 | 0c29d3d885fc3a0f410a8690565483cce3d81916 | 756a21f23ab10af2825f50663de251523084d4a8 | refs/heads/master | 2020-12-13T22:58:40.170002 | 2020-08-12T13:04:40 | 2020-08-12T13:04:40 | 234,555,112 | 0 | 0 | Apache-2.0 | 2020-08-12T13:04:41 | 2020-01-17T13:35:19 | null | UTF-8 | C++ | false | false | 8,085 | h | gradient_cancel-inl.h | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you ... |
8d3bcf924aaa76b81fc78fe69101d6f150f6ac0a | d1829a6e4e12dc3ee9e5fb4dcb5bd75fbec4a5a3 | /chessboard.cpp | 65f110d18ba6fa8c61409357918bd98c03322698 | [] | no_license | dsilvao/Chess | d2fd901fae8d609132ce3e962dba33713326ed6d | 33305ff79ecf5755f949bbd6a89e4e1194833b3a | refs/heads/master | 2020-04-30T01:34:25.484287 | 2019-03-19T14:41:37 | 2019-03-19T14:41:37 | 176,532,266 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,360 | cpp | chessboard.cpp | #include<iostream>
#include<string>
#include<stdlib.h>
using namespace std;
const int pawn = 100;
const int bishop = 305;
const int knight = 300;
const int rook = 500;
const int queen = 900;
const int king = 2000;
int board[8][8];
const int startup[8][8] = { rook, knight, bishop, queen, kin... |
2f2a1fbfc294367fa0f33355c2c7da1805dedbf5 | 4113bbf1adfabf0fff260a0a4bf82f6b8e7da9b7 | /Lec-9/LongestSubstringWithoutRepeatingChar.Cpp | ee8537106fd5900333748a7c1d86bb03756b26e3 | [] | no_license | Mohit29061999/CbOffJan | c7de7901bb86a414bfb81b21fa263e9293ec5716 | 727bc22cbf3acd11d03dfaab9fc9874d0381256b | refs/heads/main | 2023-05-12T15:14:39.577195 | 2021-05-28T16:18:08 | 2021-05-28T16:18:08 | 336,571,334 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 837 | cpp | LongestSubstringWithoutRepeatingChar.Cpp | //problem link: https://leetcode.com/problems/longest-substring-without-repeating-characters/
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int n=s.length();
int freq[256]={0}; //to store freq of every character in substring
int st=0; //substring ka st... |
a1b16f3e5186356ccd04435d1e214d264cf4593c | c454bae589236c472d761437a7337a12d3a687fb | /Data/Data/Main.cpp | b5efb70c0b1d24868b06af595eda774b7c0614bb | [] | no_license | madladwolf/Classes | 9247f2d690b1530e7641b06b79e1f93f012a1669 | 3190efb3dc4834935a2f756332c8d4cd4a5a7edb | refs/heads/master | 2020-05-21T07:03:16.262501 | 2019-05-16T01:25:04 | 2019-05-16T01:25:04 | 185,949,414 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 477 | cpp | Main.cpp | #include "Data.h"
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int x;
Data d1;
Data d2(d1);
Data d3(2001, 12, 10);
cout << d3.getAno();
d2.setDia(14);
cout << "\n" + d3.toString();
cout << "\n" + d2.toString();
cout << "\nDigi... |
c07bc0bf93c81e86081b0fa93a9c42148a800087 | 7997e7b185d5c77216c356e85af6e562a4926586 | /codeOfAlgorithms/codeOfAlgorithms/Test_ResizingArrayStack.h | a3aa8f1ee5ce44b7ddb203c7fa2f27b5a7d23e84 | [] | no_license | pi-nyan/Algorithms_p | 1e5e1936628d8da7344b86cdf45e1e4639dc865f | 7ac7d0f404605d0ba1723eab133cf157457d344e | refs/heads/master | 2020-09-26T15:52:15.259446 | 2016-10-27T01:26:16 | 2016-10-27T01:26:16 | 67,682,776 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 265 | h | Test_ResizingArrayStack.h | #pragma once
#ifndef TEST_RESIZING_ARRAY_STACK_H
#define TEST_RESIZING_ARRAY_STACK_H
#include "ResizingArrayStack.h"
#include <string>
#include <fstream>
#include <iostream>
using namespace std;
namespace AlgorithmsTest
{
void tResizingArrayStack();
}
#endif |
76b73850790f927373a5c267c7aa106be8ea25d2 | 7c9136d87b8895ac6532ef2af58edf3ecc29d175 | /LongOpnFrameWnd.h | 81e89683899785a220463d33e08302073195a1bc | [] | no_license | khhubb/csda-new-ssb | 038d75858cba1e029f4f1315d6ebba95e5d9fb91 | 96eaf896ba6c91914f69671171f5488cf0fb5d3f | refs/heads/master | 2020-07-01T03:36:45.777439 | 2016-08-17T22:00:09 | 2016-08-17T22:00:09 | 74,102,071 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,304 | h | LongOpnFrameWnd.h | #if !defined(AFX_LONGOPNFRAMEWND_H__BA9FA470_8F57_11D1_8065_006097B38214__INCLUDED_)
#define AFX_LONGOPNFRAMEWND_H__BA9FA470_8F57_11D1_8065_006097B38214__INCLUDED_
#if _MSC_VER >= 1000
#pragma once
#endif // _MSC_VER >= 1000
// LongOpnFrameWnd.h : header file
//
class CLongOpnView;
////////////////////... |
5a726c88a046b5b9417f3dc898a4f16616bbcbd8 | 4eeb53ab8dac63d2bbdf0d8db2b8f52e0abe5998 | /src/action/test/form_error_packet_test.cpp | 0b4dc853dd42cabaee6152437a30da456b8b52be | [] | no_license | zwiibac/msm-tftp | 7d42298d7e06ad954d6e6014b5129a6a0695b402 | 060a4a52cc1ac2c9238f4433bc70730943b9a883 | refs/heads/main | 2023-08-28T11:16:53.910463 | 2021-10-24T23:21:17 | 2021-10-24T23:21:17 | 332,569,157 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,062 | cpp | form_error_packet_test.cpp | #include <optional>
#include <boost/asio.hpp>
#include <gtest/gtest.h>
#include <gmock/gmock.h>
#include <zwiibac/tftp/test_utils/random_iterator.h>
#include <zwiibac/tftp/test_utils/buffer_assert.h>
#include <zwiibac/tftp/action/form_error_packet.h>
namespace {
using namespace zwiibac::tftp;
using namespace zwi... |
b3bc890264ea449fb9f9f198ce8473e470e7d0ed | 7d63bab9ff2bb2de67fef12aa77a521f601f8578 | /include/nomlib/actions/CallbackAction.hpp | 88871708695d87cafd1a514d6f869a9846e2fada | [
"BSD-2-Clause"
] | permissive | i8degrees/nomlib | 7aa4c944256d36d4fb17bb632f7f5d2f83a09ce3 | 7c981c0faf040584e980eb0cadfea1ac5a7cd482 | refs/heads/dev | 2023-02-06T16:07:04.271032 | 2015-07-30T20:36:37 | 2015-07-30T20:41:20 | 9,707,652 | 2 | 1 | null | 2015-03-24T08:45:19 | 2013-04-27T01:59:17 | C++ | UTF-8 | C++ | false | false | 3,484 | hpp | CallbackAction.hpp | /******************************************************************************
nomlib - C++11 cross-platform game engine
Copyright (c) 2013, 2014 Jeffrey Carpenter <i8degrees@gmail.com>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided tha... |
7d0a798aaf292a67630f79be375efa098a6afb38 | b797c758e6da03741ad0e46b2ac52f1dba79cd6a | /src/gm/template/python/module.cpp | de079010bf1852a8f2d6bbb0c202dbfdd0dc5502 | [
"MIT"
] | permissive | hamedsabri/GraphicsMath | f8783752053a03a7dc0d40cdc7541b09bf1d0b60 | b15f9c52a090ffdb4028f7b2aa70d7ef3dfc14f2 | refs/heads/main | 2023-01-04T20:56:48.668149 | 2020-10-26T04:17:06 | 2020-10-26T04:17:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 561 | cpp | module.cpp | #include <pybind11/pybind11.h>
// Type Declarations.
{% for type in types -%}
void Bind{{ type.className }}( pybind11::module& );
{% endfor %}
// Function Declarations.
{% for function in functions -%}
void Bind{{ function.name }}( pybind11::module& );
{% endfor %}
PYBIND11_MODULE( gm, o_module )
{
o_module.doc(... |
7c0b54371ac2c0752ce6613e90d251e83219a1a8 | 965d7ced83f41d1e3336499e53e2221e0d157c93 | /src/renderer/particle_system.h | 265462a0fbf32b715c3f1cc273bdcc57554d1fe4 | [
"MIT"
] | permissive | lvshiling/LumixEngine | 2dc06a923af77a5139e082ff67d938f123f9e2dd | e4a33930ca8c657f402b059af4484250d9087f5a | refs/heads/master | 2021-01-13T08:58:17.106393 | 2016-09-23T11:05:45 | 2016-09-23T11:05:45 | 69,271,415 | 1 | 1 | null | 2016-09-26T16:49:18 | 2016-09-26T16:49:17 | null | UTF-8 | C++ | false | false | 5,933 | h | particle_system.h | #pragma once
#include "engine/lumix.h"
#include "engine/array.h"
#include "engine/vec.h"
namespace Lumix
{
class ParticleEmitter;
class IAllocator;
class InputBlob;
class Material;
class OutputBlob;
class RenderScene;
class ResourceManager;
class Universe;
class WorldEditor;
struct IntInterval
{
int from;
int... |
ba5ced66015f5ce72594f13d7e0b91232dac4b53 | 123381f4eaecba23a531893541cf09ed926bc07f | /code/standard/inverse.cpp | cf6a259cdfc299589c787369e7633e551c78e6b5 | [] | no_license | SHASHA1S2/Code | 15d3d015fd74bca06529873bdc90248d99a9dc1e | 820c5f35f09f8f078f2a811c7efe2954b62a2c79 | refs/heads/master | 2021-01-17T23:49:31.412662 | 2012-12-09T16:35:20 | 2012-12-09T16:35:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 758 | cpp | inverse.cpp | #include<cstdio>
#include<iostream>
using namespace std;
typedef long long LL;
LL mod=1000000007LL;
LL inverse(LL n)
{
LL a=mod,temp;
LL b=n,c00,d00,c11,d11,c01,q,d01,d10,c10;
c00=1;c01=0;c10=0;c11=1;
while(b!=0)
{
q=a/b;
d00=c10;d01=c11;d10=c00-q*c10;d11=c01-q*c11;
c00=d00;c01=d01;c11=d11;c10=d10;
temp... |
07cc7d9ec7abd564be653168ee96463e9eb0c694 | bd90976eee39f81c73fee3406b50525a276c9468 | /assign3/src/parser.cpp | 97b2b4e3fdb495327afdb81c5e472f7fcaec5aeb | [] | no_license | ngattusohw/Operating-Systems | 7c4a6301d6bb6474120493cdd403a15153700520 | dfbd10045a9980413d3e0de521354c365ef4710d | refs/heads/master | 2021-03-30T15:31:52.582784 | 2018-04-27T02:38:46 | 2018-04-27T02:38:46 | 122,225,097 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,102 | cpp | parser.cpp | #include "linkedlist.h"
#include "Gtree.h"
#include <stdio.h>
#include "main.h"
#include "parser.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cstring>
#include <list>
#include <cmath>
using namespace std;
using std::string;
int MAXLINE = 256;
parser::parser(){
}
parser::~... |
efd2a068642835727408a80f98836c5343422357 | f6439b5ed1614fd8db05fa963b47765eae225eb5 | /mojo/common/common_type_converters.cc | 2439432c8ba262b11529ea8c760027107f6ba7a3 | [
"BSD-3-Clause"
] | permissive | aranajhonny/chromium | b8a3c975211e1ea2f15b83647b4d8eb45252f1be | caf5bcb822f79b8997720e589334266551a50a13 | refs/heads/master | 2021-05-11T00:20:34.020261 | 2018-01-21T03:31:45 | 2018-01-21T03:31:45 | 118,301,142 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,308 | cc | common_type_converters.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 "mojo/common/common_type_converters.h"
#include <string>
#include "base/strings/utf_string_conversions.h"
#include "url/gurl.h"
namespace mojo... |
d3f2c3b5a1e1f782fc051f8b056c293e18f71ddf | ed32cc4bb9824017228f43d0f3449312670f0bd1 | /第二章/2.64.cpp | 16ada1c40a28ac90ed2bd815cc98900dc9a01433 | [] | no_license | jay-hg/Homework-of-CS | 0fa2dc8922fa9c55fef581ac9591149a8b106ef1 | 6dba376871890574d840151b121543fe82b6e824 | refs/heads/master | 2021-01-18T04:11:52.415769 | 2017-03-11T15:26:56 | 2017-03-11T15:26:56 | 84,272,419 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 433 | cpp | 2.64.cpp | #include <stdio.h>
typedef unsigned char* byte_pointer;
int any_even_one(unsigned x) {
return !((x & 0x55555555) ^ 0x55555555);
}
int main() {
printf("%d\n",sizeof(unsigned));
printf("所有偶数位都是1？(0x07777777):%d\n",any_even_one(0x07777777));
printf("所有偶数位都是1？(0xfd577777):%d\n",any_even_one(0xfd577777));
printf("所有偶... |
9771b7e4b54b4e560f5a9a6cfb21fbd619c6745b | 9bf932d2d301da0c6ac8d35c1cc439c1a51734da | /Schema_stm/main.cpp | 9acf05c770c0b50258a49592af87f0d356a93b06 | [] | no_license | X-Robot-2015/Coupe_2017 | b3da28763f0a92431a73f5cc2c44858cc1213c2e | 2d521868c0ceb7da11b8d4b6b396d543ac2eca12 | refs/heads/master | 2021-01-11T15:22:06.076534 | 2017-03-15T16:16:58 | 2017-03-15T16:16:58 | 80,343,568 | 1 | 1 | null | 2017-03-01T13:31:26 | 2017-01-29T11:58:08 | Arduino | UTF-8 | C++ | false | false | 1,002 | cpp | main.cpp | #include "mbed.h"
//------------------------------------
// Hyperterminal configuration
// 9600 bauds, 8-bit data, no parity
//------------------------------------
Serial pc(SERIAL_TX, SERIAL_RX);
DigitalOut myled(LED1);
unsigned int cardArg[16];
unsigned int cardCommand, cardArgCount;
void setup()
{
}... |
97c89a54df262ce673ac5d6eb128416fbd358b3a | 15972773a62d1950d472c077eab728e15860247d | /Q6/pagamento.h | 75bfe9071b86ea434e7f4cbf45284c1dfd7b92b2 | [] | no_license | lygiaagueda/Roteiro_3 | 0c7091bd5802396b2d0b7434315fa68371a6f41f | 9307fca7c48e7db0cdc32e5a163b2bd4ff7ee8cf | refs/heads/master | 2020-03-10T02:27:08.568463 | 2018-04-23T18:20:00 | 2018-04-23T18:20:00 | 129,137,131 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 513 | h | pagamento.h | #ifndef PAGAMENTO_H
#define PAGAMENTO_H
#include <iostream>
#include <string>
using namespace std;
class Pagamento {
private:
double valorDoPagamento;
string nomeDoFuncionario;
public:
void setValorDoPagamento(double valorDoPagamento);
void setNomeDoFuncionario(double nomeDoFuncio... |
5557981e9f5598e72eb971307aecc862e5cf40f7 | 5ab292f9ca5e4c204aae1e11ff53dfc681445b0b | /src/State.h | 7ebfeebf7c4e3f82e30d02f1c90e021dd6f57521 | [] | no_license | sanjaykrishnagouda/CMPE-259 | 174258a5762f6034b4497bb059484663f096e24f | 229786cbc3d5cf6377a3ef6939462617abebbf79 | refs/heads/master | 2020-12-30T12:35:04.091951 | 2017-06-13T23:30:39 | 2017-06-13T23:30:39 | 91,389,287 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,673 | h | State.h | /**************************************************************************
File: State.h
Class: State
Description: This object holds a set of viewpoints. All of its
data fields are public, but it provides a few access
methods.
... |
b146a41c0a541e0f481b0f91206906ea6b4f8523 | 451bcb4a41ac1875cdf00b81ff789d658e69008c | /lab7/Rozdzielczosc.h | e7dbb1a40d658731b62a7e85b75329a27397397f | [] | no_license | Vectrom/oop_labs | 94c5b2b01881145b61292519fd2c2dfd4454731a | d925daef42b2e43feacde4d9fb7578d055c48c39 | refs/heads/master | 2020-05-03T00:02:53.145587 | 2019-04-18T00:58:00 | 2019-04-18T00:58:00 | 178,298,116 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,197 | h | Rozdzielczosc.h | #pragma once
#include <iostream>
/**
* @class Rozdzielczosc
* @brief Klasa reprezentujaca rozdzielczosc urzadzen biurowych.
*/
class Rozdzielczosc {
public:
/**
* @fn Rodzielczosc
* @brief Konstruktor tworzacy nowy obiekt reprezentujący rozdzielczosc z zadana wysokością i szerokością
* @param width Szerokość
... |
2b00ba22abefea50252fde9b996f4c707122a47d | 5671c626ee367c9aacb909cd76a06d2fadf941e2 | /frameworks/core/components/test/unittest/image_animator/image_animator_test.cpp | 9e1c1aaca5070b5ef4b0c8688891096dc1097d99 | [
"Apache-2.0"
] | permissive | openharmony/ace_ace_engine | fa3f2abad9866bbb329524fb039fa89dd9517592 | c9be21d0e8cb9662d5f4f93184fdfdb538c9d4e1 | refs/heads/master | 2022-07-21T19:32:59.377634 | 2022-05-06T11:18:20 | 2022-05-06T11:18:20 | 400,083,641 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 22,242 | cpp | image_animator_test.cpp | /*
* Copyright (c) 2021-2022 Huawei Device Co., Ltd.
* 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... |
c00b1bd34d886340daed287b2ce8d595a2ae7e16 | 5a41ebdf9e26f5f2b6e2cc04632590ea6b6d8751 | /src/lib/processor/cpp/parser_nodes.h | 3e94dbeb93b5b453e1bd16597befdedd6c96a2a0 | [] | no_license | nadiasvertex/cql-db | 202e044de2893d578be846fd15f4ce44ed386b46 | cc5e82f8d6bd2e96a93440fd6662a437587d3c6e | refs/heads/master | 2020-06-06T14:07:11.491959 | 2012-11-28T01:44:00 | 2012-11-28T01:44:00 | 32,324,322 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,390 | h | parser_nodes.h | /*
* parser_actions.h
*
* Created on: Nov 1, 2012
* Author: cnelson
*/
#ifndef __LATTICE_PROCESSOR_PARSER_NODES_H__
#define __LATTICE_PROCESSOR_PARSER_NODES_H__
#include <memory>
#include <stack>
#include <cell/cpp/data_value.h>
#include <pegtl.hh>
namespace lattice {
namespace processor {
namespace act... |
20a33323c1095de532289705645dcf93ada79268 | 989784cf74d6a56c543c0459a58606e2a0fe195d | /CaseStudy_13/Source/nvt.inc | 15f2976f6d7d31932cefa4a13815baf8dde90aaf | [
"MIT"
] | permissive | UnderstandingMolecularSimulation/CaseStudies | 96cf321c34d01a5864a3d9e16052e165a3b7cc73 | 37ef456278ca31594646769f6bfbb2f751062f08 | refs/heads/main | 2023-08-31T18:07:44.364373 | 2023-08-21T14:37:56 | 2023-08-21T14:37:56 | 584,754,712 | 10 | 2 | MIT | 2023-08-21T14:36:31 | 2023-01-03T12:38:49 | Fortran | UTF-8 | C++ | false | false | 290 | inc | nvt.inc | c nvt.inc
double precision temp
logical nvt
integer metht
common/nvtc/temp,metht,nvt
c
c temp : impost temperature
c metht : method used in simulation:
c 1 : Andersen
c 2 : Nose-Hoover
c NVT : if .true. simulate NVT ensemble
c
|
074aeb22621690bf395fbd54612560c800ed9698 | b16e2f8cc94df8320f9caf8c8592fa21b1f7c413 | /HDUOJ/6483/mo's_algorithm_binary_indexed_tree_doubling.cpp | 70149111f7dc2cacfc93c8af395bbca3ddd683fe | [
"MIT"
] | permissive | codgician/Competitive-Programming | 000dfafea0575b773b0a10502f5128d2088f3398 | 391f3ce9b89b0a4bbbe3ff60eb2369fef57460d4 | refs/heads/master | 2022-06-13T04:59:52.322037 | 2020-04-29T06:38:59 | 2020-04-29T06:38:59 | 104,017,512 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,257 | cpp | mo's_algorithm_binary_indexed_tree_doubling.cpp | #include <bits/stdc++.h>
using namespace std;
#define SIZE 100010
#define DSC_SIZE 200010
typedef struct _Query {
int id, qLeftPt, qRightPt;
} Query;
Query qArr[SIZE];
int arr[SIZE], posArr[SIZE];
pair<int, int> dsc[DSC_SIZE];
int numArr[DSC_SIZE], bit[DSC_SIZE], cntId;
bool ans[SIZE];
int low... |
392c34aa065367dfc9589d872c427393147b5118 | febba07bb5d3bcf2128d85dfe1fd969459935608 | /texprog2/Source.cpp | 45a6f5f8b5483744c116f7f6731f82e077471e97 | [] | no_license | DanyaSWorlD/texprog2 | 1ababfa2974b012587fc574be8135dee1b261d63 | 0fa1600e0ffd521c3ba7dd77f5b20449b1cbaf22 | refs/heads/master | 2021-10-24T20:00:11.779028 | 2019-03-28T08:09:28 | 2019-03-28T08:09:28 | 110,579,334 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,576 | cpp | Source.cpp | #include <iostream>
#include <windows.h>
#include "Semaphore.h"
using namespace std;
DWORD WINAPI testFunc(LPVOID param); /// Тестовая функция
Semaphore sem(4);
bool ct;
int main(int argc, char *argv[])
{
DWORD id;
for (int i = 0; i < 8; i++)
{
HANDLE h = CreateThread(NULL, 0, testFunc, LPVOID(new int(i)),... |
1d1ba109a28ac907196cb01416d62c3f6b170a9c | 935fa4f586f4990b506a693dff8945d2b7f9c677 | /u/t_async_operationlist.cpp | e781bb13621a43aeaeded70cbd62424fc5b07e0f | [] | no_license | stefanreuther/afl | 8e96be19a502463cdb72b42b6042cdd6869ecf0b | 35d2eb7c6be1a3aebfdf1ce046e6e1310dc7caf8 | refs/heads/master | 2023-07-20T11:12:27.849160 | 2023-05-07T11:03:03 | 2023-05-07T11:03:03 | 69,809,604 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,824 | cpp | t_async_operationlist.cpp | /**
* \file u/t_async_operationlist.cpp
* \brief Test for afl::async::OperationList
*/
#include "afl/async/operationlist.hpp"
#include "u/t_async.hpp"
#include "afl/async/operation.hpp"
#include "afl/async/sendoperation.hpp"
#include "afl/async/controller.hpp"
/** Test all operations with the base class. */
... |
9a141e99f51cb8323ab187bf941c2b59e4f62288 | ac5d9dced7c723cbbb7c541fb5031b548003342d | /Code/bzoj3283_data.cpp | b97e710c58c02a4f3f2c7c6c05bb16a85892da5d | [] | no_license | kzoacn/OI | 2f47e1bd30a07d8e2b45b5813b1491aff0ef1f10 | d34e2739b4ae1ddfe20faeda3b152329816dd960 | refs/heads/master | 2020-05-17T00:31:25.886309 | 2015-07-21T12:38:56 | 2015-07-21T12:38:56 | 37,414,200 | 4 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 431 | cpp | bzoj3283_data.cpp | #include<bits/stdc++.h>
#include<unistd.h>
using namespace std;
int range(int l,int r){return rand()%(r-l)+l;}
typedef long long LL;
LL pow(LL x,LL k,LL p){
LL ans=1;
for(;k;k>>=1){
if(k&1)ans=ans*x%p;
x=x*x%p;
}return ans;
}
int main(){
srand(time(0)^getpid());
int T=50;
printf("%d\n",T);
while(T--){
LL a... |
1c06c14c421f82572f0f9fd0e96de4271a33fbe8 | 6f78a4c4896563a52d86eacf49dbb6a358a3646e | /codility/cpp/codility_lesson13_1.cpp | 6e0c1a989f13a4822a9d5129e5a20535ffb75f5b | [] | no_license | wj1224/algorithm_solve | 259c39d2a85ecb2630e089eb0c86cdde9ff3baeb | 8b0f15b71a4dd8eb40d3c9baee003a0678c3f2aa | refs/heads/master | 2023-08-25T06:14:21.615802 | 2021-10-26T05:00:59 | 2021-10-26T05:00:59 | 219,981,525 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 715 | cpp | codility_lesson13_1.cpp | // you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
vector<int> solution(vector<int> &A, vector<int> &B) {
// write your code in C++14 (g++ 6.2.0)
int N = A.size();
vector<int> v;
int maxA = -99999999;
... |
dcf997ed5a6b902a1e5cbd6bb6632c017b92de50 | 61826c9bc454d3857bed864e29751f541d602106 | /test/spirit.cpp | 958f53f6c3983b52be7a811667b9b4302da86255 | [
"BSL-1.0"
] | permissive | reuk/strict-variant | d00f624b972f05cfc6947e03ff662f4a5065f046 | 7d0f1433d5126951b1af350213a0c7e75575fab0 | refs/heads/master | 2022-11-21T10:48:47.077949 | 2020-07-24T22:51:26 | 2020-07-24T22:51:26 | 282,328,692 | 0 | 0 | BSL-1.0 | 2020-07-24T22:41:09 | 2020-07-24T22:41:09 | null | UTF-8 | C++ | false | false | 2,421 | cpp | spirit.cpp |
#include <boost/spirit/include/qi.hpp>
#include <strict_variant/variant.hpp>
#include <strict_variant/variant_spirit.hpp>
#include <strict_variant/variant_stream_ops.hpp>
#include "test_harness/test_harness.hpp"
#include <string>
#include <type_traits>
namespace qi = boost::spirit::qi;
using str_it = std::string::... |
b49f604040abe232f1c394d129ee7b438c47c34f | d0fb46aecc3b69983e7f6244331a81dff42d9595 | /elasticsearch/src/model/CreateComponentIndexRequest.cc | 14d100f29094f591a72c46152a5d544c648ac529 | [
"Apache-2.0"
] | permissive | aliyun/aliyun-openapi-cpp-sdk | 3d8d051d44ad00753a429817dd03957614c0c66a | e862bd03c844bcb7ccaa90571bceaa2802c7f135 | refs/heads/master | 2023-08-29T11:54:00.525102 | 2023-08-29T03:32:48 | 2023-08-29T03:32:48 | 115,379,460 | 104 | 82 | NOASSERTION | 2023-09-14T06:13:33 | 2017-12-26T02:53:27 | C++ | UTF-8 | C++ | false | false | 1,790 | cc | CreateComponentIndexRequest.cc | /*
* Copyright 2009-2017 Alibaba Cloud 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... |
390a7af08e74d9a8c91b38ccfc50d359ba6ec459 | 41a0fa3b6fa55f2c278e06718a04ad38e645dfa0 | /leetcode/771.cpp | ea0fea24a54ec5bba74c3299c67f87e8b55514fd | [] | no_license | sharmarajdaksh/cp | d3a42bca8349fd958f2a3f19a173980d4aa94e44 | c0f900e14a4f502c647b0f40c2b00871e2fd43de | refs/heads/master | 2023-07-28T22:04:02.357209 | 2021-09-13T14:59:50 | 2021-09-13T14:59:50 | 277,243,723 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 449 | cpp | 771.cpp | #include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
int numJewelsInStones(string J, string S)
{
int stonesCount = 0;
for (char stone : J)
{
stonesCount += count(S.begin(), S.end(), stone);
}
return stonesCount;
}
};
int main()
{
S... |
565ad2e299374ae06e55d2c7bea96c30b5d943c0 | aaabf0a2e81cdb3eee5d4dec4e2b2e4f0753e71d | /3.8.1/3.8.1/3.8.1.cpp | 75897aa41d652838cc6069aeb35025c715bef015 | [] | no_license | Twelvecat/C- | ff51b7cd4d89fc4bc3f90cd3253510e1cfa6c375 | 25da356289a16b36b328eea15514169942ec7946 | refs/heads/master | 2020-04-11T18:58:24.867385 | 2018-12-17T02:23:19 | 2018-12-17T02:23:19 | 162,018,420 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 445 | cpp | 3.8.1.cpp | #include <iostream>
using namespace std;
int main() {
int i, b, c = 0, a = 0;
cin >> i;
b = i;
do {
while (a < i) {
for(;c < b - i;c++){
cout << " ";
}
a++;
cout << "*";
}
cout << '\n';
i -= 1;
a = 0;
c = 0;
} while (a < i);
int h, j, k;
for (h = 0; h < 9; h++) {
for (j = ... |
446677d90a5901bfdb5151d4058d8d9b7459799c | cdb43c308f4930b2e4138d9d5b5b030bf9e94176 | /src/energizer.h | 61a08ac353738421e0b07cc125dbb03b485283e1 | [
"CC0-1.0",
"BSD-3-Clause"
] | permissive | KDE/kapman | 91e783be57ed3f277fceec2e5d024b83a3250b28 | d26b250268c34ee59cff5012d39bf952f19a71ac | refs/heads/master | 2023-09-04T07:13:50.299648 | 2023-09-03T01:51:34 | 2023-09-03T01:51:34 | 42,719,065 | 12 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 1,295 | h | energizer.h | /*
SPDX-FileCopyrightText: 2007-2008 Thomas Gallinari <tg8187@yahoo.fr>
SPDX-FileCopyrightText: 2007-2008 Gaël Courcelle <gael.courcelle@gmail.com>
SPDX-FileCopyrightText: 2007-2008 Alexia Allanic <alexia_allanic@yahoo.fr>
SPDX-License-Identifier: GPL-2.0-or-later
*/
#ifndef ENERGIZER_H
#define ENERGI... |
56c59e161d7eb5ae33ef0031c1552565074486c8 | 88a98406c59299686031cd1842724ecc452d012b | /author-sol.cpp | 78f4f0438294c7b0ceff9a491d822b010ba7b0c4 | [] | no_license | mgalang229/Codeforces-1011A-Stages | 2287f740cac2fbfddd114fe94761cfae834a5c83 | f22d70e1d324a591cc1e0a3d668bbdc05e1ee15f | refs/heads/main | 2023-07-30T11:20:07.777976 | 2021-09-28T13:15:14 | 2021-09-28T13:15:14 | 411,211,974 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 809 | cpp | author-sol.cpp | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
string s;
cin >> s;
sort(s.begin(), s.end());
// set 'last' to (0 - 2 = -2), so we can include the first letter
char last = 'a' - 2;
int ans = 0;
int len = 0;
for (int i = 0; i < n;... |
409599b99bfbbb5f376d52fce6160fa37907bb8b | ece0df2446dae16ed5ff4891379924484e595f1a | /src/asnNodeSprite/CNodeGrid2D.h | 0209cbf098257941a92f4e596d3ff7fcc70ecdb2 | [] | no_license | RandomAmbersky/AmberSkyNet | 838376d5426254d8ee76bfaa5ab378d5f40d35a1 | fb7a10c6edd4691a0e65d06f11c32250df3c5707 | refs/heads/master | 2020-04-28T21:57:33.823704 | 2013-06-27T19:22:00 | 2013-06-27T19:22:00 | null | 0 | 0 | null | null | null | null | MacCyrillic | C++ | false | false | 1,256 | h | CNodeGrid2D.h | #ifndef _CNodeGrid2D_H
#define _CNodeGrid2D_H
#include "CNode.h"
#include "IDevice.h"
#include "Interfaces/ASNIGrid2D.h"
class CNodeGrid2D: public CNode, public ASNIGrid2D {
public:
CNodeGrid2D(IEngine* engine);
~CNodeGrid2D();
virtual bool LoadResource();
virtual bool Draw();
virtual void SetParam(const c... |
6efb304fec4e41f53f72ea606cf579c239ea6de2 | 8d16b45007096e0342c7e43a4155b5d6dc916b62 | /Algorithm/181-240/214_Shortest_Palindrome_1.cpp | 7d08a8b5835f5e917e7388317d9971ae9e2046fd | [] | no_license | FuzeT/LeetCode | f39b4830f76071b70129953353750de6870f0676 | 32d7876f4a182a8f279fe7d8e55a2560c808c399 | refs/heads/master | 2021-01-18T01:27:05.925990 | 2015-08-28T02:56:15 | 2015-08-28T02:56:15 | 33,971,620 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 855 | cpp | 214_Shortest_Palindrome_1.cpp | #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <math.h>
#include <inttypes.h>
#include <unordered_set>
using namespace std;
class Solution {
public:
string shortestPalind... |
d959e1a7313674861db877f181307a2cdfd039f3 | 192507eec73ab6736b5ecc90b8ba160aed090ad0 | /B_CfSeq.cpp | 9d19c4382759ce70193e888d70a27a46c4d7e366 | [] | no_license | SaadNoor555/cp-practice | 615af29e949e319d6ea058b12c5d2d81d07eaa5d | 70022373ed74017ae30e7c1ae381450f09f37c73 | refs/heads/master | 2023-07-01T05:16:44.071798 | 2021-08-08T21:05:45 | 2021-08-08T21:05:45 | 318,886,998 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 319 | cpp | B_CfSeq.cpp | #include<bits/stdc++.h>
using namespace std;
long long n,k,a[12],p;
string s;
int main(){
cin>>n;
for(k=1;k<=10;k++)
a[k]=1;
p=1;
while(p<n){
for(k=1;k<=10;k++){
p/=a[k];
a[k]++;
p*=a[k]; if(p>=n) break;
}
}
s="codeforces";
for(k=0;k<10;k++){
while(a[k+1]--){
cout<<s[k];
}
}
} |
89710c8634eb87a4a36901041cfe144f47a7276f | 935927010571e2f820e70cead9a1fd471d88ea16 | /Online Judge/Codeforces/Practice/1800/Password.cpp | b99d8a6fcf614bbc65769f911bc79f6eff14fdc4 | [] | no_license | muhammadhasan01/cp | ebb0869b94c2a2ab9487861bd15a8e62083193ef | 3b0152b9621c81190dd1a96dde0eb80bff284268 | refs/heads/master | 2023-05-30T07:18:02.094877 | 2023-05-21T22:03:57 | 2023-05-21T22:03:57 | 196,739,005 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 818 | cpp | Password.cpp | #include<bits/stdc++.h>
using namespace std;
string s;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
int n = s.size();
vector<int> lps(n+3,0);
for(int i=1,j=0;i<n;i++){
while(j > 0 && s[j] != s[i])j = lps[j-1];
if(s[j] == s[i])j++;
lp... |
8d8e8f7b4bec074f84fbc60699dae104b9a8215e | 3efc50ba20499cc9948473ee9ed2ccfce257d79a | /data/code-jam/files/1836486_mayorandrew_1484496_0_extracted_A.cpp | 6de22fd4f43759f320631fd861f0d7210341e301 | [] | no_license | arthurherbout/crypto_code_detection | 7e10ed03238278690d2d9acaa90fab73e52bab86 | 3c9ff8a4b2e4d341a069956a6259bf9f731adfc0 | refs/heads/master | 2020-07-29T15:34:31.380731 | 2019-12-20T13:52:39 | 2019-12-20T13:52:39 | 209,857,592 | 9 | 4 | null | 2019-12-20T13:52:42 | 2019-09-20T18:35:35 | C | UTF-8 | C++ | false | false | 2,091 | cpp | 1836486_mayorandrew_1484496_0_extracted_A.cpp | #include <iostream>
#include <fstream>
#define SMALL
//#define DEBUG
using namespace std;
int S;
int *var;
bool working=true;
void increase(int k=0){
if(S-k>=1){
var[S-k-1]++;
if(var[S-k-1]==3){
var[S-k-1]=0;
increase(k+1);
}
}else{
... |
dc66d09f46730f1c7ec05723f1164f03fa4eb47f | 307d3837d31f9e3728af2b62ca51ebf63fe6ec6b | /hall_of_fame/wi-seong-cheol/PGS/2019 KAKAO BLIND RECRUITMENT/무지의 먹방 라이브.cpp | 9a637ac96c272c296acd7460147b75ad76874d1a | [] | no_license | ellynhan/challenge100-codingtest-study | 905043497d154b8a7333ca536e536d013f6e7454 | bcdc6d04f13b12ba80b42e066f9d244d7c2cc698 | refs/heads/master | 2023-09-01T14:10:13.481013 | 2023-08-27T14:38:52 | 2023-08-27T14:38:52 | 401,561,230 | 162 | 176 | null | 2023-09-09T14:56:25 | 2021-08-31T03:30:36 | C++ | UTF-8 | C++ | false | false | 1,233 | cpp | 무지의 먹방 라이브.cpp | //
// 무지의 먹방 라이브.cpp
// wi-seong-cheol
//
// Created by wi_seong on 2023/03/03.
//
// 시간복잡도: O(n)
// 최악시간: 200,000
// 난이도: Level 4
// Timer: 1h
// Url: https://school.programmers.co.kr/learn/courses/30/lessons/42891
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define ll... |
c5a8d32f1b0509217202af7bd6a0d6f6b4f0bdfc | acf30fa254f72c282fce77b22dced66b21f8277d | /src/commands/certificatetopivcardcommand.h | bb92e524ed55607e4c7b7dff5ccc7a1921ce51fd | [
"CC0-1.0",
"BSD-3-Clause"
] | permissive | KDE/kleopatra | fc879c3d1f9fa4e7f54ebcb825eaea8705386d72 | 3e6db6e439bbb62886dd58cfc4239f256fec5415 | refs/heads/master | 2023-08-18T04:37:13.963770 | 2023-08-16T21:17:25 | 2023-08-16T21:17:34 | 53,312,712 | 84 | 16 | null | 2020-12-29T18:58:39 | 2016-03-07T09:27:39 | C++ | UTF-8 | C++ | false | false | 851 | h | certificatetopivcardcommand.h | /* commands/certificatetopivcardcommand.h
This file is part of Kleopatra, the KDE keymanager
SPDX-FileCopyrightText: 2020 g10 Code GmbH
SPDX-FileContributor: Ingo Klöcker <dev@ingo-kloecker.de>
SPDX-License-Identifier: GPL-2.0-or-later
*/
#pragma once
#include <commands/cardcommand.h>
namespace Gp... |
313aa3fe6e6dd88c2383c7da11eb974eef1e75ac | 4579eaaeabeaa4d945ec9e0c802ec28bbb9aa8ef | /cse461/lab1/lab1.cpp | 27769383d526ccbdf3dcfbdda12271163d124ee3 | [] | no_license | CircuitMonster/School | bbed854f3ff5e8ae859c68c9c5a6be609fdd14cb | e6e71ce8c0beb3791958949245a7665908caa3de | refs/heads/master | 2021-01-22T19:59:52.686214 | 2017-03-17T04:41:06 | 2017-03-17T04:41:06 | 85,271,605 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,507 | cpp | lab1.cpp | #include <iostream>
#include <string>
#include <vector>
#include <fstream>
using namespace std;
class PasswordFile
{
public:
PasswordFile(string filename); // opens the file and reads the names/passwords in the vectors user and password.
void addpw(string newuser, string newpassword); //this adds a new user/passwor... |
e97f4e283dc802ffa690dabd34c5914a5c355212 | 04a540847c1333c987a1957fd8d31197c594f6bb | /BOJ/17609_1.cpp | d1fb43141bdc94dd3423e13fd4a2f70cb1640abb | [] | no_license | k8440009/Algorithm | fd148269b264b580876c7426e19dbe2425ddc1ab | a48eba0ac5c9f2e10f3c509ce9d349c8a1dc3f0c | refs/heads/master | 2023-04-02T16:06:10.260768 | 2023-04-02T11:04:32 | 2023-04-02T11:04:32 | 200,506,643 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,296 | cpp | 17609_1.cpp | // 회문
// https://www.acmicpc.net/problem/17609
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int N;
string str;
int alpha[26];
bool sudoPalin(int left, int right, bool flag)
{
if (left > right)
return true;
if (str[left] == str[right])
return sudoPalin(left + 1,... |
2428d729588a7c7e86c72843030bb4e44eeb07d9 | 95c0ba4895954c26bcd18d827a01cf369044eb45 | /src/C/t.cpp | 3efae48e5a95259707d4e2357bf49290a83b82de | [] | no_license | odedns/oldsrc | dc71099f2d75974acda7a9d6552641f7c90b94c5 | c722106a1ffcc6002a9b8b01d52bf1a8e19afc1e | refs/heads/master | 2022-11-16T04:05:34.803679 | 2020-07-08T17:34:14 | 2020-07-08T17:34:14 | 268,712,648 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 74 | cpp | t.cpp |
#include <iostream.h>
void main(void)
{
cout << "test ...." << endl;
}
|
d93b63631f07430e8dcd7c2a7f66848156acd515 | 447872e198e67cf5efe21d3c71b65366ee754b4a | /Graphics Programming Assignment/Project 1/glutapp3d/floor.cpp | fb2eac6c6cd7376d6b85d5b99f95f81bda630a2b | [] | no_license | Anghagaed/GraphicsPA | 1496acbd1a15b5d86f01a8fbc4b9f08c3892fd59 | 90afe247af8597db6e36cf3f0af5fd942778e517 | refs/heads/master | 2021-03-22T04:06:31.294934 | 2017-05-11T16:45:20 | 2017-05-11T16:45:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,812 | cpp | floor.cpp | #include "floor.h"
using namespace std;
SoFloor::SoFloor()
{
_numpoints = 0;
x = 0.0f; y = 0.0f; z = 0.0f; l = 0.0f; w = 0.0f;
}
void SoFloor::init(float x, float y, float z, float l, float w, string imagePath)
{
this->x = x; this->y = y; this->z = z; this->l = l; this->w = w; this->imagePath = imagePath;
_vshp... |
64bb08575e74dff6bb47906c2e098c47458b3b5e | 7479d6306e386265502c7fd5d0e0670d90c1b499 | /zsqlite/snappy-sqlite.cc | 5b0737a3c45c495ffd3bd3f399e529a184800b69 | [] | no_license | bramp/zsqlite | a21501036be3d23c89f39f09181098c171c9e57d | de794d04934ad428a84a783c0dd93425a17275bb | refs/heads/master | 2023-03-19T17:13:21.565279 | 2012-09-18T03:00:36 | 2012-09-18T03:00:36 | 5,848,430 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,585 | cc | snappy-sqlite.cc | #include <string>
#include <iostream>
#include <iterator>
#include <fstream>
#include <vector>
#include <cerrno>
#include <cstring>
#include <stdexcept>
#include <assert.h>
#include <stdint.h>
#include <snappy.h>
#include <lzo/lzoconf.h>
#include <lzo/lzo1x.h>
using namespace std;
using namespace snappy;
// funct... |
0dca038e6ba128d907df0478cc27b6584842fb85 | faa932aa4c28315ee8175c3307b1b5cf53ac8d43 | /GenerateRandomNumNotInList.cpp | 6d1076a5fd33bcc26d46e978b2736daab67eb290 | [] | no_license | bsarvan/code_algorithms | 2daad99da90894d830f5fc38d647cfae49141821 | 43855386c3646bd84effacef3362b925835d6ba0 | refs/heads/master | 2023-06-09T12:39:56.112624 | 2021-06-27T14:15:55 | 2021-06-27T14:15:55 | 380,757,573 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,395 | cpp | GenerateRandomNumNotInList.cpp | //
// main.cpp
// GenerateRandomNumNotInList
//
// Created by bsarvan on 05/09/19.
// Copyright © 2019 bsarvan. All rights reserved.
//
/*
Given an integer n and a list of integers l, write a function that randomly generates a number from 0 to n-1 that isn't in l (uniform).
Solution -
One way we can appro... |
32f9c21de26aad2e6bb76571624fd4df34fedf11 | 1c3f319b03fe3e1da903390123972dd2958d80a2 | /10474 - Where is the Marble.cpp | 13bca07c622a0ac09a518fa87d106ecc005e738b | [] | no_license | AhmadRehan98/UVA | cbf29f74cc53cf6b631c225f96982fe1f102b7f8 | 0dc4ade955abcdce6f9d9bab8ba52d906f2c4cea | refs/heads/master | 2021-09-25T14:20:10.649495 | 2018-10-22T21:13:00 | 2018-10-22T21:13:00 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 827 | cpp | 10474 - Where is the Marble.cpp | #include <bits/stdc++.h>
using namespace std;
int arr[10000];
int binary_search (int start , int end , int x){
while (start < end){
int mid = start + (end - start)/2;
if (arr[mid] < x) start = mid+1;
else end = mid;
}
if (arr[start] == x) return start+1;
else return -1;
}
int mai... |
240bd18be5cca417ede69d237ed9ba5198360ebe | bde0c2cf8ac40e8ffee74e8f2db92d928571f954 | /ATM.cpp | c74ffeaa515c4a30601f3647e6806c9a177d1c95 | [] | no_license | happyy07/ATM | 978f071ece3d9be2f2be7c09b3cda8f18c816de9 | 4a4d1e1621d98bcb2356488971236c151944781e | refs/heads/main | 2023-02-24T15:19:46.685661 | 2021-02-04T20:03:03 | 2021-02-04T20:03:03 | 336,068,420 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,083 | cpp | ATM.cpp | #include"ATM.h"
void main()
{
User tabUser[25];
User ur;
short nb, choice, i,cpin;
int final_income;
string Nip;
while(true) {
system("cls");
displayTitle("banque royale");
displayTitle("guichet automatique bancaire");
nb = openFile(tabUser);
i = getNumero(tabUser, nb);
if (i ... |
91562e86fec3f4abc6561bae28bc9dde944a42a2 | 50d028afa24b18a3508a68b24aa5ade2c0a6a9ab | /Project1/Makestars.cpp | fc39c528a86c649d764a0d3801390a1545095d9f | [] | no_license | ThanakomFl/CG_Solar_system | 44085c770a64f338705dce9a758f36bf3f0cebb1 | ab0827859432a1cbe307420ec72ab00c14f2d02e | refs/heads/master | 2020-05-30T09:10:41.320175 | 2019-05-31T17:57:46 | 2019-05-31T17:57:46 | 189,636,706 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,404 | cpp | Makestars.cpp | #include "Makestars.h"
Makestars::Makestars()
{
}
void Makestars::Makestar(float r, int n, float kx, float ky, float red, float green, float blue)
{
glBegin(GL_POLYGON);
for (int i = 1; i <= n; i++)
{
theta = 2.0 * pi * (float)i / n;
x = kx + r * cos(theta);
y = ky + r * sin(theta);
glC... |
2581787919838875c54330c04824f4197b8711de | 8875effac15cf5d5fc665c4ab0c479979f3ce913 | /codeforces/614/c.cpp | 4da628a51c12e33ee3a8b52f77c815cb8366c853 | [] | no_license | modanhan/problem-solving | 03bee4a27a7d10a335d79e190e7760128fcfadeb | 9a98f0e87cf87dd75e4a7c8ebf13adef9976182c | refs/heads/master | 2021-09-06T22:29:40.869818 | 2018-02-12T16:25:32 | 2018-02-12T16:25:32 | 27,393,777 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,620 | cpp | c.cpp | #include <bits/stdc++.h>
using namespace std;
# define PI 3.14159265358979323846
typedef pair<double, double> dd;
int n;
vector<dd> v;
double maxd = 0, mind = 10000000000;
double cx, cy, px, py, cd, x, y;
int main() {
cin >> n >> x >> y;
v.assign(n, dd(0, 0));
cin >> v[0].first >> v[0].second;
cx = v[0].... |
0f9b532628792be74a50f57ac18e77c261f623de | 44f04b8f2b6c0dba51f1e998985d3a9e8540715f | /HDU/5411/p.cpp | 99210f0a1c42a9c5355f0801379c0389573bcf95 | [] | no_license | GuessEver/ACMICPCSolutions | 2dd318a45939711eff1dd208cffc05a029b38130 | 909927778efd77ca9ec8e18aed3ff22c167d2a33 | refs/heads/master | 2020-05-18T20:52:32.359955 | 2015-11-04T08:31:43 | 2015-11-04T08:31:43 | 29,720,059 | 5 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 731 | cpp | p.cpp | #include <cstdio>
#include <vector>
using std::vector;
const int N = 50 + 10;
const int mod = 2015;
vector<int> v[N];
int n, m;
int res;
int ans[N];
void dfs(int x, int deep)
{
if(deep > m) return;
(res += 1) %= mod;
(ans[deep] += 1) %= mod;
for(vector<int>::iterator it = v[x].begin(); it != v[x].end(); it++)
d... |
eb76bbe3f1ca377c58905ae6960121588b3013b5 | f96d6d7e2c46d375d1662ff0e4567c2c7f771856 | /display_standard.cpp | 3edb6d7125d97d39c0237a90711c6d7e0576d40a | [] | no_license | jose3ww/akafugu_nixie_clock | 5195066ce496284691f138e30e4c881290ccba79 | 70d570a419afa4dc061a5fbfc66ae6b3367f4b46 | refs/heads/master | 2020-04-28T02:24:08.433585 | 2019-05-15T11:01:21 | 2019-05-15T11:01:21 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,054 | cpp | display_standard.cpp | /*
* The Akafugu Nixie Clock
* (C) 2012-13 Akafugu Corporation
*
* This program is free software; you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation; either version 2 of the License, or (at your option) any later
* version.
... |
f85630affe850054ac54f517d96dda21350c9cb9 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/collectd/gumtree/collectd_repos_function_1418_collectd-4.9.1.cpp | a70959a9db710d7d472f54726a76fe2f85b72103 | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,233 | cpp | collectd_repos_function_1418_collectd-4.9.1.cpp | static int cpy_write_callback(const data_set_t *ds, const value_list_t *value_list, user_data_t *data) {
int i;
cpy_callback_t *c = data->data;
PyObject *ret, *v, *list;
CPY_LOCK_THREADS
list = PyList_New(value_list->values_len); /* New reference. */
if (list == NULL) {
cpy_log_exception("write callback");
... |
5109cc8e26439bbe8d0cdb32f2729659f5fe4f7c | 972bd8f69bb508559d8848853c3fe2e50ae20db4 | /ride/wx.h | f8e0cd54aeb3cc260435758284d27ff2d414949a | [
"MIT"
] | permissive | zhangf911/ride | 2d0efdc5ba4eab133a54f494d9dc828f629f108c | d609cf94bfbd3a669e51beb2adc0294d9b24fcc7 | refs/heads/master | 2020-04-06T05:25:10.061137 | 2015-04-07T21:56:18 | 2015-04-07T21:56:18 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 433 | h | wx.h | #ifndef RIDE_LOCALWX_H
#define RIDE_LOCALWX_H
// hopefully this fixes this error:
// http://stackoverflow.com/questions/13219007/xcode-4-5-tr1-type-traits-file-not-found
#include <ciso646> // detect std::lib
#ifdef _LIBCPP_VERSION
// using libc++
#define HAVE_TYPE_TRAITS
#else
// using libstdc++
#define HAVE_TR1_TY... |
88d9657dfa2bcf0d100499d510e304694bc210d9 | 019f238b82b1207286615d1078ae868b55ebcbda | /pimpl_unique_ptr_test/three.h | 8885e4c65f1f4286cd30a513880a144833f5090a | [] | no_license | heshanu3d/cpp-tips | 98077e9c7bd6c6cd3693399ea13b0e672eaa0ab8 | a6959b8bfdbdac7920f912a58edf85e254c06835 | refs/heads/master | 2023-02-17T01:42:29.113587 | 2020-12-23T17:00:48 | 2020-12-23T17:00:48 | 323,954,390 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 152 | h | three.h | #pragma once
#include <memory>
class four;
class three {
public:
// ~three();
~three() {}
void func();
std::unique_ptr<four> fouru;
}; |
8b75728c951d8a2d31eefce399a1b2d313d7e81d | 24004e1c3b8005af26d5890091d3c207427a799e | /Win32/NXOPEN/NXOpen/CAE_ResponseSimulation_ExcitationBuilder.hxx | d52bf5fc3ab758c6b6e4e2dbdf860c00c5aadc3d | [] | no_license | 15831944/PHStart | 068ca6f86b736a9cc857d7db391b2f20d2f52ba9 | f79280bca2ec7e5f344067ead05f98b7d592ae39 | refs/heads/master | 2022-02-20T04:07:46.994182 | 2019-09-29T06:15:37 | 2019-09-29T06:15:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,619 | hxx | CAE_ResponseSimulation_ExcitationBuilder.hxx | #ifndef NXOpen_CAE_RESPONSESIMULATION_EXCITATIONBUILDER_HXX_INCLUDED
#define NXOpen_CAE_RESPONSESIMULATION_EXCITATIONBUILDER_HXX_INCLUDED
//--------------------------------------------------------------------------
// Header for C++ interface to JA API
//----------------------------------------------------------------... |
3ae1f5ce5f9890d7fa4e0b2a3ddf2a513cb7297c | 6c2e25fac94f6aa4f27de58a6af74de83d2f92de | /main.cpp | 7bd9c3dee29a310b5e25bdb1bfe64077c2fabdf1 | [] | no_license | integral96/Simf_diff | 960e3de78d0dbefaa4d58150f396a86941e377a9 | 3f3b9b0eac90871ea24a42ba133fbf0845c4962f | refs/heads/main | 2023-03-07T03:08:51.153604 | 2021-02-19T14:14:20 | 2021-02-19T14:14:20 | 340,389,214 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,716 | cpp | main.cpp | #include <iostream>
#include <sstream>
#include <boost/hana.hpp>
#include <boost/hana/assert.hpp>
#include "simvolic_diff.hpp"
namespace hana = boost::hana;
using namespace hana::literals;
using namespace std::literals;
constexpr auto A = hana::make_set(hana::int_c<1>, hana::int_c<3>, hana::int_c<5>, hana::int_c<7... |
4084de091bad943addf3b267efd95be9e5b91686 | 527739ed800e3234136b3284838c81334b751b44 | /include/RED4ext/Types/generated/scn/BraindancePaused_ConditionType.hpp | 961f235b9a925f00c338123a562651ccd6e7d4f1 | [
"MIT"
] | permissive | 0xSombra/RED4ext.SDK | 79ed912e5b628ef28efbf92d5bb257b195bfc821 | 218b411991ed0b7cb7acd5efdddd784f31c66f20 | refs/heads/master | 2023-07-02T11:03:45.732337 | 2021-04-15T16:38:19 | 2021-04-15T16:38:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 689 | hpp | BraindancePaused_ConditionType.hpp | #pragma once
// This file is generated from the Game's Reflection data
#include <cstdint>
#include <RED4ext/Common.hpp>
#include <RED4ext/REDhash.hpp>
#include <RED4ext/Types/SimpleTypes.hpp>
#include <RED4ext/Types/generated/scn/IBraindanceConditionType.hpp>
namespace RED4ext
{
namespace scn { struct SceneResource;... |
c59a6e12f9f4c08cbf14a132520f4694df26d6f0 | 3f0366faff8b3c8ff0282e8b3179859db2a0caa3 | /src/GeekyMQTT.cpp | 9c0aba2411fc3e1238ff6971e86a49af51df6abf | [
"MIT"
] | permissive | Ravi-Pansuriya/GeekyMQTT | 438f8d686a991210748ed972b22131db1ec2e267 | a9c0e7bd48841c393f3cfe84ebc47eef742a5888 | refs/heads/master | 2020-04-18T11:30:21.625008 | 2019-02-11T09:16:28 | 2019-02-11T09:16:28 | 167,502,278 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,376 | cpp | GeekyMQTT.cpp | #include "GeekyMQTT.h"
#include <WiFi.h>
GeekyMQTT::GeekyMQTT(Client& client, String username, String password){
_client.setClient(client);
_username = username;
_password = password;
}
void GeekyMQTT::setServer(const char* mqttHost, int port){
_client.setServer(mqttHost, port);
}
String GeekyMQTT::clientId(... |
e043512022c0507a99735dc5fe844219e1f557af | ec2b398e7ea27813cfbdde046adbf844c7a81638 | /Assignment 3/BigInt.h | 6c2407c17f21b4778036c1d4cfa346cd1ee7c3d3 | [] | no_license | matthynes/CS2510 | eebce9d3f0dd97d8ac9a84caa04e9dc7592079ac | 05b7c5ebb081f634c46f239a58e3d61085c7a667 | refs/heads/master | 2021-01-17T12:45:53.978908 | 2016-07-30T14:10:33 | 2016-07-30T14:10:33 | 59,024,740 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 519 | h | BigInt.h | // Matthew Hynes (201200318)
#ifndef BIGINT_H
#define BIGINT_H
#include <vector>
#include <string>
#include <iomanip>
#include <ostream>
class BigInt {
public:
BigInt();
BigInt(std::string strInt);
std::vector<int> getBigInt() const;
friend std::ostream &operator<<(std::ostream &os, const BigInt &... |
69b5bfccc99818bb727643498c9470e5de649d4b | 71ec6111129da5fa053791303fe33dc726ab0b7f | /Insomnia/insomnia.h | a003161ca8765fd1ee5f15ee1391f915f7d77d64 | [
"MIT"
] | permissive | KrossX/Insomnia | 62f2887392829237424f2fc5e74556671af6d79f | 53cd8c5ba413795ded8f4bc206a17d8106fac2f9 | refs/heads/master | 2021-01-18T20:20:38.777287 | 2015-11-12T00:54:23 | 2015-11-12T00:54:23 | 13,973,765 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 226 | h | insomnia.h | /* Copyright (c) 2012 KrossX <krossx@live.com>
* License: http://www.opensource.org/licenses/mit-license.html MIT License
*/
#pragma once
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#include <string>
#include <list>
|
71150592630d1484fa9afc2a8584410e2bdda5db | c6e7f3bee051fe906295fdf8bfe7dedd5158f7a6 | /1551020_Week06/ex2g/function.cpp | a1a2955a2e391effdd3ae589bd7d873db7a80a45 | [] | no_license | luong-komorebi/CS161 | 81066209c26158705951febab9ed94fcc80af94a | e21f292166db110b1c79f7403eedb357b0776f71 | refs/heads/master | 2021-06-08T16:21:25.992353 | 2016-12-20T03:31:46 | 2016-12-20T03:31:46 | 59,763,771 | 1 | 0 | null | 2023-09-07T08:43:09 | 2016-05-26T15:56:21 | C++ | UTF-8 | C++ | false | false | 276 | cpp | function.cpp | #include "function.h"
int prime ( int n)
{
bool check=true ;
for (int k=2; k<= n; ++k)
{
for ( int i=2 ; i<= sqrt(k*1.0); ++i)
{
if (k%i ==0)
{
check = false;
break;
}
check = true ;
}
if ( check == true )
cout << k << " " ;
}
return 0;
}
|
d704fb8d6f9ab11de70e1f2286b31327cce9b8ee | c9cf0586ace11aa32fa67606d237a130a06364ee | /circular-cylinder-2-40/12.6/p | 720077ebef103354cd17f92a33205fcbc0bfdba2 | [] | no_license | jezvonek/CFD-Final-Project | c74cfa21f22545c27d97d85cf30eb6dc8c824dc1 | 7c9a7fb032d74f20888effa0a0b75b212bf899f4 | refs/heads/master | 2022-07-05T14:43:52.967657 | 2020-05-14T03:40:56 | 2020-05-14T03:40:56 | 262,370,756 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 89,405 | p | /*--------------------------------*- C++ -*----------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Version: 6.0
\\/ M anipulation |
\*-----... | |
9474367361ed53835479a257b554c7d35b2c43fa | ea89955e343ced5e705b4a338039e658a4ba67cb | /Session14-RaveGun/Behavior/PursueBehavior.cpp | e8c1c80194262eb15af02cd0db73fc22ffcf089c | [] | no_license | kennethdmiller3/videoventure | 775ce24ee4aebe3dfc65876a3fc9abb93f29b51d | 7182b78fde61421c48abc679ef6f2992e740d678 | refs/heads/master | 2021-06-03T19:26:26.704306 | 2020-07-25T05:37:02 | 2020-07-25T05:37:02 | 32,195,803 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,532 | cpp | PursueBehavior.cpp | #include "StdAfx.h"
#include "PursueBehavior.h"
#include "TargetBehavior.h"
#include "BotUtilities.h"
#include "Controller.h"
#include "Entity.h"
namespace Database
{
Typed<PursueBehaviorTemplate> pursuebehaviortemplate(0xb9b0800f /* "pursuebehaviortemplate" */);
Typed<PursueBehavior *> pursuebehavior(0x... |
121c37d7656561ad0eaa803a9dbeb228d7cd3f37 | a7c8006328872180ce8500c90ade1ca324f569a1 | /10003.cpp | 1f6c37eeaf396ffb85633a02301daa08513f13da | [] | no_license | ChilleFlex/UVA_solves | f79f1f7e73c480897b1b9ff3d07bf66cdbcbf913 | 9b7f7d8b86529e1f549b4af8581a8a4527103aa1 | refs/heads/main | 2023-04-08T09:30:56.514949 | 2021-04-13T10:51:40 | 2021-04-13T10:51:40 | 357,518,589 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,190 | cpp | 10003.cpp | #include <bits/stdc++.h>
const int N = 1005;
const int MOD = 1000000007;
using ll = long long;
using namespace std;
void __print(int x) {cerr << x;} void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;} void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;} void... |
f16c66f9a5e0c92cdfcb7c456457a065433b9cc0 | b744863237d0843a22dd215240a32120dc6e2b6e | /examples/Eficiencia/Regleta/Regleta.ino | 6eb000923cd16860326e7f091da74ef02f96b16f | [] | no_license | guadalinfo/SmartCities_Library | 7f04bbeb67cc7f6ad6c49ff48636dd9585c99519 | 40543f2169c894143daf9e803086202329945dbe | refs/heads/master | 2020-03-10T02:35:38.315415 | 2018-07-18T06:29:26 | 2018-07-18T06:29:26 | 129,140,186 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,091 | ino | Regleta.ino | /*
Control remoto de una regleta que mide el consumo y lo muestra por el LCD
Usa RTC para establecer con precision el tiempo
Conexion del LCD
-----------------------------
Vin (Voltage In) -> 5V
Gnd (Ground) -> Gnd
SDA (Serial Data) -> A4 on Uno/Pro-Mini, 20 on Mega2560/Due, 2 Leonardo/Pro-Micro
SCK (Se... |
493fcbe0690ff0f9ba8462ba6819304006949740 | 044c978d905ee64657e76b7fddc4410c7527dfa9 | /stolyarov.alexey/B3/phoneBook.cpp | 4e86d05a26f62c67b71e822071efad8c2294194e | [] | no_license | sdimosik/spbspu-labs-2020-904-4 | bbbb2e6e7d64f28646a9eea3f8f3c10a49f3d913 | 1adedb23a08f345b7e975b78814b8a7fdbb5a736 | refs/heads/master | 2023-06-04T17:01:25.310853 | 2020-12-15T20:57:28 | 2020-12-15T20:57:28 | 378,229,599 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 822 | cpp | phoneBook.cpp | #include "phoneBook.hpp"
void PhoneBook::show(iterator it) const
{
std::cout << it->number_ << " " << it->name_ << "\n";
}
void PhoneBook::pushBack(const PhoneBookNote& note)
{
noteList_.push_back(note);
}
PhoneBook::iterator PhoneBook::deleteBookmark(iterator it)
{
if (noteList_.empty())
{
return noteLi... |
0682e448e8261cd47ef3378ae02ad4f23a9ff003 | ba4b9465a3d33564dc956d682217cd9e881c00cf | /main.cpp | adb7bc7af5578a2047f7089e9e9071736594e6df | [] | no_license | nashvent/aEstrella | ee0cc0b732edd8b95db36e993779f690381bbfca | 1c467c56fb6e2e98765b0c664555113092c82236 | refs/heads/master | 2021-08-28T15:16:04.149723 | 2017-12-12T15:17:04 | 2017-12-12T15:17:04 | 112,461,041 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,729 | cpp | main.cpp | #include <bits/stdc++.h>
using namespace std;
float D=100.2;
double tiempoConsumido=0;
template<class T>
T dEuclidiana(T*a,T*b){
return abs(a[0]-b[0])+abs(a[1]-b[1]);
}
template<class T>
T dEuclidianaManhatan(T*a,T*b){
return (abs(a[0]-b[0])+abs(a[1]-b[1]))*D;
}
template<class T>
T dEuclidiana2(T*a,T*b){
T Dx=a... |
a630e5a3dc36f4b11cae720224b62261cec72fea | 9556aa97e91ea3c6d219128d7e821393cfc850fc | /Thirdparty/Gc/Math/Constant.h | 1ff197bdcead583d219e7be13fe3bde03a6090cd | [
"LGPL-2.1-only",
"LicenseRef-scancode-other-permissive",
"MPL-2.0",
"GPL-3.0-only",
"BSD-3-Clause",
"BSL-1.0",
"Apache-2.0",
"MIT"
] | permissive | dyollb/osparc-iseg | 2f033b46f94dd4264489894618b9ab5554e9c8cb | 9b85cdce87f589b216914782f4b2b8b6ed69bf06 | refs/heads/master | 2023-05-28T00:43:36.689182 | 2023-05-12T14:26:15 | 2023-05-12T14:26:15 | 126,824,315 | 1 | 0 | MIT | 2019-02-26T13:45:48 | 2018-03-26T12:19:25 | C++ | UTF-8 | C++ | false | false | 1,328 | h | Constant.h | /*
This file is part of Graph Cut (Gc) combinatorial optimization library.
Copyright (C) 2008-2010 Centre for Biomedical Image Analysis (CBIA)
Copyright (C) 2008-2010 Ondrej Danek
This library is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Publi... |
d7bb5bd0b2b7b8f4ad9070950772e26243e4e5d6 | 9ef9a26801cb9c5e733f1b75ad3037034ed10a46 | /code/vj/kuangbin7/g.cpp | 2d8bfc48bda50441be79a2a115200639cdbbddd3 | [] | no_license | shi-yang/algorithms | 5c8e07fdff4689a5790f329153c0fe18ba0ce65a | cb7a75fdfa1af6c83625ab7f6930710965337776 | refs/heads/master | 2021-07-17T02:14:40.713967 | 2017-10-25T12:43:32 | 2017-10-25T12:43:32 | 82,473,964 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,226 | cpp | g.cpp | #include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 50005;
struct edge {
int mi, mx;
} e[maxn << 2];
void pushup(int rt)
{
e[rt].mi = min(e[rt << 1].mi, e[rt << 1 | 1].mi);
e[rt].mx = max(e[rt << 1].mx, e[rt << 1 | 1].mx);
}
void build(int l, int r, int rt)
{
if (l == r) {
int x;
scanf("... |
9aeb12119d25b059f6d91f55b747c6c052b70985 | 87f37ee31b50d4df37c98ee3df2569de4052d6e3 | /Person-Recognizer/main.cpp | 756a41e26367c890ed556e0f214eba32e56ca1cb | [] | no_license | liu6tot/CV_tutorial | d890a85d4707a198e517571c583951d231aa949a | 1d9705fdb354451b57f161b891290845d1b32b6b | refs/heads/master | 2021-01-23T01:26:07.033497 | 2017-03-31T07:45:22 | 2017-03-31T07:45:22 | 85,906,895 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,005 | cpp | main.cpp | /*
* File: main.cpp
* Author: Eyal Arubas <EyalArubas at gmail>
*/
/** Includes: **/
#include <cstdlib>
#include "defs.h"
#include "FramesReader.h"
#include "FramesWriter.h"
#include "CsvWriter.h"
#include "FaceDetector.h"
#include "PersonRecognizer.h"
using namespace std;
void read_training_set(const string &... |
dd5753225d8323d367f1caeaa073a85998e5c5ef | 55903a9564931b4579e5c5030376f0989d15b00e | /P2pNet/UdpCmdCallBack.h | 9a57033b82ef55636be7e02257f2d68fb117ff76 | [] | no_license | zhenyouluo/liveshow_r2 | 04b391fd9ba4e809a88aa1e4eed1477ac4e9ef88 | 300441c14ed31cfa10ec0459bac5a67693f592ea | refs/heads/master | 2020-12-26T00:35:26.403288 | 2012-09-10T02:28:22 | 2012-09-10T02:28:22 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 566 | h | UdpCmdCallBack.h | #pragma once
#include "cmdbase.h"
class PeerMgr;
class UdpCmdCallBack :
public UdpCmdBase
{
public:
UdpCmdCallBack(void);
~UdpCmdCallBack(void);
//处理指令
virtual int process(PeerMgr &mgr,UdpListenerTask &udp_task_,ACE_INET_Addr &remote_addr_);
//反序列化数据
virtual void deserialize(const char* buffer_... |
f9a2571019197ee76e42141b2a462ddb7c352b87 | 16c394831912c70b47edb63903884f37d90bc7b5 | /interface/SelectionFit.h | 69bbc029c9fee96718ef1212558d28cc5610a5c2 | [] | no_license | matthewkenzie/Bs2KstKst | 19d48b7a42f9b364bbf5a078c7ea523b6af84745 | 411af400f92f82400606a3f21de5b68659507546 | refs/heads/master | 2021-01-13T14:28:13.867620 | 2015-04-20T11:00:45 | 2015-04-20T11:00:45 | 24,888,071 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 357 | h | SelectionFit.h | #ifndef SelectionFit_h
#define SelectionFit_h
#include "../interface/FitterBase.h"
class SelectionFit : public FitterBase {
public:
SelectionFit(TString wsname="w");
~SelectionFit();
void addObsVars();
void addCuts();
void addDatasets();
void constructPdfs();
void run();
private:
... |
1cb40f93a86832ac080bc34bf475a04d71b67b60 | 18fc6586d07398a2766ac7343ba63bc924d94350 | /include/eventpp/httpc/response.hpp | 16cdab83b3ec7a8efbf0d26966223e15f503b433 | [
"BSD-3-Clause"
] | permissive | msaf1980/eventpp | 6790e44f5b17e51c02fb61f1fca15b8344b65ff8 | 10c291a10f81b79501e1f207a66a5cc6a5da444c | refs/heads/master | 2023-07-13T22:26:27.617410 | 2021-08-24T18:05:00 | 2021-08-24T18:05:00 | 399,223,906 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 943 | hpp | response.hpp | #ifndef __EVENT_RESPONSE_HPP__
#define __EVENT_RESPONSE_HPP__
#include <map>
#include "eventpp/base.hpp"
#include "eventpp/event_loop.hpp"
#include "eventpp/slice.hpp"
struct evhttp_request;
namespace eventpp {
namespace httpc {
class Request;
class EVPP_EXPORT Response {
public:
typedef std::map<eventpp::Slice,... |
353ca087fc4681e03fa537c26a02b562fdbd3e26 | 2d767e619daa46871c93d98007f78974d444ab71 | /message.cpp | e928281f5370d87fe0a23a5a22fb04664a7cded2 | [] | no_license | mrbrainsample/qtnotifydaemon | ec033fa45528fbbf9c1217db654edbb1a9431ca4 | 642698c9aeda5fdd0707cb1df9f9faa944ba71b5 | refs/heads/master | 2020-12-10T04:29:37.008666 | 2017-03-02T04:19:57 | 2017-03-02T04:19:57 | 83,618,323 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 474 | cpp | message.cpp | #include "notifyarea.h"
#include <QPixmap>
Message::Message()
{
timeout = 3000;
urgency=1;
id = 0;
app_name = "";
text = "";
header = "";
isComplete = false;
}
Message::Message(const Message &t)
{
icon = new QPixmap;
icon = t.icon;
action = t.action;
timeout = t.timeout;
urgency = t.urgency;
app_name = t.app_name;
te... |
d80b0b71c9f7b2ed0ed9368491eddab3af351fcf | 9c7c58220a546d583e22f8737a59e7cc8bb206e6 | /Project/MyProject/MyProject/Source/MyProject/Private/MyEngine/MyBase/Frame/MyGameUserSettingsBase.h | fced2ee1fa1800198412dff8b31efdfe200115c2 | [] | no_license | SiCoYu/UE | 7176f9ece890e226f21cf972e5da4c3c4c4bfe41 | 31722c056d40ad362e5c4a0cba53b05f51a19324 | refs/heads/master | 2021-03-08T05:00:32.137142 | 2019-07-03T12:20:25 | 2019-07-03T12:20:25 | null | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 438 | h | MyGameUserSettingsBase.h | #pragma once
#include "GameFramework/GameUserSettings.h"
#include "MyGameUserSettingsBase.generated.h"
/**
* @brief
ÔÚÕâÀïÉèÖÃ
DefaultEngine.ini
[/Script/EngineSettings.GameMapsSettings]
GameUserSettingsClassName=/Script/MyProject.MyTPUserSettings
*/
UCLASS()
class UMyGameUserSettingsBase : public UGameUserSet... |
5019f8bb1af6d8cfac55d8ad91de538fe5bbd4e5 | f4a52a7dd6f6266878f4351934f99ea5174663e4 | /hw26/B1.cpp | ec0c3d756ccebe22b81bff33ba36e0efb7b6872b | [] | no_license | askoulwassim/Algorithms-and-Data-Structures | 8aa8e831c5e6bdc788a59f1c4033f4496ae2f3d4 | 60e15c8a1bb463ed46dafaecbdc2ec2d952e395b | refs/heads/master | 2020-04-08T01:21:25.054788 | 2018-11-24T01:13:45 | 2018-11-24T01:13:45 | 158,890,506 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 240 | cpp | B1.cpp | #include <iostream>
#include <math.h>
using namespace std;
int fnc(int x)
{
if (x > 0) {
return fnc(x-2) + fnc(x-4) + fnc(x-6);
}
else
return x;
};
int main()
{
int x = 70;
int a = fnc(x);
cout << a << endl;
}
|
02c28b3f84a97eab5d7f92fc6a6086ee56ede1b1 | 6cb3eb77b3ff98c78a5a6ee01e16349a5199841c | /3/3/3.cpp | 0984d3f82303901cc02d6302566fa3b2b66dc5af | [] | no_license | KischenkoVladislava/Lab_2 | 4a70a912917a67f7f71c6efb0841e78f09509de6 | c9e7a0ccd747631d30f7931196cf3c028230953f | refs/heads/master | 2023-08-22T22:05:33.168195 | 2021-10-31T21:38:00 | 2021-10-31T21:38:00 | 423,266,016 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 447 | cpp | 3.cpp | #include <iostream>
using namespace std;
int main()
{
setlocale(LC_ALL, "Russian");
int f[100];
int n = 0;
f[0] = 1;
f[1] = 1;
for (int i=2; i < 100; i++)
{
f[i] = f[i-1] + f[i-2];
if ((f[i] > 999) && (f[i] < 10000))
{
n = n + 1;
}
}
c... |
966707b49439be12c35914ab15003608cc46e1d5 | 0feb5832e9790a430d475e11ed2eeed9a790e59d | /src/customtimer.cpp | 78a5294195a92f6aab3e21f8a1f5f6d804035237 | [] | no_license | apmechev/GUTimer | c517f78fe31e9d47b25cd0bb3912306d77549599 | 9e53bced86a15dcadf8ab986923cfcb002842ea0 | refs/heads/master | 2021-01-01T05:16:17.200197 | 2019-02-20T14:02:45 | 2019-02-20T14:02:45 | 56,753,164 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 467 | cpp | customtimer.cpp | #include "customtimer.h"
customtimer::customtimer(std::string type)
{
//ctor
}
customtimer::~customtimer()
{
//dtor
}
customtimer& customtimer::operator=(const customtimer& rhs)
{
if (this == &rhs) return *this; // handle self assignment
//assignment operator
return *this;
}
uint64_t customtime... |
1f72e5b5b39a53c1b6ef3b3a663b647a8b0e8be7 | a803f31a447f90376a95d0034108703f9b2c7c9c | /Src/Pagerank/Pagerank.hpp | ac83ae4ab3dc7be1ce5bc706ea20f318db60548c | [] | no_license | LaiosDimitris/pagerank | b29a9283dff145ef029bf94b774b2a5d47f06eff | b2da80b35d29e6b03f45e6d3feb0e922bcd5e4fd | refs/heads/master | 2023-04-10T14:54:52.796817 | 2021-04-08T18:00:23 | 2021-04-08T18:00:23 | 355,960,791 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 407 | hpp | Pagerank.hpp | #include "../Matrix/Matrix.hpp"
#include "../Surfer/Surfer.hpp"
#include "../Webpage/Webpage.hpp"
class Pagerank
{
public:
Pagerank(int pages, int surfers, int rounds, double damping_factor);
void random_surfer_walk();
void rank_webpages();
void print_pagerank();
private:
std::vector<Surfer> su... |
5467b438377ef3bb73e4e0fddab61b2bc399e53b | 55e18224e94d62c8967e82d8b91ea24c65ffda10 | /Vector Model.cpp | 7800f7c556601e93b6426c3a92841c2e67277110 | [] | no_license | keygenx/N-Vector-Model | f978e5d5d675d41016e90b0dae5613b5fff2e414 | 18ca691a3248f331c594b12a64b5885f8a5eb8a6 | refs/heads/master | 2020-03-08T19:24:16.783789 | 2018-04-11T06:30:58 | 2018-04-11T06:30:58 | 128,351,533 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,153 | cpp | Vector Model.cpp | #include "stdafx.h" //Precompiled Headers used while working with Visual Studio.
#include <mathimf.h> //Intel optimized math library. Replace it with math.h if not available.
#include <omp.h> //OpenMP for Parallelization
#include <chrono> //Chrono for Timing
#include <iostream>
//#include <random>
#include <fstream>
#... |
908ef7f63d1b88d7116102442cbe05db55f30f09 | da1f4c3ab2df963ae6a6d616c39294ba319d0304 | /reconstruction/CManageData.h | 0cacffb600f5a1d244add8a37d65b064764f287e | [] | no_license | seed93/reconstruction | cd00c0c9cac6bdb086453da6ebdf7fa546420839 | 984d4139bb84e424b2e359e6af5985cdf3782a78 | refs/heads/master | 2022-05-26T23:29:44.316216 | 2022-05-20T09:10:58 | 2022-05-20T09:10:58 | 26,626,407 | 54 | 25 | null | null | null | null | UTF-8 | C++ | false | false | 1,383 | h | CManageData.h | #ifndef CManageData_H
#define CManageData_H
// CManageData.h
// class CManageData
// manage all common images, masks, parameters
#include "SharedInclude.h"
struct Boundary
{
int YL,YR,XL,XR;
int width, height;
};
struct camera
{
cv::Mat CamCenter;
cv::Mat P,MatIntrinsics,MatExtrinsics;
string image_name,mask_n... |
fa842a59e954ab76a60c483311584c94762e2ffd | 31d6af84680f765b365bc880694d0347a199c506 | /Assignment#2/Art2Trail/Art2Trail/src/ofApp.cpp | 91ee0d345f8895056088784a8356b93c937c74fd | [] | no_license | teacow2/fortugnn_AlgoSims2106 | cab2d95ea0e6bbb07004b69e67a41f8a726b5719 | d4b9c61e117f76f8a4d11e7d19bab30fc8bb1bc1 | refs/heads/master | 2020-04-17T08:19:35.408968 | 2016-12-15T23:30:43 | 2016-12-15T23:30:43 | 67,743,254 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,370 | cpp | ofApp.cpp | #include "ofApp.h"
//--------------------------------------------------------------
void ofApp::setup() {
ofSetVerticalSync(true);
ofEnableAlphaBlending();
for (int i = 0; i< 4; i++) {
rectangle temp;
myRect.push_back(temp);
myRect[i].catchUpSpeed /= i + 1;
// myRect[i].pos.x = 100+(i*20);
// myRect[... |
07aa31456ec0c72be5ec6be1ea0a0340ee6230da | 52f72a3b208452e22009526110b33a46eb46b70e | /Archive/Engine/Objects/Object.h | 3dea4e557615fc0c7530226b60077bdf08a4dc1c | [] | no_license | lineCode/Berserk | b5bb1e66b2062e78ff51643c2c81dc269800a099 | 5b856a46693f4584c08d2ed335d0c5fba3466601 | refs/heads/master | 2020-05-09T16:18:59.103498 | 2019-04-13T21:59:47 | 2019-04-13T21:59:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 929 | h | Object.h | //
// Created by Egor Orachyov on 25.07.2018.
//
#ifndef BERSERKENGINE_OBJECT_H
#define BERSERKENGINE_OBJECT_H
#include "Strings/CString.h"
#include "Strings/CStaticString.h"
namespace Berserk
{
class Object
{
public:
Object(const CStaticString& name);
virtual ~Object();
const ... |
b9fc439d7ced4c7ebea5f25cdbf2a639efef7a05 | b617478c1cde912926737f31d9bbcd97a7ef95e4 | /acceleratedcpp/5/students_lists/src/fail.cpp | b0c46ccf9737ad4892fb0791a808c99d4b6f7a96 | [
"MIT"
] | permissive | kjchalup/algorithm_design | bb000764a0bfce2d2365eebda7a306799a7eb230 | 99176322b83d120f0ceb83dbba254a6e15f95264 | refs/heads/master | 2021-01-18T23:25:17.106476 | 2017-08-02T22:39:19 | 2017-08-02T22:39:19 | 87,109,968 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 480 | cpp | fail.cpp | // Split a list of students into failing and passing lists.
#include "fail.h"
#include "grade.h"
using std::list;
bool fgrade(const Student_info& s){
return grade(s) < 60;
}
data extract_fails(data& students)
{
data fail;
data::iterator iter = students.begin();
while (iter != students.end()) {
... |
d37d3b3dd0dfc5ce36e50ca793ff4221d469d9df | 214682d54200d6791ca5a202dcaacdce1912e86f | /MySoftwarePackage/ppElastic.h | 7bd1c63e38b6707fb3a09c18e3daa30e4f6c994a | [] | no_license | erezcoh4/mySoftware | 800f4b4524ee74ae9ec8a321892053aeb4cd0256 | 1d0104637970310dec8860dc0491d9697b100574 | refs/heads/master | 2021-03-09T12:50:33.785980 | 2019-01-16T06:02:38 | 2019-01-16T06:02:38 | 52,619,643 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,684 | h | ppElastic.h | /**
* \file ppElastic.h
*
* \ingroup MySoftwarePackage
*
* \brief Class def header for a class ppElastic
*
* @author erezcohen
*/
/** \addtogroup MySoftwarePackage
@{*/
#ifndef PPELASTIC_H
#define PPELASTIC_H
#include <iostream>
#include "myIncludes.h"
#include "TPlots.h"
#include <math.h>
/**
\clas... |
c9d1c1158981367549e3e667c035a32cdf3102f3 | ada2ecc6deafd8fb08c8a34ea95372b83ca2b27a | /include/point_type.hpp | 8939abeb6472e3ac587695ebe4720a7c029f47ea | [] | no_license | andreyp74/kdtree | dbab63479bc22accfbca3dec591594938646fa2a | 2c1abc8b01ce41ff26c30532485c693f5733878c | refs/heads/master | 2022-11-06T18:02:20.866015 | 2020-06-06T22:08:50 | 2020-06-06T22:08:50 | 268,371,237 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 490 | hpp | point_type.hpp | #pragma once
#include <vector>
using point_type = std::vector<double>;
using sample_type = std::vector<point_type>;
inline bool less_at(const point_type& p1, const point_type& p2, int idx) {
return p1.at(idx) < p2.at(idx);
}
inline double distance_squared(const point_type& p1, const point_type& p2) {
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.