blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 4 201 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 7 100 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 260
values | visit_date timestamp[us] | revision_date timestamp[us] | committer_date timestamp[us] | github_id int64 11.4k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 17
values | gha_event_created_at timestamp[us] | gha_created_at timestamp[us] | gha_language stringclasses 80
values | src_encoding stringclasses 28
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 8 9.86M | extension stringclasses 52
values | content stringlengths 8 9.86M | authors listlengths 1 1 | author stringlengths 0 119 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
607eac935e895001f03a4df8e2dca984d4c6dab1 | be542bf86448c257ba1aaa87ea832b63e2aa1a5e | /projects/Week4-Started Graphics/src/VertexArrayObject.h | c168fcd7ded9e037f246ee8d37bf807ab87b1a4f | [] | no_license | HarrisonLeswick/OTTER | 9071f934b2d8d8054800657856b6a4acd4ae4ab3 | 02fa61e28e769b93341db6b4502a027284b25afb | refs/heads/master | 2023-08-25T19:56:23.396924 | 2021-10-06T19:53:22 | 2021-10-06T19:53:22 | 410,010,451 | 0 | 0 | null | 2021-09-24T15:17:42 | 2021-09-24T15:17:42 | null | UTF-8 | C++ | false | false | 4,246 | h | #pragma once
#include <glad/glad.h>
#include <cstdint>
#include <vector>
// We can declare the classes for IndexBuffer and VertexBuffer here, since we don't need their full definitions in the .h file
#include "VertexBuffer.h"
#include "IndexBuffer.h"
#include <memory>
/// <summary>
/// Represents the type that a VAO attribute can have
/// </summary>
/// <see>https://www.khronos.org/registry/OpenGL-Refpages/gl4/html/glVertexAttribPointer.xhtml</see>
enum class AttributeType {
Byte = GL_BYTE,
UByte = GL_UNSIGNED_BYTE,
Short = GL_SHORT,
UShort = GL_UNSIGNED_SHORT,
Int = GL_INT,
UInt = GL_UNSIGNED_INT,
Float = GL_FLOAT,
Double = GL_DOUBLE,
Unknown = GL_NONE
};
/// <summary>
/// This structure will represent the parameters passed to the glVertexAttribPointer commands
/// </summary>
struct BufferAttribute
{
/// <summary>
/// The input slot to the vertex shader that will receive the data
/// </summary>
GLuint Slot;
/// <summary>
/// The number of elements to be passed (ex 3 for a vec3)
/// </summary>
GLint Size;
/// <summary>
/// The type of data to be passed (ex: GL_FLOAT for a vec3)
/// </summary>
AttributeType Type;
/// <summary>
/// Specifies whether fixed-point data values should be normalized (true) or converted directly as fixed-point values (false) when they are accessed. Usually false
/// </summary>
bool Normalized;
/// <summary>
/// The total size of an element in this buffer
/// </summary>
GLsizei Stride;
/// <summary>
/// The offset from the start of an element to this attribute
/// </summary>
GLsizei Offset;
BufferAttribute(uint32_t slot, uint32_t size, AttributeType type, GLsizei stride, GLsizei offset, bool normalized = false) :
Slot(slot), Size(size), Type(type), Stride(stride), Offset(offset), Normalized(normalized) { }
};
/// <summary>
/// The Vertex Array Object wraps around an OpenGL VAO and basically represents all of the data for a mesh
/// </summary>
class VertexArrayObject final
{
public:
typedef std::shared_ptr<VertexArrayObject> Sptr;
static inline Sptr Create() {
return std::make_shared<VertexArrayObject>();
}
// We'll disallow moving and copying, since we want to manually control when the destructor is called
// We'll use these classes via pointers
VertexArrayObject(const VertexArrayObject& other) = delete;
VertexArrayObject(VertexArrayObject&& other) = delete;
VertexArrayObject& operator=(const VertexArrayObject& other) = delete;
VertexArrayObject& operator=(VertexArrayObject&& other) = delete;
public:
/// <summary>
/// Creates a new empty Vertex Array Object
/// </summary>
VertexArrayObject();
// Destructor does not need to be virtual due to the use of the final keyword
~VertexArrayObject();
/// <summary>
/// Sets the index buffer for this VAO, note that for now, this will not delete the buffer when the VAO is deleted, more on that later
/// </summary>
/// <param name="ibo">The index buffer to bind to this VAO</param>
void SetIndexBuffer(const IndexBuffer::Sptr& ibo);
/// <summary>
/// Adds a vertex buffer to this VAO, with the specified attributes
/// </summary>
/// <param name="buffer">The buffer to add (note, does not take ownership, you will still need to delete later)</param>
/// <param name="attributes">A list of vertex attributes that will be fed by this buffer</param>
void AddVertexBuffer(const VertexBuffer::Sptr& buffer, const std::vector<BufferAttribute>& attributes);
/// <summary>
/// Binds this VAO as the source of data for draw operations
/// </summary>
void Bind();
/// <summary>
/// Unbinds the currently bound VAO
/// </summary>
static void Unbind();
/// <summary>
/// Returns the underlying OpenGL handle that this class is wrapping around
/// </summary>
GLuint GetHandle() const { return _handle; }
protected:
// Helper structure to store a buffer and the attributes
struct VertexBufferBinding
{
VertexBuffer::Sptr Buffer;
std::vector<BufferAttribute> Attributes;
};
// The index buffer bound to this VAO
IndexBuffer::Sptr _indexBuffer;
// The vertex buffers bound to this VAO
std::vector<VertexBufferBinding> _vertexBuffers;
// The underlying OpenGL handle that this class is wrapping around
GLuint _handle;
};
| [
"h.leswick@gmail.com"
] | h.leswick@gmail.com |
c1db54a22c039fafda5036fb614c426ff5f188af | c8167b5af3a7462b1a302855ea941d5f0e6c0b4a | /hardware/src/Arduino.cpp | e867bb7d30da938eb817302e6e4f3757f6f7068a | [
"MIT"
] | permissive | elchtzeasar/balcony-watering-system | 92d07b959c186560d562fda8539be6bf3ba3bc48 | 2fb20dc8bdf79cff4b7ba93cb362489562b62732 | refs/heads/master | 2020-06-16T10:25:30.792582 | 2020-04-29T07:52:38 | 2020-04-29T07:52:38 | 195,538,018 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,663 | cpp | #include "Arduino.h"
#include "Master.h"
#include <cassert>
#include <sstream>
#include <unistd.h>
#include <chrono>
#include <iostream>
#include <thread>
namespace balcony_watering_system {
namespace hardware {
using std::string;
enum Commands {
READ_COMMAND = 0xea,
SHUTDOWN_COMMAND = 0xf,
};
static const int NR_OF_INPUTS = 6;
Arduino::Arduino(int address, int shutdownEnabledPin, const string& namePrefix, Master& master) :
address(address),
master(master),
shutdownEnabled(shutdownEnabledPin),
analogInputs(),
logger("hardware.arduino", namePrefix) {
LOG_TRACE(logger, "Arduino creating");
master.registerReadNode(*this);
shutdownEnabled.setup();
for (int i = 0; i < NR_OF_INPUTS; i++) {
std::ostringstream stream;
stream << namePrefix << "." << i;
analogInputs.push_back(AnalogInput(stream.str(), 0, 5));
}
LOG_TRACE(logger, "Arduino created");
}
Arduino::~Arduino() {
}
void Arduino::doSample() {
LOG_TRACE(logger, "doSample");
master.setNodeAddress(address);
master.writeByte(uint8_t{READ_COMMAND});
constexpr size_t expectedDataSize = 2 * NR_OF_INPUTS;
master.setNodeAddress(address);
uint8_t data[expectedDataSize];
size_t actualDataSize = 0;
do {
actualDataSize = master.readData(data, expectedDataSize);
LOG_TRACE(logger, "received " << actualDataSize << " bytes, expected " << expectedDataSize);
if (actualDataSize != expectedDataSize) {
std::this_thread::sleep_for(std::chrono::milliseconds(10));
}
} while (actualDataSize != expectedDataSize);
for (int i = 0; i < NR_OF_INPUTS; i++) {
const uint16_t msb = data[2*i + 0];
const uint16_t lsb = data[2*i + 1];
const uint16_t voltageWord = ((msb << 8) & 0xff00) | (lsb & 0x00ff);
const uint16_t WORD_MAX = 1024;
const int VOLTAGE_MAX = 5.0;
const float voltage = voltageWord <= WORD_MAX
? voltageWord / float(WORD_MAX) * VOLTAGE_MAX
: VOLTAGE_MAX;
analogInputs.at(i).setCurrentVoltage(voltage);
LOG_TRACE(logger, "doSample[" << i << "] "
<< std::hex
<< "msb=0x" << msb
<< ", lsb=0x" << lsb
<< " => voltageWord=0x" << voltageWord
<< std::dec
<< " => voltage=" << voltage);
}
}
bool Arduino::isShutdownEnabled() const {
return shutdownEnabled.getValue();
}
void Arduino::shutdown() {
LOG_TRACE(logger, "shutdown");
for (int i = 0; i < 3; i++) {
master.setNodeAddress(address);
master.writeByte(uint8_t{SHUTDOWN_COMMAND});
}
}
const std::vector<AnalogInput>& Arduino::getAnalogInputs() const {
return analogInputs;
}
} /* namespace hardware */
} /* namespace balcony_watering_system */
| [
"westman.peter@gmail.com"
] | westman.peter@gmail.com |
57b642fcf9daac26d10fdd7dd4501440848c2d06 | 06a5c632ec2b984176daf46105e42347176190c6 | /folly/test/ReplaceableTest.cpp | f3aca572274982a68e8233c406c7b973e11b4f67 | [
"MIT",
"Apache-2.0"
] | permissive | astrabit/folly | 16842c7a8599fe20d2a48143f71bdb7722849be8 | 74f41a0bd67f14fa91c341a468b0f3462b2ab95c | refs/heads/master | 2020-05-05T13:05:29.137397 | 2019-04-07T18:31:41 | 2019-04-07T18:35:05 | 180,058,911 | 1 | 0 | null | 2019-04-08T03:00:32 | 2019-04-08T03:00:31 | null | UTF-8 | C++ | false | false | 11,220 | cpp | /*
* Copyright 2017-present Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <folly/Replaceable.h>
#include <folly/portability/GTest.h>
using namespace ::testing;
using namespace ::folly;
namespace {
struct Basic {};
struct alignas(128) BigAlign {};
struct HasConst final {
bool const b1;
HasConst() noexcept : b1(true) {}
explicit HasConst(bool b) noexcept : b1(b) {}
HasConst(HasConst const& b) noexcept : b1(b.b1) {}
HasConst(HasConst&& b) noexcept : b1(b.b1) {}
HasConst& operator=(HasConst const&) = delete;
HasConst& operator=(HasConst&&) = delete;
};
struct HasRef final {
int& i1;
explicit HasRef(int& i) noexcept(false) : i1(i) {}
HasRef(HasRef const& i) noexcept(false) : i1(i.i1) {}
HasRef(HasRef&& i) noexcept(false) : i1(i.i1) {}
HasRef& operator=(HasRef const&) = delete;
HasRef& operator=(HasRef&&) = delete;
~HasRef() noexcept(false) {
++i1;
}
};
void swap(HasRef& lhs, HasRef& rhs) noexcept(false) {
std::swap(lhs.i1, rhs.i1);
}
struct OddA;
struct OddB {
OddB() = delete;
OddB(std::initializer_list<int>, int) noexcept(false) {}
explicit OddB(OddA&&) {}
explicit OddB(OddA const&) noexcept(false) {}
OddB(OddB&&) = delete;
OddB(OddB const&) = delete;
OddB& operator=(OddB&&) = delete;
OddB& operator=(OddB const&) = delete;
~OddB() = default;
};
struct OddA {
OddA() = delete;
explicit OddA(OddB&&) noexcept {}
explicit OddA(OddB const&) = delete;
OddA(OddA&&) = delete;
OddA(OddA const&) = delete;
OddA& operator=(OddA&&) = delete;
OddA& operator=(OddA const&) = delete;
~OddA() noexcept(false) {}
};
struct Indestructible {
~Indestructible() = delete;
};
struct HasInt {
explicit HasInt(int v) : value{v} {}
int value{};
};
} // namespace
template <typename T>
struct ReplaceableStaticAttributeTest : Test {};
using StaticAttributeTypes = ::testing::Types<
char,
short,
int,
long,
float,
double,
char[11],
Basic,
BigAlign,
HasConst,
HasRef,
OddA,
OddB,
Indestructible>;
TYPED_TEST_CASE(ReplaceableStaticAttributeTest, StaticAttributeTypes);
template <typename T>
struct ReplaceableStaticAttributePairTest : Test {};
using StaticAttributePairTypes = ::testing::
Types<std::pair<int, long>, std::pair<OddA, OddB>, std::pair<OddB, OddA>>;
TYPED_TEST_CASE(ReplaceableStaticAttributePairTest, StaticAttributePairTypes);
TYPED_TEST(ReplaceableStaticAttributeTest, size) {
EXPECT_EQ(sizeof(TypeParam), sizeof(Replaceable<TypeParam>));
}
TYPED_TEST(ReplaceableStaticAttributeTest, align) {
EXPECT_EQ(alignof(TypeParam), alignof(Replaceable<TypeParam>));
}
TYPED_TEST(ReplaceableStaticAttributeTest, destructible) {
EXPECT_EQ(
std::is_destructible<TypeParam>::value,
std::is_destructible<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, trivially_destructible) {
EXPECT_EQ(
std::is_trivially_destructible<TypeParam>::value,
std::is_trivially_destructible<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, default_constructible) {
EXPECT_EQ(
std::is_default_constructible<TypeParam>::value,
std::is_default_constructible<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, move_constructible) {
EXPECT_EQ(
std::is_move_constructible<TypeParam>::value,
std::is_move_constructible<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, copy_constructible) {
EXPECT_EQ(
std::is_copy_constructible<TypeParam>::value,
std::is_copy_constructible<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, move_assignable) {
EXPECT_EQ(
std::is_move_constructible<TypeParam>::value,
std::is_move_assignable<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, copy_assignable) {
EXPECT_EQ(
std::is_copy_constructible<TypeParam>::value,
std::is_copy_assignable<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, nothrow_destructible) {
EXPECT_EQ(
std::is_nothrow_destructible<TypeParam>::value,
std::is_nothrow_destructible<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, nothrow_default_constructible) {
EXPECT_EQ(
std::is_nothrow_default_constructible<TypeParam>::value,
std::is_nothrow_default_constructible<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, nothrow_move_constructible) {
EXPECT_EQ(
std::is_nothrow_move_constructible<TypeParam>::value,
std::is_nothrow_move_constructible<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, nothrow_copy_constructible) {
EXPECT_EQ(
std::is_nothrow_copy_constructible<TypeParam>::value,
std::is_nothrow_copy_constructible<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, nothrow_move_assignable) {
EXPECT_EQ(
std::is_nothrow_destructible<TypeParam>::value &&
std::is_nothrow_copy_constructible<TypeParam>::value,
std::is_nothrow_move_assignable<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, nothrow_copy_assignable) {
EXPECT_EQ(
std::is_nothrow_destructible<TypeParam>::value &&
std::is_nothrow_copy_constructible<TypeParam>::value,
std::is_nothrow_copy_assignable<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributeTest, replaceable) {
EXPECT_FALSE(is_replaceable<TypeParam>::value);
EXPECT_TRUE(is_replaceable<Replaceable<TypeParam>>::value);
}
TYPED_TEST(ReplaceableStaticAttributePairTest, copy_construct) {
using T = typename TypeParam::first_type;
using U = typename TypeParam::second_type;
EXPECT_EQ(
(std::is_constructible<T, U const&>::value),
(std::is_constructible<Replaceable<T>, Replaceable<U> const&>::value));
}
TYPED_TEST(ReplaceableStaticAttributePairTest, move_construct) {
using T = typename TypeParam::first_type;
using U = typename TypeParam::second_type;
EXPECT_EQ(
(std::is_constructible<T, U&&>::value),
(std::is_constructible<Replaceable<T>, Replaceable<U>&&>::value));
}
TYPED_TEST(ReplaceableStaticAttributePairTest, copy_assign) {
using T = typename TypeParam::first_type;
using U = typename TypeParam::second_type;
EXPECT_EQ(
(std::is_convertible<U, T>::value && std::is_destructible<T>::value &&
std::is_copy_constructible<T>::value),
(std::is_assignable<Replaceable<T>, Replaceable<U> const&>::value));
}
TYPED_TEST(ReplaceableStaticAttributePairTest, move_assign) {
using T = typename TypeParam::first_type;
using U = typename TypeParam::second_type;
EXPECT_EQ(
(std::is_convertible<U, T>::value && std::is_destructible<T>::value &&
std::is_move_constructible<T>::value),
(std::is_assignable<Replaceable<T>, Replaceable<U>&&>::value));
}
TYPED_TEST(ReplaceableStaticAttributePairTest, nothrow_copy_construct) {
using T = typename TypeParam::first_type;
using U = typename TypeParam::second_type;
EXPECT_EQ(
(std::is_nothrow_constructible<T, U const&>::value &&
std::is_nothrow_destructible<T>::value),
(std::is_nothrow_constructible<Replaceable<T>, Replaceable<U> const&>::
value));
}
TYPED_TEST(ReplaceableStaticAttributePairTest, nothrow_move_construct) {
using T = typename TypeParam::first_type;
using U = typename TypeParam::second_type;
EXPECT_EQ(
(std::is_nothrow_constructible<T, U&&>::value &&
std::is_nothrow_destructible<T>::value),
(std::is_nothrow_constructible<Replaceable<T>, Replaceable<U>&&>::value));
}
TYPED_TEST(ReplaceableStaticAttributePairTest, nothrow_copy_assign) {
using T = typename TypeParam::first_type;
using U = typename TypeParam::second_type;
EXPECT_EQ(
(std::is_nothrow_constructible<T, U const&>::value &&
std::is_nothrow_destructible<T>::value),
(std::is_nothrow_assignable<Replaceable<T>, Replaceable<U> const&>::
value));
}
TYPED_TEST(ReplaceableStaticAttributePairTest, nothrow_move_assign) {
using T = typename TypeParam::first_type;
using U = typename TypeParam::second_type;
EXPECT_EQ(
(std::is_nothrow_constructible<T, U&&>::value &&
std::is_nothrow_destructible<T>::value),
(std::is_nothrow_assignable<Replaceable<T>, Replaceable<U>&&>::value));
}
TEST(ReplaceableTest, Basics) {
auto rHasConstA = make_replaceable<HasConst>();
auto rHasConstB = make_replaceable<HasConst>(false);
EXPECT_TRUE(rHasConstA->b1);
EXPECT_FALSE(rHasConstB->b1);
rHasConstA = rHasConstB;
EXPECT_FALSE(rHasConstA->b1);
EXPECT_FALSE(rHasConstB->b1);
rHasConstB.emplace(true);
EXPECT_FALSE(rHasConstA->b1);
EXPECT_TRUE(rHasConstB->b1);
rHasConstA = std::move(rHasConstB);
EXPECT_TRUE(rHasConstA->b1);
EXPECT_TRUE(rHasConstB->b1);
}
TEST(ReplaceableTest, Constructors) {
Basic b{};
// From existing `T`
auto rBasicCopy1 = Replaceable<Basic>(b);
auto rBasicMove1 = Replaceable<Basic>(std::move(b));
// From existing `Replaceable<T>`
auto rBasicCopy2 = Replaceable<Basic>(rBasicCopy1);
auto rBasicMove2 = Replaceable<Basic>(std::move(rBasicMove1));
(void)rBasicCopy2;
(void)rBasicMove2;
}
TEST(ReplaceableTest, DestructsWhenExpected) {
int i{0};
{
Replaceable<HasRef> rHasRefA{i};
Replaceable<HasRef> rHasRefB{i};
EXPECT_EQ(0, i);
rHasRefA = rHasRefB;
EXPECT_EQ(1, i);
rHasRefB.emplace(i);
EXPECT_EQ(2, i);
rHasRefA = std::move(rHasRefB);
EXPECT_EQ(3, i);
}
EXPECT_EQ(5, i);
}
TEST(ReplaceableTest, Conversions) {
Replaceable<OddB> rOddB{in_place, {1, 2, 3}, 4};
Replaceable<OddA> rOddA{std::move(rOddB)};
Replaceable<OddB> rOddB2{rOddA};
}
TEST(ReplaceableTest, swapMemberFunctionIsNoexcept) {
int v1{1};
int v2{2};
auto r1 = Replaceable<HasInt>{v1};
auto r2 = Replaceable<HasInt>{v2};
EXPECT_TRUE(noexcept(r1.swap(r2)));
r1.swap(r2);
EXPECT_EQ(v2, r1->value);
EXPECT_EQ(v1, r2->value);
}
TEST(ReplaceableTest, swapMemberFunctionIsNotNoexcept) {
int v1{1};
int v2{2};
auto r1 = Replaceable<HasRef>{v1};
auto r2 = Replaceable<HasRef>{v2};
EXPECT_FALSE(noexcept(r1.swap(r2)));
r1.swap(r2);
EXPECT_EQ(v1, r1->i1);
EXPECT_EQ(v2, r2->i1);
}
namespace adl_test {
struct UserDefinedSwap {
bool calledSwap{};
};
void swap(UserDefinedSwap& lhs, UserDefinedSwap&) noexcept(false) {
lhs.calledSwap = true;
}
} // namespace adl_test
TEST(ReplaceableTest, swapMemberFunctionDelegatesToUserSwap) {
auto r1 = Replaceable<adl_test::UserDefinedSwap>{};
auto r2 = Replaceable<adl_test::UserDefinedSwap>{};
r1.swap(r2);
EXPECT_TRUE(r1->calledSwap);
}
| [
"facebook-github-bot@users.noreply.github.com"
] | facebook-github-bot@users.noreply.github.com |
b456791a02f1a7877a4c9f94f7e4759938f53a9d | cc189f06fd1d99040c4a0bbbebfa2a11e6834337 | /sort/selection_sort.cc | 7bad3ae00c2d46414a1c2687230f7534ec786458 | [] | no_license | showtimemmc/c | ca8029f275369fb98e0013cf9ebf6a5cda8c3b82 | 16de8531348a044e2c453f121d2a3ee99ec9dd67 | refs/heads/master | 2016-09-05T10:14:25.333466 | 2014-08-01T05:45:55 | 2014-08-01T05:45:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,008 | cc | //从小到大，选择排序
#include "../share/utils.h"
#include <iostream>
#include <vector>
int loop_count=0;
int swap_count=0;
//优化后的选择排序
//通过只记录最小元素索引，并在每一趟i循环之后判断是否需要交换
void selection_sort(std::vector<int> &vec)
{
int min=0;
for (int i = 0; i < vec.size(); ++i)
{
//记录每一趟比较的最小值的位置
min=i;
for (int j = i+1; j < vec.size(); ++j)
{
if (vec[j]<vec[min])
{
//只记录最小值的位置
min=j;
}
loop_count++;
}
//判断是否需要交换
if (min!=i)
{
swap(vec[i],vec[min]);
swap_count++;
}
}
}
int main(int argc, char const *argv[])
{
//int test_input[]={9,1,5,8,8,7,4,6,2};
int test_input[]={1,3,2,8,6};
std::vector<int> input(test_input,test_input+sizeof(test_input)/sizeof(int));
selection_sort(input);
print_vector(input);
std::cout<<"loop_count:"<<loop_count<<std::endl;
std::cout<<"swap_count:"<<swap_count<<std::endl;
return 0;
} | [
"showtimemmc@hotmail.com"
] | showtimemmc@hotmail.com |
46e7f7b4ade28efd67fef630efd8b0c6bea8c2a3 | c3575be1ac5b048ce6c3fb5aa8b6fa9d36745f60 | /C/TutorialLevel5Bot/InformationManager.cpp | 60ae60fbe9812f615cd4c24c35bcfe2118da5809 | [
"MIT"
] | permissive | design-song/Algo2017 | b543081f484017f0482e2438434681711bf6c924 | e14d034be3cd5ed4d8e9811fe8a918e965d5d785 | refs/heads/master | 2021-01-23T11:21:43.771810 | 2017-06-01T04:26:28 | 2017-06-01T04:26:28 | null | 0 | 0 | null | null | null | null | UHC | C++ | false | false | 18,236 | cpp | #include "InformationManager.h"
using namespace MyBot;
InformationManager::InformationManager()
{
selfPlayer = BWAPI::Broodwar->self();
enemyPlayer = BWAPI::Broodwar->enemy();
selfRace = selfPlayer->getRace();
enemyRace = enemyPlayer->getRace();
_mainBaseLocations[selfPlayer] = BWTA::getStartLocation(BWAPI::Broodwar->self());
_occupiedBaseLocations[selfPlayer] = std::list<BWTA::BaseLocation *>();
_occupiedBaseLocations[selfPlayer].push_back(_mainBaseLocations[selfPlayer]);
updateOccupiedRegions(BWTA::getRegion(_mainBaseLocations[selfPlayer]->getTilePosition()), BWAPI::Broodwar->self());
_mainBaseLocations[enemyPlayer] = nullptr;
_occupiedBaseLocations[enemyPlayer] = std::list<BWTA::BaseLocation *>();
_firstChokePoint[selfPlayer] = nullptr;
_firstChokePoint[enemyPlayer] = nullptr;
_firstExpansionLocation[selfPlayer] = nullptr;
_firstExpansionLocation[enemyPlayer] = nullptr;
_secondChokePoint[selfPlayer] = nullptr;
_secondChokePoint[enemyPlayer] = nullptr;
updateChokePointAndExpansionLocation();
}
void InformationManager::update()
{
// 적군이 Eliminate 되거나 Left 했을 때, enemy 값은 자동으로 null 이 되지 않으므로, null 로 만들어줘야 한다
if (BWAPI::Broodwar->enemy() == nullptr) {
enemyPlayer = nullptr;
}
else {
if (BWAPI::Broodwar->enemy()->isDefeated() || BWAPI::Broodwar->enemy()->leftGame()) {
enemyPlayer = nullptr;
}
}
updateUnitsInfo();
// occupiedBaseLocation 이나 occupiedRegion 은 거의 안바뀌므로 자주 안해도 된다
if (BWAPI::Broodwar->getFrameCount() % 120 == 0) {
updateBaseLocationInfo();
}
}
void InformationManager::updateUnitsInfo()
{
// update units info
for (auto & unit : BWAPI::Broodwar->enemy()->getUnits())
{
updateUnitInfo(unit);
}
for (auto & unit : BWAPI::Broodwar->self()->getUnits())
{
updateUnitInfo(unit);
}
// remove bad enemy units
_unitData[enemyPlayer].removeBadUnits();
_unitData[selfPlayer].removeBadUnits();
}
// 해당 unit 의 정보를 업데이트 한다 (UnitType, lastPosition, HitPoint 등)
void InformationManager::updateUnitInfo(BWAPI::Unit unit)
{
if (unit->getPlayer() != selfPlayer && unit->getPlayer() != enemyPlayer) {
return;
}
if (enemyRace == BWAPI::Races::Unknown && unit->getPlayer() == enemyPlayer) {
enemyRace = unit->getType().getRace();
}
_unitData[unit->getPlayer()].updateUnitInfo(unit);
}
// 유닛이 파괴/사망한 경우, 해당 유닛 정보를 삭제한다
void InformationManager::onUnitDestroy(BWAPI::Unit unit)
{
if (unit->getType().isNeutral())
{
return;
}
_unitData[unit->getPlayer()].removeUnit(unit);
}
bool InformationManager::isCombatUnitType(BWAPI::UnitType type) const
{
if (type == BWAPI::UnitTypes::Zerg_Lurker/* || type == BWAPI::UnitTypes::Protoss_Dark_Templar*/)
{
return false;
}
// check for various types of combat units
if (type.canAttack() ||
type == BWAPI::UnitTypes::Terran_Medic ||
type == BWAPI::UnitTypes::Protoss_Observer ||
type == BWAPI::UnitTypes::Terran_Bunker)
{
return true;
}
return false;
}
void InformationManager::getNearbyForce(std::vector<UnitInfo> & unitInfo, BWAPI::Position p, BWAPI::Player player, int radius)
{
// for each unit we know about for that player
for (const auto & kv : getUnitData(player).getUnits())
{
const UnitInfo & ui(kv.second);
// if it's a combat unit we care about
// and it's finished!
if (isCombatUnitType(ui.type) && ui.completed)
{
// determine its attack range
int range = 0;
if (ui.type.groundWeapon() != BWAPI::WeaponTypes::None)
{
range = ui.type.groundWeapon().maxRange() + 40;
}
// if it can attack into the radius we care about
if (ui.lastPosition.getDistance(p) <= (radius + range))
{
// add it to the vector
unitInfo.push_back(ui);
}
}
else if (ui.type.isDetector() && ui.lastPosition.getDistance(p) <= (radius + 250))
{
// add it to the vector
unitInfo.push_back(ui);
}
}
}
int InformationManager::getNumUnits(BWAPI::UnitType t, BWAPI::Player player)
{
return getUnitData(player).getNumUnits(t);
}
const UnitData & InformationManager::getUnitData(BWAPI::Player player) const
{
return _unitData.find(player)->second;
}
InformationManager & InformationManager::Instance()
{
static InformationManager instance;
return instance;
}
void InformationManager::updateBaseLocationInfo()
{
_occupiedRegions[selfPlayer].clear();
_occupiedRegions[enemyPlayer].clear();
_occupiedBaseLocations[selfPlayer].clear();
_occupiedBaseLocations[enemyPlayer].clear();
// enemy 의 startLocation을 아직 모르는 경우
if (_mainBaseLocations[enemyPlayer] == nullptr) {
// how many start locations have we explored
int exploredStartLocations = 0;
bool enemyStartLocationFound = false;
// an unexplored base location holder
BWTA::BaseLocation * unexplored = nullptr;
for (BWTA::BaseLocation * startLocation : BWTA::getStartLocations())
{
if (existsEnemyBuildingInRegion(BWTA::getRegion(startLocation->getTilePosition())))
{
if (enemyStartLocationFound == false) {
enemyStartLocationFound = true;
_mainBaseLocations[enemyPlayer] = startLocation;
}
}
// if it's explored, increment
if (BWAPI::Broodwar->isExplored(startLocation->getTilePosition()))
{
exploredStartLocations++;
}
// otherwise set it as unexplored base
else
{
unexplored = startLocation;
}
}
// if we've explored every start location except one, it's the enemy
if (!enemyStartLocationFound && exploredStartLocations == ((int)BWTA::getStartLocations().size() - 1))
{
enemyStartLocationFound = true;
_mainBaseLocations[enemyPlayer] = unexplored;
_occupiedBaseLocations[enemyPlayer].push_back(unexplored);
}
}
// update occupied base location
// 어떤 Base Location 에는 아군 건물, 적군 건물 모두 혼재해있어서 동시에 여러 Player 가 Occupy 하고 있는 것으로 판정될 수 있다
for (BWTA::BaseLocation * baseLocation : BWTA::getBaseLocations())
{
if (hasBuildingAroundBaseLocation(baseLocation, enemyPlayer))
{
_occupiedBaseLocations[enemyPlayer].push_back(baseLocation);
}
if (hasBuildingAroundBaseLocation(baseLocation, selfPlayer))
{
_occupiedBaseLocations[selfPlayer].push_back(baseLocation);
}
}
// enemy의 mainBaseLocations을 발견한 후, 그곳에 있는 건물을 모두 파괴한 경우 _occupiedBaseLocations 중에서 _mainBaseLocations 를 선정한다
if (_mainBaseLocations[enemyPlayer] != nullptr) {
if (existsEnemyBuildingInRegion(BWTA::getRegion(_mainBaseLocations[enemyPlayer]->getTilePosition())) == false)
{
for (std::list<BWTA::BaseLocation*>::const_iterator iterator = _occupiedBaseLocations[enemyPlayer].begin(), end = _occupiedBaseLocations[enemyPlayer].end(); iterator != end; ++iterator) {
if (existsEnemyBuildingInRegion(BWTA::getRegion((*iterator)->getTilePosition())) == true) {
_mainBaseLocations[enemyPlayer] = *iterator;
break;
}
}
}
}
// self의 mainBaseLocations에 대해, 그곳에 있는 건물이 모두 파괴된 경우 _occupiedBaseLocations 중에서 _mainBaseLocations 를 선정한다
if (_mainBaseLocations[selfPlayer] != nullptr) {
if (existsMyBuildingInRegion(BWTA::getRegion(_mainBaseLocations[selfPlayer]->getTilePosition())) == false)
{
for (std::list<BWTA::BaseLocation*>::const_iterator iterator = _occupiedBaseLocations[selfPlayer].begin(), end = _occupiedBaseLocations[selfPlayer].end(); iterator != end; ++iterator) {
if (existsMyBuildingInRegion(BWTA::getRegion((*iterator)->getTilePosition())) == true) {
_mainBaseLocations[selfPlayer] = *iterator;
break;
}
}
}
}
// for each enemy building unit we know about
for (const auto & kv : _unitData[enemyPlayer].getUnits())
{
const UnitInfo & ui(kv.second);
if (ui.type.isBuilding())
{
updateOccupiedRegions(BWTA::getRegion(BWAPI::TilePosition(ui.lastPosition)), BWAPI::Broodwar->enemy());
}
}
// for each of our building units
for (const auto & kv : _unitData[selfPlayer].getUnits())
{
const UnitInfo & ui(kv.second);
if (ui.type.isBuilding())
{
updateOccupiedRegions(BWTA::getRegion(BWAPI::TilePosition(ui.lastPosition)), BWAPI::Broodwar->self());
}
}
updateChokePointAndExpansionLocation();
}
void InformationManager::updateChokePointAndExpansionLocation()
{
if (_mainBaseLocations[selfPlayer]) {
BWTA::BaseLocation* sourceBaseLocation = _mainBaseLocations[selfPlayer];
_firstChokePoint[selfPlayer] = BWTA::getNearestChokepoint(sourceBaseLocation->getTilePosition());
double tempDistance;
double closestDistance = 1000000000;
for (BWTA::BaseLocation * targetBaseLocation : BWTA::getBaseLocations())
{
if (targetBaseLocation == _mainBaseLocations[selfPlayer]) continue;
tempDistance = BWTA::getGroundDistance(sourceBaseLocation->getTilePosition(), targetBaseLocation->getTilePosition());
if (tempDistance < closestDistance && tempDistance > 0 ) {
closestDistance = tempDistance;
_firstExpansionLocation[selfPlayer] = targetBaseLocation;
}
}
closestDistance = 1000000000;
for (BWTA::Chokepoint * chokepoint : BWTA::getChokepoints())
{
if (chokepoint == _firstChokePoint[selfPlayer]) continue;
tempDistance = BWTA::getGroundDistance(sourceBaseLocation->getTilePosition(), BWAPI::TilePosition(chokepoint->getCenter()));
if (tempDistance < closestDistance && tempDistance > 0) {
closestDistance = tempDistance;
_secondChokePoint[selfPlayer] = chokepoint;
}
}
}
if (_mainBaseLocations[enemyPlayer]) {
BWTA::BaseLocation* sourceBaseLocation = _mainBaseLocations[enemyPlayer];
_firstChokePoint[enemyPlayer] = BWTA::getNearestChokepoint(sourceBaseLocation->getTilePosition());
double tempDistance;
double closestDistance = 1000000000;
for (BWTA::BaseLocation * targetBaseLocation : BWTA::getBaseLocations())
{
if (targetBaseLocation == _mainBaseLocations[enemyPlayer]) continue;
tempDistance = BWTA::getGroundDistance(sourceBaseLocation->getTilePosition(), targetBaseLocation->getTilePosition());
if (tempDistance < closestDistance && tempDistance > 0) {
closestDistance = tempDistance;
_firstExpansionLocation[enemyPlayer] = targetBaseLocation;
}
}
closestDistance = 1000000000;
for (BWTA::Chokepoint * chokepoint : BWTA::getChokepoints())
{
if (chokepoint == _firstChokePoint[enemyPlayer]) continue;
tempDistance = BWTA::getGroundDistance(sourceBaseLocation->getTilePosition(), BWAPI::TilePosition(chokepoint->getCenter()));
if (tempDistance < closestDistance && tempDistance > 0) {
closestDistance = tempDistance;
_secondChokePoint[enemyPlayer] = chokepoint;
}
}
}
}
void InformationManager::updateOccupiedRegions(BWTA::Region * region, BWAPI::Player player)
{
// if the region is valid (flying buildings may be in nullptr regions)
if (region)
{
// add it to the list of occupied regions
_occupiedRegions[player].insert(region);
}
}
// BaseLocation 주위 원 안에 player의 건물이 있으면 true 를 반환한다
bool InformationManager::hasBuildingAroundBaseLocation(BWTA::BaseLocation * baseLocation, BWAPI::Player player, int radius)
{
// invalid regions aren't considered the same, but they will both be null
if (!baseLocation)
{
return false;
}
for (const auto & kv : _unitData[player].getUnits())
{
const UnitInfo & ui(kv.second);
if (ui.type.isBuilding())
{
BWAPI::TilePosition buildingPosition(ui.lastPosition);
if (buildingPosition.x >= baseLocation->getTilePosition().x - radius && buildingPosition.x <= baseLocation->getTilePosition().x + radius
&& buildingPosition.y >= baseLocation->getTilePosition().y - radius && buildingPosition.y <= baseLocation->getTilePosition().y + radius)
{
return true;
}
}
}
return false;
}
bool InformationManager::existsEnemyBuildingInRegion(BWTA::Region * region)
{
// invalid regions aren't considered the same, but they will both be null
if (!region)
{
return false;
}
for (const auto & kv : _unitData[enemyPlayer].getUnits())
{
const UnitInfo & ui(kv.second);
if (ui.type.isBuilding())
{
if (BWTA::getRegion(BWAPI::TilePosition(ui.lastPosition)) == region)
{
return true;
}
}
}
return false;
}
bool InformationManager::existsMyBuildingInRegion(BWTA::Region * region)
{
// invalid regions aren't considered the same, but they will both be null
if (!region)
{
return false;
}
for (const auto & kv : _unitData[selfPlayer].getUnits())
{
const UnitInfo & ui(kv.second);
if (ui.type.isBuilding() && ui.completed)
{
if (BWTA::getRegion(BWAPI::TilePosition(ui.lastPosition)) == region)
{
return true;
}
}
}
return false;
}
// 해당 Player 의 UnitAndUnitInfoMap 을 갖고온다
const UnitAndUnitInfoMap & InformationManager::getUnitInfo(BWAPI::Player player) const
{
return getUnitData(player).getUnits();
}
std::set<BWTA::Region *> & InformationManager::getOccupiedRegions(BWAPI::Player player)
{
return _occupiedRegions[player];
}
std::list<BWTA::BaseLocation *> & InformationManager::getOccupiedBaseLocations(BWAPI::Player player)
{
return _occupiedBaseLocations[player];
}
BWTA::BaseLocation * InformationManager::getMainBaseLocation(BWAPI::Player player)
{
return _mainBaseLocations[player];
}
BWTA::Chokepoint * InformationManager::getFirstChokePoint(BWAPI::Player player)
{
return _firstChokePoint[player];
}
BWTA::BaseLocation * InformationManager::getFirstExpansionLocation(BWAPI::Player player)
{
return _firstExpansionLocation[player];
}
BWTA::Chokepoint * InformationManager::getSecondChokePoint(BWAPI::Player player)
{
return _secondChokePoint[player];
}
BWAPI::UnitType InformationManager::getBasicCombatUnitType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Zealot;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_Marine;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Zergling;
}
else {
return BWAPI::UnitTypes::None;
}
}
BWAPI::UnitType InformationManager::getAdvancedCombatUnitType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Dragoon;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_Medic;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Hydralisk;
}
else {
return BWAPI::UnitTypes::None;
}
}
BWAPI::UnitType InformationManager::getBasicCombatBuildingType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Gateway;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_Barracks;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Hatchery;
}
else {
return BWAPI::UnitTypes::None;
}
}
BWAPI::UnitType InformationManager::getObserverUnitType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Observer;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_Science_Vessel;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Overlord;
}
else {
return BWAPI::UnitTypes::None;
}
}
BWAPI::UnitType InformationManager::getBasicResourceDepotBuildingType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Nexus;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_Command_Center;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Hatchery;
}
else {
return BWAPI::UnitTypes::None;
}
}
BWAPI::UnitType InformationManager::getRefineryBuildingType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Assimilator;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_Refinery;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Extractor;
}
else {
return BWAPI::UnitTypes::None;
}
}
BWAPI::UnitType InformationManager::getWorkerType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Probe;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_SCV;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Drone;
}
else {
return BWAPI::UnitTypes::None;
}
}
BWAPI::UnitType InformationManager::getBasicSupplyProviderUnitType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Pylon;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_Supply_Depot;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Overlord;
}
else {
return BWAPI::UnitTypes::None;
}
}
BWAPI::UnitType InformationManager::getBasicDefenseBuildingType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Pylon;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_Bunker;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Creep_Colony;
}
else {
return BWAPI::UnitTypes::None;
}
}
BWAPI::UnitType InformationManager::getAdvancedDefenseBuildingType(BWAPI::Race race)
{
if (race == BWAPI::Races::None) {
race = selfRace;
}
if (race == BWAPI::Races::Protoss) {
return BWAPI::UnitTypes::Protoss_Photon_Cannon;
}
else if (race == BWAPI::Races::Terran) {
return BWAPI::UnitTypes::Terran_Missile_Turret;
}
else if (race == BWAPI::Races::Zerg) {
return BWAPI::UnitTypes::Zerg_Sunken_Colony;
}
else {
return BWAPI::UnitTypes::None;
}
}
| [
"tekseon.shin@gmail.com"
] | tekseon.shin@gmail.com |
bcf350cd81a755acb322c52dbdd034386ecf8d91 | b175eddaf939281f164c2fbb39b55f85cfa90be0 | /Solutions/ArpashardexamandMehrdadsnaivecheat/main.cpp | 59f7a20acd537a6c68c532baf3af069169c5b777 | [] | no_license | AbdelrhmanKhater/Icons | 96b3f42504157c3089ceeb708b9b92ad89c18c88 | ea43233aab70b6b931efe76e349ee0684410a766 | refs/heads/master | 2020-03-07T01:31:54.176100 | 2018-03-28T19:17:12 | 2018-03-28T19:17:12 | 127,185,831 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 207 | cpp | #include <iostream>
using namespace std;
int adhoc[4] = {6, 8, 4, 2};
int n;
int main()
{
cin >> n;
if (n == 0)
cout << "1\n";
else
cout << adhoc[n % 4] << "\n";
return 0;
}
| [
"abdelrhman.khater111@gmail.com"
] | abdelrhman.khater111@gmail.com |
fd2ee4967282f1f958038db031a54bb7cf9864a4 | 00f215b15b65b600f10d035fcbf664d23c3d83ae | /Kushagra Shekhawat/Day 12/52. Paths to reach origin.cpp | 03ecb0d2b7698f3d15275530cec92e2f0ad24728 | [] | no_license | SubhamGupta007/Dynamic-Programming | 810131eb6fe5513b4f4bb728d2d2af66a5e20c5c | 32e1faac325d2ed3479abf3cef4a7c2470356667 | refs/heads/master | 2023-03-24T16:57:30.304582 | 2020-09-24T04:55:01 | 2020-09-24T04:55:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 554 | cpp | #include<bits/stdc++.h>
using namespace std;
long long int FindPaths(int N,int M);
int main()
{
int T;
cin>>T;
while(T--){
int N,M;
cin>>N>>M;
N++,M++;
cout<<FindPaths(N,M)<<endl;
}
return 0;
}
long long int FindPaths(int N,int M){
long long int PathMatrix[N][M];
for(int i=0;i<N;i++)
for(int j=0;j<M;j++)
PathMatrix[i][j]=1;
for(int i=1;i<N;i++)
for(int j=1;j<M;j++){
PathMatrix[i][j]=(PathMatrix[i-1][j]+PathMatrix[i][j-1]);
}
return (PathMatrix[N-1][M-1]);
} | [
"kushagrashekhawat414@gmail.com"
] | kushagrashekhawat414@gmail.com |
ad67042d8fb4f35f7c03a9b319bfe098725e44f5 | 33392bbfbc4abd42b0c67843c7c6ba9e0692f845 | /ultrasound/L3/include/synthetic_aperture.hpp | d6934e4056835c4de128f6a6bdb7b6e2c6eb08b6 | [
"Apache-2.0"
] | permissive | Xilinx/Vitis_Libraries | bad9474bf099ed288418430f695572418c87bc29 | 2e6c66f83ee6ad21a7c4f20d6456754c8e522995 | refs/heads/main | 2023-07-20T09:01:16.129113 | 2023-06-08T08:18:19 | 2023-06-08T08:18:19 | 210,433,135 | 785 | 371 | Apache-2.0 | 2023-07-06T21:35:46 | 2019-09-23T19:13:46 | C++ | UTF-8 | C++ | false | false | 11,837 | hpp | /*
* Copyright 2022 Xilinx, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "graph.cpp"
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <fstream>
#include <string>
// This is used for the PL Kernels
#include "xrt.h"
#include "experimental/xrt_kernel.h"
// Using the ADF API that call XRT API
#include "adf/adf_api/XRTConfig.h"
#define INPUT_RANGE 28
#define OUTPUT_RANGE 6
static std::vector<char> load_xclbin(xrtDeviceHandle device, const std::string& fnm) {
if (fnm.empty()) throw std::runtime_error("No xclbin specified");
// load bit stream
std::ifstream stream(fnm);
stream.seekg(0, stream.end);
size_t size = stream.tellg();
stream.seekg(0, stream.beg);
std::vector<char> header(size);
stream.read(header.data(), size);
auto top = reinterpret_cast<const axlf*>(header.data());
if (xrtDeviceLoadXclbin(device, top)) throw std::runtime_error("Xclbin loading failed");
return header;
}
template <typename T>
T* data_loading(std::string filename, int size) {
T* buffer;
std::ifstream infile(filename, std::ios::in);
if (infile.is_open()) {
std::string line;
for (size = 0; std::getline(infile, line); ++size)
;
// back to the beginning of file
infile.clear();
infile.seekg(0, infile.beg);
// data loading
buffer = new T[size];
for (int i = 0; i < size; i++) {
infile >> buffer[i];
}
} else {
std::cout << "direction input is empty!" << std::endl;
}
infile.close();
std::cout << "file:" << filename << " size:" << size << std::endl;
return buffer;
}
namespace us {
namespace L3 {
template <int TIER = 1>
void synthetic_aperture(std::string xclbin_path,
std::string data_path,
float* res_out[OUTPUT_RANGE],
float res_out_size[OUTPUT_RANGE],
int ITER) {
//////////////////////////////////////////
// Open xclbin
//////////////////////////////////////////
auto dhdl = xrtDeviceOpen(0); // Open Device the local device
if (dhdl == nullptr) throw std::runtime_error("No valid device handle found. Make sure using right xclOpen index.");
auto xclbin = load_xclbin(dhdl, xclbin_path);
auto top = reinterpret_cast<const axlf*>(xclbin.data());
adf::registerXRT(dhdl, top->m_header.uuid);
//////////////////////////////////////////
// data loading
//////////////////////////////////////////
// global
int sizeIn[INPUT_RANGE];
int sizeOut[OUTPUT_RANGE];
float* buf_mem[INPUT_RANGE];
std::string file_set[INPUT_RANGE];
file_set[0] = data_path + "start_positions.txt";
file_set[1] = data_path + "directions.txt";
file_set[2] = data_path + "samples_arange.txt";
file_set[3] = data_path + "image_points.txt";
file_set[4] = data_path + "image_points.txt";
file_set[5] = data_path + "tx_def_delay_distance.txt";
file_set[6] = data_path + "tx_def_delay_distance.txt";
file_set[7] = data_path + "tx_def_ref_point.txt";
file_set[8] = data_path + "tx_def_focal_point.txt";
file_set[9] = data_path + "t_start.txt";
file_set[10] = data_path + "apo_ref_0.txt";
file_set[11] = data_path + "xdc_def_0.txt";
file_set[12] = data_path + "apo_ref_1.txt";
file_set[13] = data_path + "xdc_def_1.txt";
file_set[14] = data_path + "image_points.txt";
file_set[15] = data_path + "apodization_reference.txt";
file_set[16] = data_path + "apo_distance_k.txt";
file_set[17] = data_path + "F_number.txt";
file_set[18] = data_path + "image_points.txt";
file_set[19] = data_path + "delay_from_PL.txt";
file_set[20] = data_path + "xdc_def_positions.txt";
file_set[21] = data_path + "sampling_frequency.txt";
file_set[22] = data_path + "P1.txt";
file_set[23] = data_path + "P2.txt";
file_set[24] = data_path + "P3.txt";
file_set[25] = data_path + "P4.txt";
file_set[26] = data_path + "P5.txt";
file_set[27] = data_path + "P6.txt";
sizeIn[0] = 4; // start_positions.txt
sizeIn[1] = 4; // directions.txt
sizeIn[2] = 32; // samples_arange.txt
sizeIn[3] = 128; // image_points.txt
sizeIn[4] = 128; // image_points.txt
sizeIn[5] = 4; // tx_def_delay_distance.txt
sizeIn[6] = 32; // tx_def_delay_distance.txt
sizeIn[7] = 4; // tx_def_ref_point.txt
sizeIn[8] = 4; // tx_def_focal_point.txt
sizeIn[9] = 4; // t_start.txt
sizeIn[10] = 32; // apo_ref_0.txt
sizeIn[11] = 32; // xdc_def_0.txt
sizeIn[12] = 32; // apo_ref_1.txt
sizeIn[13] = 32; // xdc_def_1.txt
sizeIn[14] = 128; // image_points.txt
sizeIn[15] = 4; // apodization_reference.txt
sizeIn[16] = 32; // apo_distance_k.txt
sizeIn[17] = 4; // F_number.txt
sizeIn[18] = 128; // image_points.txt
sizeIn[19] = 32; // delay_from_PL.txt
sizeIn[20] = 4; // xdc_def_positions.txt
sizeIn[21] = 32; // sampling_frequency.txt
sizeIn[22] = 128; // P1.txt
sizeIn[23] = 128; // P2.txt
sizeIn[24] = 128; // P3.txt
sizeIn[25] = 128; // P4.txt
sizeIn[26] = 128; // P5.txt
sizeIn[27] = 128; // P6.txt
// mem data loading
for (int i = 0; i < INPUT_RANGE; i++) {
buf_mem[i] = data_loading<float>(file_set[i], sizeIn[i]);
}
// mem data output length define
sizeOut[0] = 128; // image-points output
sizeOut[1] = 32; // delay output
sizeOut[2] = 32; // focusing sa output
sizeOut[3] = 32; // apodization sa output
sizeOut[4] = 32; // samples
sizeOut[5] = 128; // interpolator
//////////////////////////////////////////
// input memory
// Allocating the input size of sizeIn to MM2S
// This is using low-level XRT call xclAllocBO to allocate the memory
//////////////////////////////////////////
xrtBufferHandle in_bohdl_set[INPUT_RANGE];
float* in_bomapped_set[INPUT_RANGE];
for (int i = 0; i < INPUT_RANGE; i++) {
in_bohdl_set[i] = xrtBOAlloc(dhdl, sizeIn[i] * sizeof(float), 0, 0);
in_bomapped_set[i] = reinterpret_cast<float*>(xrtBOMap(in_bohdl_set[i]));
memcpy(in_bomapped_set[i], buf_mem[i], sizeIn[i] * sizeof(float));
std::cout << "Input memory" << i << " virtual addr 0x" << in_bomapped_set[i] << std::endl;
}
for (int i = 0; i < INPUT_RANGE; i++) {
xrtBOSync(in_bohdl_set[i], XCL_BO_SYNC_BO_TO_DEVICE, sizeIn[i] * sizeof(float), 0);
}
//////////////////////////////////////////
// output memory
// Allocating the output size of sizeOut to S2MM
// This is using low-level XRT call xclAllocBO to allocate the memory
//////////////////////////////////////////
xrtBufferHandle out_bohdl_set[OUTPUT_RANGE];
float* out_bomapped_set[OUTPUT_RANGE];
for (int i = 0; i < OUTPUT_RANGE; i++) {
out_bohdl_set[i] = xrtBOAlloc(dhdl, sizeOut[i] * sizeof(float), 0, 0);
out_bomapped_set[i] = reinterpret_cast<float*>(xrtBOMap(out_bohdl_set[i]));
memset(out_bomapped_set[i], 0xABCDEF00, sizeOut[i] * sizeof(float));
std::cout << "Output memory" << i << " virtual addr 0x " << out_bomapped_set[i] << std::endl;
}
//////////////////////////////////////////
// mm2s ips
// Using the xrtPLKernelOpen function to manually control the PL Kernel
// that is outside of the AI Engine graph
//////////////////////////////////////////
// set xrt kernels & run kernels for PL mm2s
xrtKernelHandle mm2s_khdl_set[INPUT_RANGE];
xrtRunHandle mm2s_rhdl_set[INPUT_RANGE];
for (int i = 0; i < INPUT_RANGE; i++) {
// get kl name
char kl_name[256];
sprintf(kl_name, "mm2s%d", i + 1);
// Open mm2s PL kernels and Set arguments for run
mm2s_khdl_set[i] = xrtPLKernelOpen(dhdl, top->m_header.uuid, kl_name);
mm2s_rhdl_set[i] = xrtRunOpen(mm2s_khdl_set[i]);
xrtRunSetArg(mm2s_rhdl_set[i], 0, in_bohdl_set[i]);
xrtRunSetArg(mm2s_rhdl_set[i], 2, sizeIn[i]);
xrtRunStart(mm2s_rhdl_set[i]);
}
std::cout << "input kernel complete" << std::endl;
//////////////////////////////////////////
// s2mm ips
// Using the xrtPLKernelOpen function to manually control the PL Kernel
// that is outside of the AI Engine graph
//////////////////////////////////////////
// set xrt kernels & run kernels for PL s2mm
xrtKernelHandle s2mm_khdl_set[OUTPUT_RANGE];
xrtRunHandle s2mm_rhdl_set[OUTPUT_RANGE];
for (int i = 0; i < OUTPUT_RANGE; i++) {
// gen kernel name
char kl_name[256];
sprintf(kl_name, "s2mm%d", i + 1);
// Open s2mm PL kernels and Set arguments for run
s2mm_khdl_set[i] = xrtPLKernelOpen(dhdl, top->m_header.uuid, kl_name);
s2mm_rhdl_set[i] = xrtRunOpen(s2mm_khdl_set[i]);
xrtRunSetArg(s2mm_rhdl_set[i], 0, out_bohdl_set[i]);
xrtRunSetArg(s2mm_rhdl_set[i], 2, sizeOut[i]);
xrtRunStart(s2mm_rhdl_set[i]);
}
std::cout << "output kernel complete" << std::endl;
//////////////////////////////////////////
// graph execution for AIE
//////////////////////////////////////////
sa.init();
std::cout << "graph init" << std::endl;
sa.run(ITER);
std::cout << "graph run" << std::endl;
sa.end();
std::cout << "graph end" << std::endl;
//////////////////////////////////////////
// wait for mm2s1 & mm2s2 done
//////////////////////////////////////////
for (int i = 0; i < INPUT_RANGE; i++) {
// wait for run kernel done
auto state = xrtRunWait(mm2s_rhdl_set[i]);
std::cout << "mm2s" << i + 1 << " completed with status(" << state << ")\n";
xrtRunClose(mm2s_rhdl_set[i]);
xrtKernelClose(mm2s_khdl_set[i]);
}
std::cout << "mm2s wait complete" << std::endl;
for (int i = 0; i < OUTPUT_RANGE; i++) {
auto state = xrtRunWait(s2mm_rhdl_set[i]);
std::cout << "s2mm" << i + 1 << "completed with status(" << state << ")\n";
xrtRunClose(s2mm_rhdl_set[i]);
xrtKernelClose(s2mm_khdl_set[i]);
}
std::cout << "s2mm wait compete" << std::endl;
//////////////////////////////////////////
// wait for s2mm done
//////////////////////////////////////////
for (int i = 0; i < OUTPUT_RANGE; i++) {
xrtBOSync(out_bohdl_set[i], XCL_BO_SYNC_BO_FROM_DEVICE, sizeOut[i] * sizeof(float), 0);
}
//////////////////////////////////////////
// sync output buffer
//////////////////////////////////////////
for (int k = 0; k < OUTPUT_RANGE; k++) {
for (int i = 0; i < res_out_size[k]; i++) {
float result_tmp = (float)out_bomapped_set[k][i];
res_out[k][i] = result_tmp;
}
}
//////////////////////////////////////////
// clean up XRT
//////////////////////////////////////////
std::cout << "Releasing remaining XRT objects...\n";
// intput handle and buffer clean
for (int i = 0; i < INPUT_RANGE; i++) {
xrtBOFree(in_bohdl_set[i]);
delete[] buf_mem[i];
}
// output handle clean
for (int i = 0; i < OUTPUT_RANGE; i++) {
xrtBOFree(out_bohdl_set[i]);
}
// device close
xrtDeviceClose(dhdl);
}
}
}
| [
"do-not-reply@gitenterprise.xilinx.com"
] | do-not-reply@gitenterprise.xilinx.com |
f48241b79bd170c7c3dd3eda6c9b15598813151b | 656381015396366a80c823147d26a74e19fcf7b7 | /KEYandGAMEPAD.cpp | 698c04dbbbe1705ac406c85a64a6a3e2a2ceea41 | [] | no_license | SoraY677/DegitalWorldSTg | 5f8c84536b4393f548643e8ed929b1c09c9127fd | b9f1bcc128ca56a3d26a8e45c7804e46bf0c6099 | refs/heads/master | 2022-04-18T11:26:38.664984 | 2020-04-19T04:34:43 | 2020-04-19T04:34:43 | 256,914,005 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 2,340 | cpp | #include "DxLib.h"
#include "KEYandGAMEPAD.h"
static int Key[256];
//キーの状態の更新
void Keyboard_Update(){
char tmpKey[256];//すべてのキーの入力状態の格納用
GetHitKeyStateAll(tmpKey);//すべてのキーの状態を取得
//キーが押されているか確認
for( int i=0; i<256; i++){
//i番目のキーに入力があった場合
if (tmpKey[i] != 0){
Key[i]++; //i番目のキーに加算していく
//何も押されていなければ
} else {
Key[i] = 0;//0にする
}
}
}
//KeyCodeのキーの状態を取得する
int Keyboard_Get (int KeyCode){
return Key[KeyCode];//KeyCodeの入力状態を返す
}
PAD pad;
CONFIG configpad;
//パッドの初期化
void pad_init(){
configpad.down=0;
configpad.left=1;
configpad.right=2;
configpad.up=3;
configpad.bom=4;
configpad.shot=5;
configpad.slow=11;
configpad.start=13;
}
//キーとゲームパッドのどちらが押されているか判定する関数
void input_pad_or_key(int *p,int k){
*p = *p>k ? *p : k;
}
//パッドとキーのすべての入力状態の更新
void GetHitPadStateAll(){
int i,PadInput,mul=1;
PadInput= GetJoypadInputState( DX_INPUT_PAD1 ); //パッドの入力状態を取得
for(i=0;i<16;i++){
if(PadInput & mul) pad.pad[i]++;
else pad.pad[i]=0;
mul *=2;
}
input_pad_or_key(&pad.pad[configpad.left] ,Keyboard_Get(KEY_INPUT_LEFT ));
input_pad_or_key(&pad.pad[configpad.up] ,Keyboard_Get(KEY_INPUT_UP ));
input_pad_or_key(&pad.pad[configpad.right] ,Keyboard_Get(KEY_INPUT_RIGHT ));
input_pad_or_key(&pad.pad[configpad.down] ,Keyboard_Get(KEY_INPUT_DOWN ));
input_pad_or_key(&pad.pad[configpad.shot] ,Keyboard_Get(KEY_INPUT_Z ));
input_pad_or_key(&pad.pad[configpad.bom] ,Keyboard_Get(KEY_INPUT_X ));
input_pad_or_key(&pad.pad[configpad.slow] ,Keyboard_Get(KEY_INPUT_LSHIFT ));
input_pad_or_key(&pad.pad[configpad.start] ,Keyboard_Get(KEY_INPUT_ESCAPE ));
}
//渡されたパッドキーの番号の入力状態を返す。
int CheckStatePad(int Handle){
if (0<=Handle && Handle<PAD_MAX){
return pad.pad[Handle];
}
else{
printfDx("CheckStatePadに渡した値が不正です\n");
return -1;
}
} | [
"SoraY677@outlook.com"
] | SoraY677@outlook.com |
1fdd97c54c11beecc9a0d21a63104181f60df88d | 9202d01fc569ce83bd4f938294a06515852ab53a | /super-lyon-kart/old-versions/03/src/Sprites.hpp | 23828bfe1db0f9a1b2c74ccff2613aae20ab67d7 | [] | no_license | 1Kenny/1Kenny | c03f4f87126672f7839e69be3e9a75f91f344760 | 16ee9d5fb1f0104450cd936244c48661478801ed | refs/heads/main | 2023-08-14T08:19:23.518378 | 2021-09-20T17:52:09 | 2021-09-20T17:52:09 | 365,982,696 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 540 | hpp | //
// SDL.hpp
// engine
//
// Created by Ebagnitchie Charles=Emmanuel on 15/06/2019.
// Copyright © 2019 Trash. All rights reserved.
//
#ifndef SPRITE_hpp
#define SPRITE_hpp
// ============================================================================
// [Include Section]
// ============================================================================
#include <SDL2/SDL.h>
#include <stdio.h>
#include "Mode7.hpp"
SDL_Texture *loadImage(const char path[], SDL_Renderer *renderer);
#endif /* SDL_hpp */
| [
"angekennedyn@gmail.com"
] | angekennedyn@gmail.com |
f341e29b0de7bd0e7c017808273adf817db10dac | 73ee941896043f9b3e2ab40028d24ddd202f695f | /external/chromium_org/content/renderer/pepper/host_dispatcher_wrapper.cc | 68ae4ebc0902567b8829398c2feb145a6f0a5d5a | [
"BSD-3-Clause"
] | permissive | CyFI-Lab-Public/RetroScope | d441ea28b33aceeb9888c330a54b033cd7d48b05 | 276b5b03d63f49235db74f2c501057abb9e79d89 | refs/heads/master | 2022-04-08T23:11:44.482107 | 2016-09-22T20:15:43 | 2016-09-22T20:15:43 | 58,890,600 | 5 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 4,207 | cc | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/renderer/pepper/host_dispatcher_wrapper.h"
#include "content/common/view_messages.h"
#include "content/renderer/pepper/pepper_hung_plugin_filter.h"
#include "content/renderer/pepper/pepper_plugin_instance_impl.h"
#include "content/renderer/pepper/pepper_proxy_channel_delegate_impl.h"
#include "content/renderer/pepper/plugin_module.h"
#include "content/renderer/pepper/renderer_ppapi_host_impl.h"
#include "content/renderer/pepper/renderer_restrict_dispatch_group.h"
#include "content/renderer/render_view_impl.h"
#include "third_party/WebKit/public/web/WebDocument.h"
#include "third_party/WebKit/public/web/WebElement.h"
#include "third_party/WebKit/public/web/WebPluginContainer.h"
namespace content {
HostDispatcherWrapper::HostDispatcherWrapper(
PluginModule* module,
base::ProcessId peer_pid,
int plugin_child_id,
const ppapi::PpapiPermissions& perms,
bool is_external)
: module_(module),
peer_pid_(peer_pid),
plugin_child_id_(plugin_child_id),
permissions_(perms),
is_external_(is_external) {
}
HostDispatcherWrapper::~HostDispatcherWrapper() {
}
bool HostDispatcherWrapper::Init(const IPC::ChannelHandle& channel_handle,
PP_GetInterface_Func local_get_interface,
const ppapi::Preferences& preferences,
PepperHungPluginFilter* filter) {
if (channel_handle.name.empty())
return false;
#if defined(OS_POSIX)
DCHECK_NE(-1, channel_handle.socket.fd);
if (channel_handle.socket.fd == -1)
return false;
#endif
dispatcher_delegate_.reset(new PepperProxyChannelDelegateImpl);
dispatcher_.reset(new ppapi::proxy::HostDispatcher(
module_->pp_module(), local_get_interface, filter, permissions_));
if (!dispatcher_->InitHostWithChannel(dispatcher_delegate_.get(),
peer_pid_,
channel_handle,
true, // Client.
preferences)) {
dispatcher_.reset();
dispatcher_delegate_.reset();
return false;
}
dispatcher_->channel()->SetRestrictDispatchChannelGroup(
kRendererRestrictDispatchGroup_Pepper);
return true;
}
const void* HostDispatcherWrapper::GetProxiedInterface(const char* name) {
return dispatcher_->GetProxiedInterface(name);
}
void HostDispatcherWrapper::AddInstance(PP_Instance instance) {
ppapi::proxy::HostDispatcher::SetForInstance(instance, dispatcher_.get());
RendererPpapiHostImpl* host =
RendererPpapiHostImpl::GetForPPInstance(instance);
// TODO(brettw) remove this null check when the old-style pepper-based
// browser tag is removed from this file. Getting this notification should
// always give us an instance we can find in the map otherwise, but that
// isn't true for browser tag support.
if (host) {
RenderView* render_view = host->GetRenderViewForInstance(instance);
PepperPluginInstance* plugin_instance = host->GetPluginInstance(instance);
render_view->Send(new ViewHostMsg_DidCreateOutOfProcessPepperInstance(
plugin_child_id_,
instance,
PepperRendererInstanceData(
0, // The render process id will be supplied in the browser.
render_view->GetRoutingID(),
plugin_instance->GetContainer()->element().document().url(),
plugin_instance->GetPluginURL()),
is_external_));
}
}
void HostDispatcherWrapper::RemoveInstance(PP_Instance instance) {
ppapi::proxy::HostDispatcher::RemoveForInstance(instance);
RendererPpapiHostImpl* host =
RendererPpapiHostImpl::GetForPPInstance(instance);
// TODO(brettw) remove null check as described in AddInstance.
if (host) {
RenderView* render_view = host->GetRenderViewForInstance(instance);
render_view->Send(new ViewHostMsg_DidDeleteOutOfProcessPepperInstance(
plugin_child_id_,
instance,
is_external_));
}
}
} // namespace content
| [
"ProjectRetroScope@gmail.com"
] | ProjectRetroScope@gmail.com |
1c7349703d1f905492ad83659e3166f4ab388c94 | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/inetcore/outlookexpress/mailnews/common/statwiz.h | 8f11d96ecaed0d16f0da074748777526b6ababfb | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 3,277 | h | #ifndef __STATWIZ_H
#define __STATWIZ_H
#define NUM_WIZARD_PAGES 5
#define COLOR_SIZE 8
class CStatWiz;
typedef BOOL (CALLBACK* INITPROC)(CStatWiz *,HWND,BOOL);
typedef BOOL (CALLBACK* OKPROC)(CStatWiz *,HWND,UINT,UINT *,BOOL *);
typedef BOOL (CALLBACK* CMDPROC)(CStatWiz *,HWND,WPARAM,LPARAM);
typedef struct tagPAGEINFO
{
UINT uDlgID;
UINT uHdrID; // string id for title
UINT uSubHdrID; // string id for subheader (set to 0 if no subhdr)
// handler procedures for each page-- any of these can be
// NULL in which case the default behavior is used
INITPROC InitProc;
OKPROC OKProc;
CMDPROC CmdProc;
} PAGEINFO;
typedef struct tagINITWIZINFO
{
const PAGEINFO *pPageInfo;
CStatWiz *pApp;
} INITWIZINFO;
class CStatWiz
{
private:
ULONG m_cRef;
public:
CStatWiz();
~CStatWiz();
ULONG AddRef(VOID);
ULONG Release(VOID);
HRESULT DoWizard(HWND hwnd);
INT m_iCurrentPage;
UINT m_cPagesCompleted;
UINT m_rgHistory[NUM_WIZARD_PAGES];
WCHAR m_wszHtmlFileName[MAX_PATH];
WCHAR m_wszBkPictureFileName[MAX_PATH];
WCHAR m_wszBkColor[COLOR_SIZE];
WCHAR m_wszFontFace[LF_FACESIZE];
WCHAR m_wszFontColor[COLOR_SIZE];
INT m_iFontSize;
BOOL m_fBold;
BOOL m_fItalic;
INT m_iLeftMargin;
INT m_iTopMargin;
INT m_iVertPos; // this will be coded by
INT m_iHorzPos;
INT m_iTile;
HFONT m_hBigBoldFont;
};
typedef CStatWiz *LPSTATWIZ;
#define IDC_STATIC -1
#define IDC_STATWIZ_BIGBOLDTITLE 10
#define IDC_STATWIZ_EDITNAME 1000
#define IDC_STATWIZ_EDITFILE 1001
#define IDC_STATWIZ_PREVIEWBACKGROUND 1002
#define IDC_STATWIZ_BROWSEBACKGROUND 1003
#define IDC_STATWIZ_CHECKPICTURE 1004
#define IDC_STATWIZ_COMBOPICTURE 1005
#define IDC_STATWIZ_CHECKCOLOR 1006
#define IDC_STATWIZ_PREVIEWFONT 1007
#define IDC_STATWIZ_COMBOFONT 1008
#define IDC_STATWIZ_COMBOSIZE 1009
#define IDC_STATWIZ_COMBOFONTCOLOR 1010
#define IDC_STATWIZ_CHECKBOLD 1011
#define IDC_STATWIZ_CHECKITALIC 1012
#define IDC_STATWIZ_PREVIEWMARGIN 1013
#define IDC_STATWIZ_EDITLEFTMARGIN 1014
#define IDC_STATWIZ_SPINLEFTMARGIN 1015
#define IDC_STATWIZ_EDITTOPMARGIN 1016
#define IDC_STATWIZ_SPINTOPMARGIN 1017
#define IDC_STATWIZ_COMBOCOLOR 1018
#define IDC_STATWIZ_PREVIEWFINAL 1019
#define IDC_STATWIZ_HORZCOMBO 1020
#define IDC_STATWIZ_VERTCOMBO 1021
#define IDC_STATWIZ_TILECOMBO 1022
#endif
| [
"seta7D5@protonmail.com"
] | seta7D5@protonmail.com |
4868071f727d22f48c8f96ade831199df5e3d9af | e134c3390821312e652e235df0c502b7bd865a96 | /src/LinearModel.h | 6d54bfdfd1a659581e67c9444f25d218da23f280 | [] | permissive | xuyiqing/fastplm | d67120e8f896fc874be651d834e5bf31916ee3b6 | c194edec4611d54f02fd97ebd0c2ddc3b2e1014b | refs/heads/master | 2022-06-08T02:36:30.950255 | 2022-05-16T19:51:08 | 2022-05-16T19:51:08 | 81,257,854 | 8 | 6 | MIT | 2021-02-04T16:54:53 | 2017-02-07T21:48:12 | R | UTF-8 | C++ | false | false | 696 | h | #ifndef FASTPLM_LINEAR_MODEL_H
#define FASTPLM_LINEAR_MODEL_H
#include "Common.h"
struct LinearModel {
public:
arma::mat X;
arma::vec Y;
bool isLinearDependent;
arma::uvec dependents, independents;
arma::vec beta;
static const LinearModel solve(const arma::mat& X, const arma::vec& Y);
static const LinearModel solve(const arma::mat& data);
#ifndef BUILD_WITHOUT_R
operator Rcpp::List() const {
Rcpp::List _;
_["x"] = X;
_["y"] = Y;
_["is.linear.dependent"] = isLinearDependent;
_["dependents"] = dependents;
_["independents"] = independents;
_["beta"] = beta;
return _;
}
#endif
};
#endif
| [
"liulch.16@sem.tsinghua.edu.cn"
] | liulch.16@sem.tsinghua.edu.cn |
04e37202ef6a465fd7d25621316c8ac57c78e22d | 9ff35738af78a2a93741f33eeb639d22db461c5f | /.build/Android-Debug/jni/app/Uno.Platform2.View.cpp | 504a1bed61757956ed51accd0b0bf5354206210d | [] | no_license | shingyho4/FuseProject-Minerals | aca37fbeb733974c1f97b1b0c954f4f660399154 | 643b15996e0fa540efca271b1d56cfd8736e7456 | refs/heads/master | 2016-09-06T11:19:06.904784 | 2015-06-15T09:28:09 | 2015-06-15T09:28:09 | 37,452,199 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,037 | cpp | // This file was generated based on 'C:\ProgramData\Uno\Packages\UnoCore\0.1.0\Source\Uno\Platform2\$.uno'.
// WARNING: Changes might be lost if you edit this file directly.
#include <app/Uno.Delegate.h>
#include <app/Uno.EventArgs.h>
#include <app/Uno.EventHandler.h>
#include <app/Uno.EventHandler__Uno_Platform2_TouchEventArgs.h>
#include <app/Uno.Int.h>
#include <app/Uno.Platform2.TouchEventArgs.h>
#include <app/Uno.Platform2.View.h>
#include <app/Uno.Platform2.View_PrivateState.h>
namespace app {
namespace Uno {
namespace Platform2 {
View__uType* View__typeof()
{
static View__uType* type;
if (::uEnterCriticalIfNull(&type))
{
type = (View__uType*)::uAllocClassType(sizeof(View__uType), "Uno.Platform2.View", ::uObject__typeof(), 0, 11);
type->__fp_Finalize = (void(*)(::uObject*))View__Finalize;
type->__fp_ResetStateOnHandleChanged = View__ResetStateOnHandleChanged;
type->__fp_AboutToShow = View__AboutToShow;
type->__fp_AboutToHide = View__AboutToHide;
type->__fp_OnFrameChanged = View__OnFrameChanged;
type->StrongRefOffsets[0] = offsetof(View, FrameChanged);
type->StrongRefOffsets[1] = offsetof(View, TouchDown);
type->StrongRefOffsets[2] = offsetof(View, TouchMove);
type->StrongRefOffsets[3] = offsetof(View, TouchUp);
type->StrongRefOffsets[4] = offsetof(View, HandleChanged);
type->StrongRefOffsets[5] = offsetof(View, _handleReady);
type->StrongRefOffsets[6] = offsetof(View, WillShow);
type->StrongRefOffsets[7] = offsetof(View, WillHide);
type->StrongRefOffsets[8] = offsetof(View, IsVisibleChanged);
type->StrongRefOffsets[9] = offsetof(View, IsEnabledChanged);
type->StrongRefOffsets[10] = offsetof(View, TouchCancel);
#ifdef U_DEBUG_MEM
type->StrongRefNames[0] = "FrameChanged";
type->StrongRefNames[1] = "TouchDown";
type->StrongRefNames[2] = "TouchMove";
type->StrongRefNames[3] = "TouchUp";
type->StrongRefNames[4] = "HandleChanged";
type->StrongRefNames[5] = "_handleReady";
type->StrongRefNames[6] = "WillShow";
type->StrongRefNames[7] = "WillHide";
type->StrongRefNames[8] = "IsVisibleChanged";
type->StrongRefNames[9] = "IsEnabledChanged";
type->StrongRefNames[10] = "TouchCancel";
#endif
::uRetainObject(type);
::uExitCritical();
}
return type;
}
void View__Finalize(View* __this)
{
__this->IsVisible(false);
__this->Handle(::app::Uno::Platform2::ViewNativeHandle__get_Null(NULL));
}
uPlatform2::ViewNativeHandle View__get_Handle(View* __this)
{
return __this->_handle;
}
void View__set_Handle(View* __this, uPlatform2::ViewNativeHandle value)
{
if (::app::Uno::Platform2::ViewNativeHandle__op_LogicalNot(NULL, __this->_handle) || ::app::Uno::Platform2::ViewNativeHandle__op_LogicalNot(NULL, value))
{
if (::app::Uno::Platform2::ViewNativeHandle__op_LogicalNot(NULL, __this->_handle) && ::app::Uno::Platform2::ViewNativeHandle__op_LogicalNot(NULL, value))
{
return;
}
}
else if (::app::Uno::Platform2::ViewNativeHandle__op_Equality(NULL, __this->_handle, value))
{
return;
}
uPlatform2::ViewNativeHandle previousHandle = __this->_handle;
__this->_handle = ::app::Uno::Platform2::ViewNativeHandle__op_Implicit(NULL, value) ? __this->AttachHandle(value) : ::app::Uno::Platform2::ViewNativeHandle__get_Null(NULL);
if (::app::Uno::Platform2::ViewNativeHandle__op_Implicit(NULL, previousHandle))
{
__this->DetachHandle(previousHandle);
}
__this->ResetStateOnHandleChanged();
__this->OnHandleChanged();
if (::app::Uno::Platform2::ViewNativeHandle__op_Implicit(NULL, __this->_handle))
{
__this->OnHandleReady();
}
}
bool View__get_IsVisible(View* __this)
{
return __this->_isVisible;
}
void View__set_IsVisible(View* __this, bool value)
{
if (__this->_isVisible == value)
{
return;
}
__this->_isVisible = value;
if (::app::Uno::Platform2::ViewNativeHandle__op_Implicit(NULL, __this->Handle()))
{
__this->SetIsVisible(__this->_isVisible);
if (__this->_isVisible)
{
__this->OnWillShow();
}
else
{
__this->OnWillHide();
}
}
__this->OnIsVisibleChanged();
}
bool View__get_IsEnabled(View* __this)
{
return __this->_isEnabled;
}
void View__set_IsEnabled(View* __this, bool value)
{
if (__this->_isEnabled == value)
{
return;
}
__this->_isEnabled = value;
if (::app::Uno::Platform2::ViewNativeHandle__op_Implicit(NULL, __this->Handle()))
{
__this->SetIsEnabled(__this->_isEnabled);
}
__this->OnIsEnabledChanged();
}
::app::Uno::Rect View__get_Frame(View* __this)
{
return __this->_frame;
}
void View__set_Frame(View* __this, ::app::Uno::Rect value)
{
if (::app::Uno::Rect__Equals_2(NULL, __this->_frame, value))
{
return;
}
__this->_frame = value;
if (::app::Uno::Platform2::ViewNativeHandle__op_Implicit(NULL, __this->Handle()))
{
__this->SetFrame(__this->_frame);
}
__this->OnFrameChanged();
}
void View__ResetStateOnHandleChanged(View* __this)
{
__this->OnWillHide();
if (::app::Uno::Platform2::ViewNativeHandle__op_LogicalNot(NULL, __this->Handle()))
{
return;
}
__this->SetFrame(__this->Frame());
__this->SetIsEnabled(__this->IsEnabled());
__this->SetIsVisible(__this->IsVisible());
if (__this->IsVisible())
{
__this->OnWillShow();
}
}
void View__OnHandleChanged(View* __this)
{
::uDelegate* handler = __this->HandleChanged;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::EventArgs*>((::uObject*)__this, ::app::Uno::EventArgs__Empty);
}
}
void View__OnHandleReady(View* __this)
{
::uDelegate* handler = __this->_handleReady;
__this->_handleReady = NULL;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::EventArgs*>((::uObject*)__this, ::app::Uno::EventArgs__Empty);
}
}
uPlatform2::ViewNativeHandle View__AttachHandle(View* __this, uPlatform2::ViewNativeHandle __handle)
{
return __this->_private.AttachHandle(__this, __handle);
}
void View__DetachHandle(View* __this, uPlatform2::ViewNativeHandle __handle)
{
__this->_private.DetachHandle(__this, __handle);
}
void View__SetIsVisible(View* __this, bool __visible)
{
__this->_private.SetIsVisible(__this, __visible);
}
void View__AboutToShow(View* __this)
{
}
void View__AboutToHide(View* __this)
{
}
void View__OnWillShow(View* __this)
{
if (__this->_willShowTriggered)
{
return;
}
__this->_willShowTriggered = true;
::uDelegate* handler = __this->WillShow;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::EventArgs*>((::uObject*)__this, ::app::Uno::EventArgs__Empty);
}
__this->AboutToShow();
}
void View__OnWillHide(View* __this)
{
if (!__this->_willShowTriggered)
{
return;
}
__this->_willShowTriggered = false;
__this->AboutToHide();
::uDelegate* handler = __this->WillHide;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::EventArgs*>((::uObject*)__this, ::app::Uno::EventArgs__Empty);
}
}
void View__OnIsVisibleChanged(View* __this)
{
::uDelegate* handler = __this->IsVisibleChanged;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::EventArgs*>((::uObject*)__this, ::app::Uno::EventArgs__Empty);
}
}
void View__OnIsEnabledChanged(View* __this)
{
::uDelegate* handler = __this->IsEnabledChanged;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::EventArgs*>((::uObject*)__this, ::app::Uno::EventArgs__Empty);
}
}
void View__SetIsEnabled(View* __this, bool __isEnabled)
{
__this->_private.SetIsEnabled(__this, __isEnabled);
}
void View__OnFrameChanged(View* __this)
{
::uDelegate* handler = __this->FrameChanged;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::EventArgs*>((::uObject*)__this, ::app::Uno::EventArgs__Empty);
}
}
void View__SetFrame(View* __this, ::app::Uno::Rect __frame)
{
__this->_private.SetFrame(__this, __frame);
}
::app::Uno::Float2 View__GetContentSize(View* __this, ::app::Uno::Float2 fillSize, int flags)
{
if (::app::Uno::Platform2::ViewNativeHandle__op_LogicalNot(NULL, __this->Handle()))
{
return __this->Frame().Size();
}
return __this->_GetContentSize(fillSize, flags);
}
::app::Uno::Float2 View___GetContentSize(View* __this, ::app::Uno::Float2 __fillSize, int __flags)
{
return __this->_private.GetContentSize(__this, __fillSize, __flags);
}
void View__OnTouchDown(View* __this, ::app::Uno::Platform2::TouchEventArgs* args)
{
::uDelegate* handler = __this->TouchDown;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::Platform2::TouchEventArgs*>((::uObject*)__this, args);
}
}
void View__OnTouchMove(View* __this, ::app::Uno::Platform2::TouchEventArgs* args)
{
::uDelegate* handler = __this->TouchMove;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::Platform2::TouchEventArgs*>((::uObject*)__this, args);
}
}
void View__OnTouchUp(View* __this, ::app::Uno::Platform2::TouchEventArgs* args)
{
::uDelegate* handler = __this->TouchUp;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::Platform2::TouchEventArgs*>((::uObject*)__this, args);
}
}
void View__OnTouchCancel(View* __this, ::app::Uno::Platform2::TouchEventArgs* args)
{
::uDelegate* handler = __this->TouchCancel;
if (::app::Uno::Delegate__op_Inequality(NULL, (::uDelegate*)handler, NULL))
{
::uPtr< ::uDelegate*>(handler)->InvokeVoid< ::uObject*, ::app::Uno::Platform2::TouchEventArgs*>((::uObject*)__this, args);
}
}
void View___ObjInit(View* __this)
{
__this->_isVisible = true;
__this->_isEnabled = true;
__this->_isFocusable = true;
}
void View__add_HandleReady(View* __this, ::uDelegate* value)
{
if (::app::Uno::Platform2::ViewNativeHandle__op_Implicit(NULL, __this->_handle))
{
::uPtr< ::uDelegate*>(value)->InvokeVoid< ::uObject*, ::app::Uno::EventArgs*>((::uObject*)__this, ::app::Uno::EventArgs__Empty);
}
else
{
__this->add__handleReady(value);
}
}
void View__remove_HandleReady(View* __this, ::uDelegate* value)
{
__this->remove__handleReady(value);
}
void View__add_FrameChanged(View* __this, ::uDelegate* value)
{
__this->FrameChanged = ::uCast< ::uDelegate*>(::app::Uno::Delegate__Combine(NULL, (::uDelegate*)__this->FrameChanged, (::uDelegate*)value), ::app::Uno::EventHandler__typeof());
}
void View__add_TouchDown(View* __this, ::uDelegate* value)
{
__this->TouchDown = ::uCast< ::uDelegate*>(::app::Uno::Delegate__Combine(NULL, (::uDelegate*)__this->TouchDown, (::uDelegate*)value), ::app::Uno::EventHandler__Uno_Platform2_TouchEventArgs__typeof());
}
void View__add_TouchMove(View* __this, ::uDelegate* value)
{
__this->TouchMove = ::uCast< ::uDelegate*>(::app::Uno::Delegate__Combine(NULL, (::uDelegate*)__this->TouchMove, (::uDelegate*)value), ::app::Uno::EventHandler__Uno_Platform2_TouchEventArgs__typeof());
}
void View__add_TouchUp(View* __this, ::uDelegate* value)
{
__this->TouchUp = ::uCast< ::uDelegate*>(::app::Uno::Delegate__Combine(NULL, (::uDelegate*)__this->TouchUp, (::uDelegate*)value), ::app::Uno::EventHandler__Uno_Platform2_TouchEventArgs__typeof());
}
void View__add__handleReady(View* __this, ::uDelegate* value)
{
__this->_handleReady = ::uCast< ::uDelegate*>(::app::Uno::Delegate__Combine(NULL, (::uDelegate*)__this->_handleReady, (::uDelegate*)value), ::app::Uno::EventHandler__typeof());
}
void View__remove__handleReady(View* __this, ::uDelegate* value)
{
__this->_handleReady = ::uCast< ::uDelegate*>(::app::Uno::Delegate__Remove(NULL, (::uDelegate*)__this->_handleReady, (::uDelegate*)value), ::app::Uno::EventHandler__typeof());
}
}}}
| [
"hyl.hsy@gmail.com"
] | hyl.hsy@gmail.com |
e60f999efc7e88064e1548c47542f600c4b7e4f3 | 6ab407365d74407358a7b4c5655f52467699d518 | /Hmwk/Assignment2/Gaddis_8thEd_Chap3_Prob19/main.cpp | 18dd8c46a34e3543d4345c011097f11fc3be1a2b | [] | no_license | joseroman1/LehrMark_CSC5_40717_or_40718 | 2a8570193cf86c230a951b6bb411e96a04b197a9 | f1fee99da98847225e1c10ff4bd1ac53245b8d00 | refs/heads/master | 2021-01-18T08:43:32.697487 | 2015-02-10T19:14:43 | 2015-02-10T19:14:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,395 | cpp | /*
* File: main.cpp
* Author: Dr. Mark E. Lehr
* Created on January 12, 2015, 11:37 AM
* Purpose: My Car Payment
*/
//System Library
#include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
//User Libraries
//Global Constants
//Function Prototypes
//Execution Begins Here!
int main(int argc, char** argv) {
//Declare variables
float intRate=0.0319f/12;//http://www.capitalone.com/auto-financing/rates/?Log=1&EventType=Link&ComponentType=T&LOB=MTS%3A%3ALCTML6KG4&PageName=Auto+navigator&PortletLocation=4%3B16-col%3B4-1-1-1&ComponentName=content2%3B18&ContentElement=2%3BSee+Rates&TargetLob=MTS%3A%3ALCTML6KG4&TargetPageName=Auto+Loan+Rates&referer=https%3A%2F%2Fwww.capitalone.com%2Fauto-financing%2Fauto-navigator&external_id=WWW_LP058_XXX_SEM-Brand_Google_ZZ_ZZ_T_Home
float msrplus=4e4f; //Loan amount for Buick Avenir
char nPaymnt=60; //Number of monthly payments
//Calculate the monthly payments
float temp=pow((1+intRate),nPaymnt);
float mPay=intRate*temp*msrplus/(temp-1);
//Output the inputs
cout<<"Interest per year in percent = "<<intRate*100*12<<endl;
cout<<"Number of payments = "<<static_cast<int>(nPaymnt)<<endl;
cout<<"Loan Amount = $"<<msrplus<<endl;
//Output our car payment
cout<<fixed<<setprecision(2)<<showpoint;
cout<<"My Avenir will cost $"<<mPay<<endl;
return 0;
}
| [
"mark.lehr@rcc.edu"
] | mark.lehr@rcc.edu |
ba6e6cf9de4bed71f9140825943a6ae980979b1e | bf1b0db7d6921015b357fb3d7201528ebf5ef103 | /CalcYL/AthmeticYl.h | 05828a71ad7a103d5dbb73f72b126deb9a92346f | [] | no_license | yangliangrym/CalcYL1 | 591b5e3d6d3acda63c4a969197afe18268fbae3c | 8c8cc175600859b6e671a4de82b78f774504721f | refs/heads/master | 2021-05-11T03:49:06.813128 | 2018-01-18T02:54:02 | 2018-01-18T02:54:02 | 117,924,592 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 810 | h | #pragma once
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include <iomanip>
#include <math.h>
#include <windows.h>
#include <string.h>
#include <qstring.h>
using namespace std;
struct fraction {
int a;
int b;
};
class AthmeticYl
{
public:
AthmeticYl();
~AthmeticYl();
//用结构体存放操作数
string buf;
int TestN = 0; //题目个数
char ope[4] = { '+','-','x','/' }; //操作符
struct fraction mOpn[11];
char mRightAns[100];
QString gRightAns; //正确答案，用于界面输出
QString pTest;
double ro(double r);
int Priority(char op);
int gcd(int a, int b);
struct fraction Ca(struct fraction n1, struct fraction n2, char op);
struct fraction getN();
char getop();
char m();
void PrintTest(int n);
bool Jug(QString YouAns);
};
| [
"1414877831@qq.com"
] | 1414877831@qq.com |
54d6208d2cfb85e18d94bedac2b40cb6de132a53 | 4637840c7d4433328dbf9300ce4da33f24e3a242 | /icpc-jakarta/icpc-jakarta-2020/comic/spec.cpp | bb9de2c8d86be86e9028e36eff40af4c12ac9ca7 | [] | no_license | fushar/cp-problems | c638ff372c98e5a7e7cb43ac7ddfe303ab072cfb | 0af9c4a08b23ecacc3f0d7c6ff825960cc61a484 | refs/heads/master | 2023-09-01T12:05:54.185549 | 2021-09-22T14:07:45 | 2021-09-22T14:07:45 | 147,062,838 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,405 | cpp | #include <tcframe/spec.hpp>
using namespace tcframe;
class ProblemSpec : public BaseProblemSpec {
protected:
int N;
vector<int> A;
vector<int> B;
int ans;
void InputFormat() {
LINE(N);
LINE(A % SIZE(N));
LINE(B % SIZE(N));
}
void OutputFormat() {
LINE(ans);
}
void GradingConfig() {
TimeLimit(1);
MemoryLimit(64);
}
void Constraints() {
CONS(1 <= N && N <= 1000);
CONS(eachElementBetween(A, 1, 1000));
CONS(eachElementBetween(B, 1, 10));
}
private:
bool eachElementBetween(const vector<int>& X, int lo, int hi) {
for (int x : X) {
if (x < lo || x > hi) {
return false;
}
}
return true;
}
};
class TestSpec : public BaseTestSpec<ProblemSpec> {
protected:
void SampleTestCase1() {
Input({
"6",
"3 1 1 1 1 2",
"1 5 3 3 7 4"
});
Output({
"13"
});
}
void SampleTestCase2() {
Input({
"2",
"2 1",
"1 1"
});
Output({
"4"
});
}
void BeforeTestCase() {
A.clear();
B.clear();
}
void TestCases() {
// small edge cases
CASE(N = 1, A = {1}, B = {1});
CASE(N = 2, A = {10, 1}, B = {1, 10});
// kill solutions which greedily make Budi finish as fast as possible
CASE(
N = 6,
A = {1, 2, 1, 1, 1, 1},
B = {1, 2, 3, 2, 2, 1}
/**
* GREEDY (fail) OPTIMAL
* Andi | Budi Andi | Budi
* -----+----- -----+-----
* | 1 | 1
* 1 | 2 1 | 3
* | 2 2 | 3
* 2 | 4 2 | 3
* 2 | 4 3 | 5
* 3 | 6 4 | 5
* 4 | 5 | 6
* 5 | 6 |
* 6 |
*/
);
// A[i] = 1
CASE(N = 100, randomA(1, 1), randomB(1, 1));
CASE(N = 100, randomA(1, 1), randomB(1, 10));
CASE(N = 100, randomA(1, 1), randomB(1, 10));
CASE(N = 1000, randomA(1, 1), randomB(1, 1));
CASE(N = 1000, randomA(1, 1), randomB(1, 10));
CASE(N = 1000, randomA(1, 1), randomB(1, 10));
// random cases A[i] <= 10
CASE(N = 100, randomA(1, 10), randomB(1, 10));
CASE(N = 100, randomA(1, 10), randomB(1, 2));
CASE(N = 100, randomA(1, 10), randomB(8, 10));
CASE(N = 100, randomA(8, 10), randomB(8, 10));
CASE(N = 100, randomA(9, 10), randomB(9, 10));
CASE(N = 1000, randomA(1, 10), randomB(1, 10));
CASE(N = 1000, randomA(8, 10), randomB(8, 10));
CASE(N = 1000, randomA(9, 10), randomB(9, 10));
// random cases with "mines" in B
// not always optimal to try to always pick 1s
// B = 9 9 1 1 1 9 1 9 1 ...
CASE(N = 100, randomA(1, 2), randomBWithMines());
CASE(N = 100, randomA(1, 2), randomBWithMines());
CASE(N = 100, randomA(1, 10), randomBWithMines());
CASE(N = 100, randomA(1, 10), randomBWithMines());
CASE(N = 100, randomA(8, 10), randomBWithMines());
CASE(N = 100, randomA(1, 100), randomBWithMines());
CASE(N = 1000, randomA(1, 1000), randomBWithMines());
// max cases
CASE(N = 1000, randomA(999, 1000), randomB(9, 10));
CASE(N = 1000, randomA(999, 1000), randomB(9, 10));
CASE(N = 1000, randomA(1000, 1000), randomB(10, 10));
CASE(N = 1000, randomA(1, 1000), randomB(1, 10));
CASE(N = 1000, randomA(1, 1000), randomB(1, 10));
}
private:
void randomA(int minA, int maxA) {
for (int i = 0; i < N; i++) {
A.push_back(rnd.nextInt(minA, maxA));
}
}
void randomB(int minB, int maxB) {
for (int i = 0; i < N; i++) {
B.push_back(rnd.nextInt(minB, maxB));
}
}
void randomBWithMines() {
for (int i = 0; i < N; i++) {
if (rnd.nextInt(2)) {
B.push_back(9 + rnd.nextInt(2));
} else {
B.push_back(1 + rnd.nextInt(2));
}
}
}
};
| [
"fushar@gmail.com"
] | fushar@gmail.com |
e3c26656a033f490c10a57d9846d5fb75ea89d64 | 91b10c3138158f48609b77a6939a841e08c8a7e6 | /src/TympanStateBase.h | 8bc07c518d0108cb516a664e0349fc8e26d7f29e | [
"MIT"
] | permissive | kanads2/Tympan_Library | 8d0a3516adaf72bf271acb9d6e399f4bf8d7c95b | 15d39d0eb389c2aafdc16e505a026f67f40595d1 | refs/heads/main | 2023-08-26T13:42:53.181186 | 2021-11-05T18:05:39 | 2021-11-05T18:05:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,474 | h |
#ifndef TympanStateBase_h
#define TympanStateBase_h
#include "AudioSettings_F32.h"
#include "Tympan.h"
#include "SerialManager_UI.h" //for the UI stuff
#include "SerialManagerBase.h" //for the UI stuff
class TympanStateBase {
public:
TympanStateBase(AudioSettings_F32 *given_settings, Print *given_serial) {
local_audio_settings = given_settings;
local_serial = given_serial;
}
//printing of CPU and memory status
bool flag_printCPUandMemory = false;
void printCPUandMemory(unsigned long curTime_millis = 0, unsigned long updatePeriod_millis = 0) {
static unsigned long lastUpdate_millis = 0;
//has enough time passed to update everything?
if (curTime_millis < lastUpdate_millis) lastUpdate_millis = 0; //handle wrap-around of the clock
if ((curTime_millis - lastUpdate_millis) > updatePeriod_millis) { //is it time to update the user interface?
printCPUandMemoryMessage();
lastUpdate_millis = curTime_millis; //we will use this value the next time around.
}
}
void printCPUandMemoryMessage(void) {
local_serial->print("CPU Cur/Pk: ");
local_serial->print(local_audio_settings->processorUsage(), 1);
local_serial->print("%/");
local_serial->print(local_audio_settings->processorUsageMax(), 1);
local_serial->print("%, ");
local_serial->print("Audio MEM Cur/Pk: ");
local_serial->print(AudioMemoryUsage_F32());
local_serial->print("/");
local_serial->print(AudioMemoryUsageMax_F32());
local_serial->print(", FreeRAM(B): ");
local_serial->print(Tympan::FreeRam());
local_serial->println();
}
float getCPUUsage(void) { return local_audio_settings->processorUsage(); }
protected:
Print *local_serial;
AudioSettings_F32 *local_audio_settings;
};
class TympanStateBase_UI : public TympanStateBase, public SerialManager_UI {
public:
TympanStateBase_UI(AudioSettings_F32 *given_settings, Print *given_serial) :
TympanStateBase(given_settings, given_serial), SerialManager_UI() {};
TympanStateBase_UI(AudioSettings_F32 *given_settings, Print *given_serial, SerialManagerBase *_sm) :
TympanStateBase(given_settings, given_serial), SerialManager_UI(_sm) {};
// ///////// here are the methods that you must implement from SerialManager_UI
virtual void printHelp(void) {
String prefix = getPrefix(); //getPrefix() is in SerialManager_UI.h, unless it is over-ridden in this class somewhere
Serial.println(F(" State: Prefix = ") + prefix);
Serial.println(F(" c/C: Enable/Disable printing of CPU and Memory usage"));
};
//virtual bool processCharacter(char c); //no used here
virtual bool processCharacterTriple(char mode_char, char chan_char, char data_char){
bool return_val = false;
if (mode_char != ID_char) return return_val; //does the mode character match our ID character? if so, it's us!
//we ignore the chan_char and only work with the data_char
return_val = true; //assume that we will find this character
switch (data_char) {
case 'c':
Serial.println("TympanStateBase_UI: printing memory and CPU.");
flag_printCPUandMemory = true;
setCPUButtons();
break;
case 'C':
Serial.println("TympanStateBase_UI: stopping printing of memory and CPU.");
flag_printCPUandMemory = false;
setCPUButtons();
break;
default:
return_val = false; //we did not process this character
}
return return_val;
};
virtual void setFullGUIState(bool activeButtonsOnly = false) {
setCPUButtons();
}
// /////////////////////////////////
//create the button sets for the TympanRemote's GUI
virtual TR_Card* addCard_cpuReporting(TR_Page *page_h) {
return addCard_cpuReporting(page_h, getPrefix());
}
virtual TR_Card* addCard_cpuReporting(TR_Page *page_h, String prefix) {
if (page_h == NULL) return NULL;
TR_Card *card_h = page_h->addCard(String("CPU Usage (%)"));
if (card_h == NULL) return NULL;
card_h->addButton("Start", prefix+"c", "cpuStart", 4); //label, command, id, width
card_h->addButton("" , "", "cpuValue", 4); //label, command, id, width //display the CPU value
card_h->addButton("Stop", prefix+"C", "", 4); //label, command, id, width
return card_h;
};
virtual TR_Page* addPage_globals(TympanRemoteFormatter *gui) {
if (gui == NULL) return NULL;
TR_Page *page_h = gui->addPage("State");
if (page_h == NULL) return NULL;
addCard_cpuReporting(page_h);
return page_h;
};
virtual TR_Page* addPage_default(TympanRemoteFormatter *gui) {return addPage_globals(gui);}
virtual void setCPUButtons(bool activeButtonsOnly = false) {
if (flag_printCPUandMemory) {
setButtonState("cpuStart",true);
} else {
if (!activeButtonsOnly) {
setButtonState("cpuStart",false);
}
}
};
virtual void printCPUtoGUI(unsigned long curTime_millis = 0, unsigned long updatePeriod_millis = 0) {
static unsigned long lastUpdate_millis = 0;
//has enough time passed to update everything?
if (curTime_millis < lastUpdate_millis) lastUpdate_millis = 0; //handle wrap-around of the clock
if ((curTime_millis - lastUpdate_millis) >= updatePeriod_millis) { //is it time to update the user interface?
Serial.println("TympanStateBase: printCPUtoGUI: sending " + String(getCPUUsage(),1));
setButtonText("cpuValue", String(getCPUUsage(),1));
lastUpdate_millis = curTime_millis; //we will use this value the next time around.
}
}
};
#endif | [
"chipaudette@yahoo.com"
] | chipaudette@yahoo.com |
5edaf91bf9ef669f6d7b46673ace4eb19388a1f4 | f967139bbda0f615bb2bd67e7d1c00b4f3987ed2 | /lab2/lab/testdelete.cpp | b0e0242c5f1defba4d8b458b99857b8ad9ca4031 | [] | no_license | xzeroth/Data-Structure | acafe8cec021d78a43d15d7b2142d4f009895a2d | a80da94e7c54cd5368cb526931956ce6b93adbb1 | refs/heads/master | 2022-02-23T03:56:36.619929 | 2019-10-18T03:30:40 | 2019-10-18T03:30:40 | 208,985,398 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 178 | cpp | #include <iostream>
using namespace std;
int main(){
double ans = 100.00;
for ( int i = 0 ; i < 3 ; i++){
ans /= 2;
cout << ans << endl;
}
cout << ans;
return 0;
} | [
"gunpark15@d-172-25-253-152.dhcp.virginia.edu"
] | gunpark15@d-172-25-253-152.dhcp.virginia.edu |
355295b836af23eb1539a77fc331f26a5152047b | 45e73b648d8732eda10894110ae82ec11f224ca1 | /GcdUsingRecursion.cpp | 6f7311810c55530494c77487384fbf59db220263 | [] | no_license | itsdevkr/Amcat | 357a786201a782602ea7390cec84a5384ad1e583 | f893318cf6f52016da783a3968b99420b6188583 | refs/heads/master | 2020-07-04T02:48:13.463642 | 2019-09-12T05:09:41 | 2019-09-12T05:09:41 | 202,129,137 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 179 | cpp | #include<iostream>
using namespace std;
int gcd(int m,int n)
{
if(n==0)
return m;
else
return gcd(n,m%n);
}
int main()
{
int m,n;
cin>>m>>n;
cout<<gcd(m,n);
return 0;
}
| [
"noreply@github.com"
] | noreply@github.com |
fdced6e3732d71a5925df79a807cd1323a4c44ea | 970378ec0a33caebbfe8db71174c9f5ed0ac09d5 | /Old Codes/lifireceiver/lifireceiver.ino | 29af710526232397651cd4e96529399ab38e966c | [] | no_license | eclubiitk/Li-Fi-E-Club | ddf306b05aa5edc24e214d8d8fca4752dac6f44c | 6f19cdf0896c0ec4d44994b52a6e5698ca4d1cef | refs/heads/master | 2022-01-31T00:24:57.500097 | 2019-07-24T20:40:53 | 2019-07-24T20:40:53 | 168,541,644 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 534 | ino | byte n=0;
byte u=0;
byte arr[10000];
void refine()
{
int h,k;
for(u=0;u<10000;u++)
{if(arr[u]==1 && arr[u+1]==1){h=u+2;break;}}
for(u=0;u<10000-h;u++)
{arr[u]=arr[u+h];}
for(u=0;u<10000-h;u++)
{if(arr[u]==0 && arr[u+1]==0 && arr[u+2]==0){k=u;break;}}
for(u=0;u<k;u++)
{
Serial.println(arr[u]);
}
n=k;
//k is the limit of indexes, all loop will work till k-1
}
void setup()
{
Serial.begin(9600);
pinMode(4,INPUT);
}
void loop()
{
if(n<10000)
arr[n]=digitalRead(A4);
else
{refine();exit(0);}
}
| [
"utkarshg99@gmail.com"
] | utkarshg99@gmail.com |
96430bfa20ddbaff353ebd1cd8263d7937985ad3 | 37ab17d6648d7493684cb2d94e5c3c7576fcf72a | /learning/thirdparty/САОД/v49/main.cpp | 048de6d1fe5e8412f3d033033c75998aa4c790a7 | [] | no_license | ArtyomAdov/learning_sibsutis | 74780d96658fe23efda916047ebc857215f81fc4 | 4a55314b91f7326ff792ca4521bd8bdf96f44bce | refs/heads/main | 2023-02-11T17:44:42.124067 | 2021-01-03T11:25:46 | 2021-01-03T11:25:46 | 326,384,347 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,029 | cpp | #include "Base.h"
#include "Huffman.h"
#include <cstdlib>
int main() {
Base o;
system("cls");
int key = 0;
do{
cout << "_______________________" << endl;
cout << "1. Print Base" << endl
<< "2. Sort" << endl
<< "3. Search In Base" << endl
<< "4. Print Queue" << endl
<< "5. Build " << endl
<< "6. Print Tree" << endl
<< "7. Search In Tree" << endl
<< "8. Code" << endl
<< "9. Print index" << endl
<< "0. Exit" << endl;
cout << ">> ";
cin >> key;
system("cls");
switch(key){
case 1: o.printBase(); break;
case 2: o.heapSort(); break;
case 3: o.searchBase(); break;
case 4: o.Q_print(); break;
case 5: o.B_tree(); break;
case 6: o.P_BTree(); break;
case 7: o.lookup_tree(); break;
case 8: Huffi(); break;
case 9: o.printBaseIndex(); break;
case 0: return 0;
default: break;
}
} while(1);
return 0;
}
| [
"death1angel1annushka1@gmail.com"
] | death1angel1annushka1@gmail.com |
5f583bff8ff4a44e3085159a628d7f472cc7f243 | 76df5692ecbf2089a693d953c2cb539f539b7fcf | /3party/boost/boost/fiber/future/future.hpp | 5d4ad78ab566182dfcb3715e09ae39870725d3eb | [
"BSL-1.0",
"Apache-2.0"
] | permissive | zouguangxian/omim | e2806af6348719728e0130194acf105d6a8a8bca | 939620a534af3d58288c4734fa99f3a85f4b587e | refs/heads/master | 2020-04-29T22:20:16.186339 | 2019-03-18T11:03:17 | 2019-03-18T19:38:39 | 176,444,212 | 1 | 1 | Apache-2.0 | 2019-03-19T07:05:49 | 2019-03-19T06:52:40 | C++ | UTF-8 | C++ | false | false | 11,233 | hpp |
// Copyright Oliver Kowalke 2013.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_FIBERS_FUTURE_HPP
#define BOOST_FIBERS_FUTURE_HPP
#include <algorithm>
#include <chrono>
#include <exception>
#include <boost/config.hpp>
#include <boost/fiber/detail/config.hpp>
#include <boost/fiber/exceptions.hpp>
#include <boost/fiber/future/detail/shared_state.hpp>
#include <boost/fiber/future/future_status.hpp>
namespace boost {
namespace fibers {
namespace detail {
template< typename R >
struct future_base {
typedef typename shared_state< R >::ptr_type ptr_type;
ptr_type state_{};
future_base() = default;
explicit future_base( ptr_type const& p) noexcept :
state_{ p } {
}
~future_base() = default;
future_base( future_base const& other) :
state_{ other.state_ } {
}
future_base( future_base && other) noexcept :
state_{ other.state_ } {
other.state_.reset();
}
future_base & operator=( future_base const& other) noexcept {
if ( this != & other) {
state_ = other.state_;
}
return * this;
}
future_base & operator=( future_base && other) noexcept {
if ( this != & other) {
state_ = other.state_;
other.state_.reset();
}
return * this;
}
bool valid() const noexcept {
return nullptr != state_.get();
}
std::exception_ptr get_exception_ptr() {
if ( ! valid() ) {
throw future_uninitialized{};
}
return state_->get_exception_ptr();
}
void wait() const {
if ( ! valid() ) {
throw future_uninitialized{};
}
state_->wait();
}
template< typename Rep, typename Period >
future_status wait_for( std::chrono::duration< Rep, Period > const& timeout_duration) const {
if ( ! valid() ) {
throw future_uninitialized{};
}
return state_->wait_for( timeout_duration);
}
template< typename Clock, typename Duration >
future_status wait_until( std::chrono::time_point< Clock, Duration > const& timeout_time) const {
if ( ! valid() ) {
throw future_uninitialized{};
}
return state_->wait_until( timeout_time);
}
};
template< typename R >
struct promise_base;
}
template< typename R >
class shared_future;
template< typename Signature >
class packaged_task;
template< typename R >
class future : private detail::future_base< R > {
private:
typedef detail::future_base< R > base_type;
friend struct detail::promise_base< R >;
friend class shared_future< R >;
template< typename Signature >
friend class packaged_task;
explicit future( typename base_type::ptr_type const& p) noexcept :
base_type{ p } {
}
public:
future() = default;
future( future const&) = delete;
future & operator=( future const&) = delete;
future( future && other) noexcept :
base_type{ std::move( other) } {
}
future & operator=( future && other) noexcept {
if ( this != & other) {
base_type::operator=( std::move( other) );
}
return * this;
}
shared_future< R > share();
R get() {
if ( ! base_type::valid() ) {
throw future_uninitialized{};
}
typename base_type::ptr_type tmp{};
tmp.swap( base_type::state_);
return std::move( tmp->get() );
}
using base_type::valid;
using base_type::get_exception_ptr;
using base_type::wait;
using base_type::wait_for;
using base_type::wait_until;
};
template< typename R >
class future< R & > : private detail::future_base< R & > {
private:
typedef detail::future_base< R & > base_type;
friend struct detail::promise_base< R & >;
friend class shared_future< R & >;
template< typename Signature >
friend class packaged_task;
explicit future( typename base_type::ptr_type const& p) noexcept :
base_type{ p } {
}
public:
future() = default;
future( future const&) = delete;
future & operator=( future const&) = delete;
future( future && other) noexcept :
base_type{ std::move( other) } {
}
future & operator=( future && other) noexcept {
if ( this != & other) {
base_type::operator=( std::move( other) );
}
return * this;
}
shared_future< R & > share();
R & get() {
if ( ! base_type::valid() ) {
throw future_uninitialized{};
}
typename base_type::ptr_type tmp{};
tmp.swap( base_type::state_);
return tmp->get();
}
using base_type::valid;
using base_type::get_exception_ptr;
using base_type::wait;
using base_type::wait_for;
using base_type::wait_until;
};
template<>
class future< void > : private detail::future_base< void > {
private:
typedef detail::future_base< void > base_type;
friend struct detail::promise_base< void >;
friend class shared_future< void >;
template< typename Signature >
friend class packaged_task;
explicit future( base_type::ptr_type const& p) noexcept :
base_type{ p } {
}
public:
future() = default;
future( future const&) = delete;
future & operator=( future const&) = delete;
inline
future( future && other) noexcept :
base_type{ std::move( other) } {
}
inline
future & operator=( future && other) noexcept {
if ( this != & other) {
base_type::operator=( std::move( other) );
}
return * this;
}
shared_future< void > share();
inline
void get() {
if ( ! base_type::valid() ) {
throw future_uninitialized{};
}
base_type::ptr_type tmp{};
tmp.swap( base_type::state_);
tmp->get();
}
using base_type::valid;
using base_type::get_exception_ptr;
using base_type::wait;
using base_type::wait_for;
using base_type::wait_until;
};
template< typename R >
class shared_future : private detail::future_base< R > {
private:
typedef detail::future_base< R > base_type;
explicit shared_future( typename base_type::ptr_type const& p) noexcept :
base_type{ p } {
}
public:
shared_future() = default;
~shared_future() = default;
shared_future( shared_future const& other) :
base_type{ other } {
}
shared_future( shared_future && other) noexcept :
base_type{ std::move( other) } {
}
shared_future( future< R > && other) noexcept :
base_type{ std::move( other) } {
}
shared_future & operator=( shared_future const& other) noexcept {
if ( this != & other) {
base_type::operator=( other);
}
return * this;
}
shared_future & operator=( shared_future && other) noexcept {
if ( this != & other) {
base_type::operator=( std::move( other) );
}
return * this;
}
shared_future & operator=( future< R > && other) noexcept {
base_type::operator=( std::move( other) );
return * this;
}
R const& get() const {
if ( ! valid() ) {
throw future_uninitialized{};
}
return base_type::state_->get();
}
using base_type::valid;
using base_type::get_exception_ptr;
using base_type::wait;
using base_type::wait_for;
using base_type::wait_until;
};
template< typename R >
class shared_future< R & > : private detail::future_base< R & > {
private:
typedef detail::future_base< R & > base_type;
explicit shared_future( typename base_type::ptr_type const& p) noexcept :
base_type{ p } {
}
public:
shared_future() = default;
~shared_future() = default;
shared_future( shared_future const& other) :
base_type{ other } {
}
shared_future( shared_future && other) noexcept :
base_type{ std::move( other) } {
}
shared_future( future< R & > && other) noexcept :
base_type{ std::move( other) } {
}
shared_future & operator=( shared_future const& other) noexcept {
if ( this != & other) {
base_type::operator=( other);
}
return * this;
}
shared_future & operator=( shared_future && other) noexcept {
if ( this != & other) {
base_type::operator=( std::move( other) );
}
return * this;
}
shared_future & operator=( future< R & > && other) noexcept {
base_type::operator=( std::move( other) );
return * this;
}
R & get() const {
if ( ! valid() ) {
throw future_uninitialized{};
}
return base_type::state_->get();
}
using base_type::valid;
using base_type::get_exception_ptr;
using base_type::wait;
using base_type::wait_for;
using base_type::wait_until;
};
template<>
class shared_future< void > : private detail::future_base< void > {
private:
typedef detail::future_base< void > base_type;
explicit shared_future( base_type::ptr_type const& p) noexcept :
base_type{ p } {
}
public:
shared_future() = default;
~shared_future() = default;
inline
shared_future( shared_future const& other) :
base_type{ other } {
}
inline
shared_future( shared_future && other) noexcept :
base_type{ std::move( other) } {
}
inline
shared_future( future< void > && other) noexcept :
base_type{ std::move( other) } {
}
inline
shared_future & operator=( shared_future const& other) noexcept {
if ( this != & other) {
base_type::operator=( other);
}
return * this;
}
inline
shared_future & operator=( shared_future && other) noexcept {
if ( this != & other) {
base_type::operator=( std::move( other) );
}
return * this;
}
inline
shared_future & operator=( future< void > && other) noexcept {
base_type::operator=( std::move( other) );
return * this;
}
inline
void get() const {
if ( ! valid() ) {
throw future_uninitialized{};
}
base_type::state_->get();
}
using base_type::valid;
using base_type::get_exception_ptr;
using base_type::wait;
using base_type::wait_for;
using base_type::wait_until;
};
template< typename R >
shared_future< R >
future< R >::share() {
if ( ! base_type::valid() ) {
throw future_uninitialized{};
}
return shared_future< R >{ std::move( * this) };
}
template< typename R >
shared_future< R & >
future< R & >::share() {
if ( ! base_type::valid() ) {
throw future_uninitialized{};
}
return shared_future< R & >{ std::move( * this) };
}
inline
shared_future< void >
future< void >::share() {
if ( ! base_type::valid() ) {
throw future_uninitialized{};
}
return shared_future< void >{ std::move( * this) };
}
}}
#endif
| [
"syershov@maps.me"
] | syershov@maps.me |
1d4196fea07a67055ca3aa0f0c1440dbb0224d20 | d6582135cbe7dc7837460e54094e21d70b5ac91b | /KNAPSACK ITERATIVE.cpp | 33e75be595048eff3220aebbeb870875052ca49e | [] | no_license | hst005/CODZEN-EXAMPLES | abc438ff3f539e7dcdc0ca031b40c0d7bbb2f6ee | 0b890b79b5b516c7c4ed337903802a379eabc778 | refs/heads/master | 2020-06-30T10:02:54.602401 | 2019-08-06T07:38:33 | 2019-08-06T07:38:33 | 200,796,966 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 833 | cpp | #include <iostream>
using namespace std;
int main()
{
int n,k;
cin>>n;
int w[n];
int prof[n];
for(int i=0;i<n;i++){
cin>>w[i];
}
for(int i=0;i<n;i++){
cin>>prof[i];
}
cin>>k;
int dp[n+1][k+1];
for(int i=0;i<=n;i++){
for(int j=0;j<=k;j++){
dp[i][j]=0;
}
}
//for(int i=0;i<=n;i++){
int i=0;
for(int j=0;j<=k;j++){
dp[i][j]=0;
}
for(int j=0;j<=n;j++){
dp[j][i]=0;
}
//}
//int w=k;
for(int i=1;i<=n;i++){
for(int j=0;j<=k;j++){
dp[i][j] = dp[i-1][j];
if(w[i-1] <= j){
dp[i][j] = max(dp[i][j],prof[i-1] + dp[i-1][j-w[i-1]]);
}
}
}
cout<<dp[n][k];
return 0;
}
| [
"noreply@github.com"
] | noreply@github.com |
3e48dc8116ca45e972066b612b79c1dc58b65db4 | 33642a9df869ab40b027c8faffa5bb215ee75713 | /include/control_to_stair/stair_container.h | ad609a2f6aa55db34cbdda65239795eed727c861 | [] | no_license | TAMUartlab/control_to_stair | 3f060771c03207fccdb72a732a2cc733bcf7033e | 28eb40a4c5d7b8f142e636dfe231dc47938fd918 | refs/heads/master | 2023-06-22T22:41:27.677178 | 2021-07-19T21:11:37 | 2021-07-19T21:11:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,642 | h | #ifndef STAIR_CONTAINER_H_
#define STAIR_CONTAINER_H_
#include <thread>
#include <atomic>
#include <mutex>
#include <chrono>
#include <vector>
#include <map>
#include <utility> //pair
#include <cmath> // std::abs
#define PROBABILITY_MAX 100
class STAIR_CONTAINER{
private:
float _probability;
int _count;
float _stair_container_x_coor;
float _stair_container_y_coor;
float _stair_container_z_coor;
float _stair_container_x_coor_old;
float _stair_container_y_coor_old;
float _stair_container_z_coor_old;
//bool _forget_start_flag;
bool _container_empty_flag;
std::string _probability_type;
float _prob_factor_geo_series;
float _forget_factor_geo_series;
int _prob_factor_linear;
int _forget_factor_linear;
float _pose_update_weight;
float _pose_update_weight_min = 0.7;
float _pose_update_weight_max = 0.95;
public:
void stair_container_clear();
bool stair_container_probforget_factor_update_geo_series(float prob_factor, float forget_factor); /*return type is about checking the probability type*/
bool stair_container_probforget_factor_update_linear(int prob_factor, int forget_factor); /*return type is about checking the probability type*/
void stair_container_pos_return(float *x, float *y, float *z);
float stair_container_pob_return();
bool stair_container_empty_flag_return();
void stair_container_prob_pos_update(float x, float y, float z, bool prob_count_update = true);
void stair_container_prob_update();
void stair_container_prob_forget();
/*constructor and destructor*/
STAIR_CONTAINER(std::string probability_type);
~STAIR_CONTAINER();
};
#endif
| [
"kangneoung@example.com"
] | kangneoung@example.com |
a01ea316fff88358b06649feae568b9238c63c26 | 2218bf21e8dda13e284b28678128c6d05d83067d | /tools/seqbTree.cpp | f2d9aba74cc01246c5bf321933aaef2aac3066b3 | [] | no_license | cjjIs/sjtu-oj | 293a086fa406c80e5f84428582d55e9e2dcb41f4 | 0e32ae1310fe91ef50a8522c60e01fc8c53c621a | refs/heads/master | 2020-04-08T04:01:31.921196 | 2018-11-25T05:09:12 | 2018-11-25T05:09:12 | 158,999,347 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,409 | cpp | #include <iostream>
using namespace std;
template <class T>
class binaryTree
{
public:
virtual void clear() = 0;//清除所有树变为空树
virtual bool isEmpty()const = 0;//判断是否为空树
virtual T root()const = 0;//返回根节点
virtual T parent(T x,T flag)const = 0;//返回x节点的父节点
virtual T leftChild(T x,T falg)const = 0;//返回x节点的左孩子
virtual T rightChild(T x,T flag)const = 0;//返回x节点的右孩子
virtual void delLeft(T x) = 0;//删除x节点的左子树
virtual void delRight(T x) = 0;//删除x节点的右子树
virtual void preOrder()const = 0;//前序遍历
virtual void midOrder()const = 0;//中序遍历
virtual void postOrder()const = 0;//后序遍历
virtual void levelOrder()const = 0;//层次遍历
};
class seqbTree:
{
private:
int *data;
int cLength;
int maxSize;
public:
seqbTree(int n){maxSize = n+1;data = new int[n+1]};
void clear(){cLength = 0;}
bool isEmpty(){return cLength == 0;}
int root(){return data[0];}
void creatTree()
{
int num,inputnum = 0;
cin>>num;
if(num == 0){cout<<'N'<<endl;return;};
int left,right;
cin>>left>>right;
inputnum++;
while(1)
{
data[num+1-inputnum]=inputnum;
if(left != 0)
{
realnum++;
data
}
if(realnum == num) return;
cin>>left>>right;
}
}
~seqbTree(){delete []date;}
};
int main()
{
cout<<"hello world"<<endl;
return 0;
} | [
"chenjiaju-up@sjtu.edu.cn"
] | chenjiaju-up@sjtu.edu.cn |
c5dd1107013079105ce52d9898f7c76966457371 | fe91ffa11707887e4cdddde8f386a8c8e724aa58 | /components/download/internal/background_service/file_monitor_impl.cc | a2dd120efb3bf006ad31350ae79ffb574bebaf25 | [
"BSD-3-Clause"
] | permissive | akshaymarch7/chromium | 78baac2b45526031846ccbaeca96c639d1d60ace | d273c844a313b1e527dec0d59ce70c95fd2bd458 | refs/heads/master | 2023-02-26T23:48:03.686055 | 2020-04-15T01:20:07 | 2020-04-15T01:20:07 | 255,778,651 | 2 | 1 | BSD-3-Clause | 2020-04-15T02:04:56 | 2020-04-15T02:04:55 | null | UTF-8 | C++ | false | false | 7,892 | cc | // Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/download/internal/background_service/file_monitor_impl.h"
#include "base/bind.h"
#include "base/callback_helpers.h"
#include "base/files/file_enumerator.h"
#include "base/files/file_util.h"
#include "base/stl_util.h"
#include "base/system/sys_info.h"
#include "base/task_runner_util.h"
#include "base/threading/scoped_blocking_call.h"
namespace download {
namespace {
// Helper function to calculate total file size in a directory, the total
// disk space and free disk space of the volume that contains that directory.
// Returns false if failed to query disk space or total disk space is empty.
bool CalculateDiskUtilization(const base::FilePath& file_dir,
int64_t& total_disk_space,
int64_t& free_disk_space,
int64_t& files_size) {
base::ScopedBlockingCall scoped_blocking_call(FROM_HERE,
base::BlockingType::MAY_BLOCK);
base::FileEnumerator file_enumerator(file_dir, false /* recursive */,
base::FileEnumerator::FILES);
int64_t size = 0;
// Compute the total size of all files in |file_dir|.
for (base::FilePath path = file_enumerator.Next(); !path.value().empty();
path = file_enumerator.Next()) {
if (!base::GetFileSize(path, &size)) {
DVLOG(1) << "File size query failed.";
return false;
}
files_size += size;
}
// Disk space of the volume that |file_dir| belongs to.
total_disk_space = base::SysInfo::AmountOfTotalDiskSpace(file_dir);
free_disk_space = base::SysInfo::AmountOfFreeDiskSpace(file_dir);
if (total_disk_space == -1 || free_disk_space == -1) {
DVLOG(1) << "System disk space query failed.";
return false;
}
if (total_disk_space == 0) {
DVLOG(1) << "Empty total system disk space.";
return false;
}
return true;
}
// Creates the download directory if it doesn't exist.
bool InitializeAndCreateDownloadDirectory(const base::FilePath& dir_path) {
// Create the download directory.
bool success = base::PathExists(dir_path);
if (!success) {
base::File::Error error = base::File::Error::FILE_OK;
success = base::CreateDirectoryAndGetError(dir_path, &error);
if (!success)
stats::LogsFileDirectoryCreationError(error);
}
// Records disk utilization histograms.
if (success) {
int64_t files_size = 0, total_disk_space = 0, free_disk_space = 0;
if (CalculateDiskUtilization(dir_path, total_disk_space, free_disk_space,
files_size)) {
stats::LogFileDirDiskUtilization(total_disk_space, free_disk_space,
files_size);
}
}
return success;
}
void GetFilesInDirectory(const base::FilePath& directory,
std::set<base::FilePath>& paths_out) {
base::ScopedBlockingCall scoped_blocking_call(FROM_HERE,
base::BlockingType::MAY_BLOCK);
base::FileEnumerator file_enumerator(directory, false /* recursive */,
base::FileEnumerator::FILES);
for (base::FilePath path = file_enumerator.Next(); !path.value().empty();
path = file_enumerator.Next()) {
paths_out.insert(path);
}
}
void DeleteFilesOnFileThread(const std::set<base::FilePath>& paths,
stats::FileCleanupReason reason) {
base::ScopedBlockingCall scoped_blocking_call(FROM_HERE,
base::BlockingType::MAY_BLOCK);
int num_delete_attempted = 0;
int num_delete_failed = 0;
int num_delete_by_external = 0;
for (const base::FilePath& path : paths) {
if (!base::PathExists(path)) {
num_delete_by_external++;
continue;
}
num_delete_attempted++;
DCHECK(!base::DirectoryExists(path));
if (!base::DeleteFile(path, false /* recursive */)) {
num_delete_failed++;
}
}
stats::LogFileCleanupStatus(reason, num_delete_attempted, num_delete_failed,
num_delete_by_external);
}
void DeleteUnknownFilesOnFileThread(
const base::FilePath& directory,
const std::set<base::FilePath>& download_file_paths) {
base::ScopedBlockingCall scoped_blocking_call(FROM_HERE,
base::BlockingType::MAY_BLOCK);
std::set<base::FilePath> files_in_dir;
GetFilesInDirectory(directory, files_in_dir);
std::set<base::FilePath> files_to_remove =
base::STLSetDifference<std::set<base::FilePath>>(files_in_dir,
download_file_paths);
DeleteFilesOnFileThread(files_to_remove, stats::FileCleanupReason::UNKNOWN);
}
bool HardRecoverOnFileThread(const base::FilePath& directory) {
base::ScopedBlockingCall scoped_blocking_call(FROM_HERE,
base::BlockingType::MAY_BLOCK);
std::set<base::FilePath> files_in_dir;
GetFilesInDirectory(directory, files_in_dir);
DeleteFilesOnFileThread(files_in_dir,
stats::FileCleanupReason::HARD_RECOVERY);
return InitializeAndCreateDownloadDirectory(directory);
}
} // namespace
FileMonitorImpl::FileMonitorImpl(
const base::FilePath& download_file_dir,
const scoped_refptr<base::SequencedTaskRunner>& file_thread_task_runner,
base::TimeDelta file_keep_alive_time)
: download_file_dir_(download_file_dir),
file_keep_alive_time_(file_keep_alive_time),
file_thread_task_runner_(file_thread_task_runner) {}
FileMonitorImpl::~FileMonitorImpl() = default;
void FileMonitorImpl::Initialize(InitCallback callback) {
base::PostTaskAndReplyWithResult(
file_thread_task_runner_.get(), FROM_HERE,
base::BindOnce(&InitializeAndCreateDownloadDirectory, download_file_dir_),
base::BindOnce(std::move(callback)));
}
void FileMonitorImpl::DeleteUnknownFiles(
const Model::EntryList& known_entries,
const std::vector<DriverEntry>& known_driver_entries) {
std::set<base::FilePath> download_file_paths;
for (Entry* entry : known_entries) {
download_file_paths.insert(entry->target_file_path);
}
for (const DriverEntry& driver_entry : known_driver_entries) {
download_file_paths.insert(driver_entry.current_file_path);
}
file_thread_task_runner_->PostTask(
FROM_HERE, base::BindOnce(&DeleteUnknownFilesOnFileThread,
download_file_dir_, download_file_paths));
}
void FileMonitorImpl::CleanupFilesForCompletedEntries(
const Model::EntryList& entries,
base::OnceClosure completion_callback) {
std::set<base::FilePath> files_to_remove;
for (auto* entry : entries) {
files_to_remove.insert(entry->target_file_path);
// TODO(xingliu): Consider logs life time after the file being deleted on
// the file thread.
stats::LogFileLifeTime(base::Time::Now() - entry->completion_time);
}
file_thread_task_runner_->PostTaskAndReply(
FROM_HERE,
base::BindOnce(&DeleteFilesOnFileThread, files_to_remove,
stats::FileCleanupReason::TIMEOUT),
std::move(completion_callback));
}
void FileMonitorImpl::DeleteFiles(
const std::set<base::FilePath>& files_to_remove,
stats::FileCleanupReason reason) {
file_thread_task_runner_->PostTask(
FROM_HERE,
base::BindOnce(&DeleteFilesOnFileThread, files_to_remove, reason));
}
void FileMonitorImpl::HardRecover(InitCallback callback) {
base::PostTaskAndReplyWithResult(
file_thread_task_runner_.get(), FROM_HERE,
base::BindOnce(&HardRecoverOnFileThread, download_file_dir_),
base::BindOnce(std::move(callback)));
}
} // namespace download
| [
"commit-bot@chromium.org"
] | commit-bot@chromium.org |
8d2bb4ab481606dd0b03b70a1cff3747c4a11d90 | 9bb65032b3926e2cb4aea93a6a733d2069c18438 | /puzzleQT/success.cpp | 044fcac6f92bad95fdadc5956b8ea3c09745b806 | [] | no_license | cosmosiwi/c-homework | fcbc91f0b04787bf492ad43f621f75ce6caefcb4 | 901ae6a4cd487944c09b83747a1604379c206ccd | refs/heads/main | 2023-09-03T18:01:53.912163 | 2021-10-31T14:54:58 | 2021-10-31T14:54:58 | 415,885,581 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 270 | cpp | #include "success.h"
#include "ui_success.h"
Success::Success(QWidget *parent) :
QWidget(parent),
ui(new Ui::Success)
{
ui->setupUi(this);
//connect(ui->exit, &QPushButton::clicked, this, SLOT(close()));
}
Success::~Success()
{
delete ui;
}
| [
"noreply@github.com"
] | noreply@github.com |
06382996d4711220802be36d6a093a549b490e51 | 2b60d3054c6c1ee01f5628b7745ef51f5cd3f07a | /Gemotry/AdaptDynamicMeshes/ADM/examples/twist/main.cc | 9cecb83fe10093ca933cb2e2b473da0d62299d39 | [] | no_license | LUOFQ5/NumericalProjectsCollections | 01aa40e61747d0a38e9b3a3e05d8e6857f0e9b89 | 6e177a07d9f76b11beb0974c7b720cd9c521b47e | refs/heads/master | 2023-08-17T09:28:45.415221 | 2021-10-04T15:32:48 | 2021-10-04T15:32:48 | 414,977,957 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,756 | cc | #include "twist.h"
#include "drawing.h"
#include "timestamp.h"
//#include "off2pov.h"
int main(int argc, char** argv)
{
Twist surf( 5., 1., 0. );
ADM::StochasticSampling criteria( &surf );
ADM::AdaptiveMesh mesh( "../base_mesh/cylinder.off", &criteria );
ADMViewer win( "Twist", &mesh, &surf, &criteria );
//win.KeyboardOptions();
win.show();
Fl::run();
/*
int i, num_iters = 130;
char filename[100];
for (i=0; i<num_iters; i++)
{
if (i>0) mesh.deform();
mesh.adapt();
//sprintf( filename, "./mesh/twist%.3d.off", i );
//mesh.save_mesh( filename );
sprintf( filename, "./mesh/twist%.3d.inc", i );
save_pov( mesh, filename );
}
*/
/*
// init
Timestamp init_tstart; CPUtimer init_cstart;
mesh.adapt();
CPUtimer init_cend; Timestamp init_tend;
std::cout << "INIT: \n"
<< "\t CPU " << (init_cend - init_cstart)
<< "\n \t TOTAL " << (init_tend - init_tstart)
<< std::endl;
// loop
int i, num_iters = 30;
double cpu_deform, cpu_adapt, total_deform, total_adapt;
Timestamp tstart, tend;
CPUtimer cstart, cend;
cpu_deform = cpu_adapt = total_deform = total_adapt = 0.;
for (i=0; i<num_iters; i++)
{
tstart.now(); cstart.now();
mesh.deform();
cend.now(); tend.now();
cpu_deform += (cend - cstart);
total_deform += (tend - tstart);
tstart.now(); cstart.now();
mesh.adapt();
cend.now(); tend.now();
cpu_adapt += (cend - cstart);
total_adapt += (tend - tstart);
}
double n = double(num_iters);
std::cout << "STATS: \n"
<< " \t CPU \t TOTAL \n"
<< "deform \t " << cpu_deform/n << " \t " << total_deform/n << std::endl
<< "adapt \t " << cpu_adapt/n << " \t " << total_adapt/n << std::endl;
*/
return 1;
}
| [
"1614345603@qq.com"
] | 1614345603@qq.com |
0dca670a2eeaa3c3d9de6d0955c0c35c7abcc2b5 | 656023a9537014e11fb0505749129ce2f22d1d41 | /common/shapes.cc | d758dcba3e189801af3135928f2bb375d3eb9921 | [] | no_license | twinkarma/poly2tri | 701069789983f9dc73e8bdb80c7f21b962746847 | cdc6f518892221ab0ae774c5fafa90a0f559fde8 | refs/heads/master | 2021-05-03T04:59:15.456896 | 2018-02-07T14:57:17 | 2018-02-07T14:57:17 | 120,628,904 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,154 | cc | /*
* Poly2Tri Copyright (c) 2009-2010, Poly2Tri Contributors
* http://code.google.com/p/poly2tri/
*
* All rights reserved.
*
* 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 following disclaimer.
* * Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* * Neither the name of Poly2Tri nor the names of its contributors may be
* used to endorse or promote products derived from this software without specific
* prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "shapes.h"
#include <iostream>
namespace p2t {
Triangle::Triangle(Point& a, Point& b, Point& c)
{
points_[0] = &a; points_[1] = &b; points_[2] = &c;
neighbors_[0] = NULL; neighbors_[1] = NULL; neighbors_[2] = NULL;
constrained_edge[0] = constrained_edge[1] = constrained_edge[2] = false;
delaunay_edge[0] = delaunay_edge[1] = delaunay_edge[2] = false;
interior_ = false;
}
// Update neighbor pointers
void Triangle::MarkNeighbor(Point* p1, Point* p2, Triangle* t)
{
if ((p1 == points_[2] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[2]))
neighbors_[0] = t;
else if ((p1 == points_[0] && p2 == points_[2]) || (p1 == points_[2] && p2 == points_[0]))
neighbors_[1] = t;
else if ((p1 == points_[0] && p2 == points_[1]) || (p1 == points_[1] && p2 == points_[0]))
neighbors_[2] = t;
else
assert(0);
}
// Exhaustive search to update neighbor pointers
void Triangle::MarkNeighbor(Triangle& t)
{
if (t.Contains(points_[1], points_[2])) {
neighbors_[0] = &t;
t.MarkNeighbor(points_[1], points_[2], this);
} else if (t.Contains(points_[0], points_[2])) {
neighbors_[1] = &t;
t.MarkNeighbor(points_[0], points_[2], this);
} else if (t.Contains(points_[0], points_[1])) {
neighbors_[2] = &t;
t.MarkNeighbor(points_[0], points_[1], this);
}
}
/**
* Clears all references to all other triangles and points
*/
void Triangle::Clear()
{
Triangle *t;
for( int i=0; i<3; i++ )
{
t = neighbors_[i];
if( t != NULL )
{
t->ClearNeighbor( this );
}
}
ClearNeighbors();
points_[0]=points_[1]=points_[2] = NULL;
}
void Triangle::ClearNeighbor(Triangle *triangle )
{
if( neighbors_[0] == triangle )
{
neighbors_[0] = NULL;
}
else if( neighbors_[1] == triangle )
{
neighbors_[1] = NULL;
}
else
{
neighbors_[2] = NULL;
}
}
void Triangle::ClearNeighbors()
{
neighbors_[0] = NULL;
neighbors_[1] = NULL;
neighbors_[2] = NULL;
}
void Triangle::ClearDelunayEdges()
{
delaunay_edge[0] = delaunay_edge[1] = delaunay_edge[2] = false;
}
Point* Triangle::OppositePoint(Triangle& t, Point& p)
{
//Twin modified
Point* cw = NULL;
cw = t.PointCW(p);
double x = cw->x;
double y = cw->y;
x = p.x;
y = p.y;
return PointCW(*cw);
}
// Legalized triangle by rotating clockwise around point(0)
void Triangle::Legalize(Point& point)
{
points_[1] = points_[0];
points_[0] = points_[2];
points_[2] = &point;
}
// Legalize triagnle by rotating clockwise around oPoint
void Triangle::Legalize(Point& opoint, Point& npoint)
{
if (&opoint == points_[0]) {
points_[1] = points_[0];
points_[0] = points_[2];
points_[2] = &npoint;
} else if (&opoint == points_[1]) {
points_[2] = points_[1];
points_[1] = points_[0];
points_[0] = &npoint;
} else if (&opoint == points_[2]) {
points_[0] = points_[2];
points_[2] = points_[1];
points_[1] = &npoint;
} else {
assert(0);
}
}
int Triangle::Index(const Point* p)
{
if (p == points_[0]) {
return 0;
} else if (p == points_[1]) {
return 1;
} else if (p == points_[2]) {
return 2;
}
assert(0);
}
int Triangle::EdgeIndex(const Point* p1, const Point* p2)
{
if (points_[0] == p1) {
if (points_[1] == p2) {
return 2;
} else if (points_[2] == p2) {
return 1;
}
} else if (points_[1] == p1) {
if (points_[2] == p2) {
return 0;
} else if (points_[0] == p2) {
return 2;
}
} else if (points_[2] == p1) {
if (points_[0] == p2) {
return 1;
} else if (points_[1] == p2) {
return 0;
}
}
return -1;
}
void Triangle::MarkConstrainedEdge(const int index)
{
constrained_edge[index] = true;
}
void Triangle::MarkConstrainedEdge(Edge& edge)
{
MarkConstrainedEdge(edge.p, edge.q);
}
// Mark edge as constrained
void Triangle::MarkConstrainedEdge(Point* p, Point* q)
{
if ((q == points_[0] && p == points_[1]) || (q == points_[1] && p == points_[0])) {
constrained_edge[2] = true;
} else if ((q == points_[0] && p == points_[2]) || (q == points_[2] && p == points_[0])) {
constrained_edge[1] = true;
} else if ((q == points_[1] && p == points_[2]) || (q == points_[2] && p == points_[1])) {
constrained_edge[0] = true;
}
}
// The point counter-clockwise to given point
Point* Triangle::PointCW(Point& point)
{
if (&point == points_[0]) {
return points_[2];
} else if (&point == points_[1]) {
return points_[0];
} else if (&point == points_[2]) {
return points_[1];
}
assert(0);
}
// The point counter-clockwise to given point
Point* Triangle::PointCCW(Point& point)
{
if (&point == points_[0]) {
return points_[1];
} else if (&point == points_[1]) {
return points_[2];
} else if (&point == points_[2]) {
return points_[0];
}
assert(0);
}
// The neighbor clockwise to given point
Triangle* Triangle::NeighborCW(Point& point)
{
if (&point == points_[0]) {
return neighbors_[1];
} else if (&point == points_[1]) {
return neighbors_[2];
}
return neighbors_[0];
}
// The neighbor counter-clockwise to given point
Triangle* Triangle::NeighborCCW(Point& point)
{
if (&point == points_[0]) {
return neighbors_[2];
} else if (&point == points_[1]) {
return neighbors_[0];
}
return neighbors_[1];
}
bool Triangle::GetConstrainedEdgeCCW(Point& p)
{
if (&p == points_[0]) {
return constrained_edge[2];
} else if (&p == points_[1]) {
return constrained_edge[0];
}
return constrained_edge[1];
}
bool Triangle::GetConstrainedEdgeCW(Point& p)
{
if (&p == points_[0]) {
return constrained_edge[1];
} else if (&p == points_[1]) {
return constrained_edge[2];
}
return constrained_edge[0];
}
void Triangle::SetConstrainedEdgeCCW(Point& p, bool ce)
{
if (&p == points_[0]) {
constrained_edge[2] = ce;
} else if (&p == points_[1]) {
constrained_edge[0] = ce;
} else {
constrained_edge[1] = ce;
}
}
void Triangle::SetConstrainedEdgeCW(Point& p, bool ce)
{
if (&p == points_[0]) {
constrained_edge[1] = ce;
} else if (&p == points_[1]) {
constrained_edge[2] = ce;
} else {
constrained_edge[0] = ce;
}
}
bool Triangle::GetDelunayEdgeCCW(Point& p)
{
if (&p == points_[0]) {
return delaunay_edge[2];
} else if (&p == points_[1]) {
return delaunay_edge[0];
}
return delaunay_edge[1];
}
bool Triangle::GetDelunayEdgeCW(Point& p)
{
if (&p == points_[0]) {
return delaunay_edge[1];
} else if (&p == points_[1]) {
return delaunay_edge[2];
}
return delaunay_edge[0];
}
void Triangle::SetDelunayEdgeCCW(Point& p, bool e)
{
if (&p == points_[0]) {
delaunay_edge[2] = e;
} else if (&p == points_[1]) {
delaunay_edge[0] = e;
} else {
delaunay_edge[1] = e;
}
}
void Triangle::SetDelunayEdgeCW(Point& p, bool e)
{
if (&p == points_[0]) {
delaunay_edge[1] = e;
} else if (&p == points_[1]) {
delaunay_edge[2] = e;
} else {
delaunay_edge[0] = e;
}
}
// The neighbor across to given point
Triangle& Triangle::NeighborAcross(Point& opoint)
{
if (&opoint == points_[0]) {
return *neighbors_[0];
} else if (&opoint == points_[1]) {
return *neighbors_[1];
}
return *neighbors_[2];
}
void Triangle::DebugPrint()
{
using namespace std;
cout << points_[0]->x << "," << points_[0]->y << " ";
cout << points_[1]->x << "," << points_[1]->y << " ";
cout << points_[2]->x << "," << points_[2]->y << endl;
}
}
| [
"hi@twin.uk.com"
] | hi@twin.uk.com |
ed472228f3d5f44cd7744e0208a35baa16e64ce3 | ab3493fc0ed9cfb7c1a8916164cd04839cae2b57 | /src/toolchain/core/CodeDom/ReturnExpression.h | 894bfa563a45ca8ca11d95d080699b02c7483133 | [
"BSD-2-Clause"
] | permissive | chetui/cc0 | 13df2720fcfa01d502e7c404c502153cc1aab596 | 98f199fc182f3730ef9f6bb65eacc7436862e97a | refs/heads/master | 2020-12-26T00:46:51.761499 | 2014-05-01T03:30:40 | 2014-05-01T03:30:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 452 | h | #ifndef RETURNEXPRESSION_H
#define RETURNEXPRESSION_H
#include "Expression.h"
class ReturnExpression : public Expression
{
private:
Expression *_value;
public:
virtual Type* GetType();
virtual Expression* GetLValue();
virtual void Accept(ExpressionVisitor* visitor);
ReturnExpression();
ReturnExpression(Expression *value);
virtual ~ReturnExpression();
public:
Expression *GetValue();
};
#endif // RETURNEXPRESSION_H
| [
"Vincent@Lisa-PC.(none)"
] | Vincent@Lisa-PC.(none) |
f80661adf3af0d083880dc7f3618b55a47d114c4 | f14ea769199a846260a804865bbc4105d78d5e71 | /AssertionProj.cpp | 742ba201467994184aada6e0bbf169602b719889 | [] | no_license | zerosmart777/Dungeon-Escaper | 7b079e8d1514224c7db0585f800e3892339b0e43 | e263325f02a32bd148f3013f525fb26ac88134e1 | refs/heads/master | 2020-06-12T21:04:06.027660 | 2019-06-29T15:58:16 | 2019-06-29T15:58:16 | 194,423,513 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 752 | cpp | // AssertionProj.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include "pch.h"
#include <iostream>
#include <map>
#include "CWGame.hpp"
int main()
{
CWGame game;
if (!game.init())
{
std::cout << "Some error inside initilization";
return 0;
}
while (true)
{
if (game.lifeCheck()==true) {
system("CLS");
std::cout << "========" << std::endl;
std::cout << "You Lose" << std::endl;
std::cout << "========" << std::endl;
break;
}
else if (game.ItemCheck() == 1) {
system("CLS");
std::cout << "========" << std::endl;
std::cout << "You Win" << std::endl;
std::cout << "========" << std::endl;
break;
}
else {
game.update();
}
}
game.destroy();
}
| [
"50065934+zerosmart777@users.noreply.github.com"
] | 50065934+zerosmart777@users.noreply.github.com |
69463263ef174369ab35d0e0975ccba30b4ff036 | ad77154f4f9e7214c10cb1cd040efad9eb1c5160 | /Binary tree/Left View of Binary Tree .cpp | e1ed55889ec1819906513fdea1aa64427a8dd8ad | [] | no_license | Phoenix-RK/GeeksForGeeks | 17e745ad81ed1dda8df1a1021f32a13b0ad6c9ec | fd0b3323f836ba9abc148fb585953d16a399c0dd | refs/heads/master | 2021-05-16T20:53:51.253913 | 2021-02-04T16:44:24 | 2021-02-04T16:44:24 | 250,465,074 | 2 | 1 | null | 2021-01-20T12:36:10 | 2020-03-27T07:09:33 | C++ | UTF-8 | C++ | false | false | 3,582 | cpp | //Phoenix_RK
/*
https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1
Given a Binary Tree, print Left view of it. Left view of a Binary Tree is set of nodes visible when tree is visited from Left side. The task is to complete the function leftView(), which accepts root of the tree as argument.
Left view of following tree is 1 2 4 8.
1
/ \
2 3
/ \ / \
4 5 6 7
\
8
Example 1:
Input:
1
/ \
3 2
Output: 1 3
********************************************************
Using level order traversal, just print the leftmost node in every level
*/
#include <bits/stdc++.h>
using namespace std;
// Tree Node
struct Node
{
int data;
Node* left;
Node* right;
};
void leftView(struct Node *root);
// Utility function to create a new Tree Node
Node* newNode(int val)
{
Node* temp = new Node;
temp->data = val;
temp->left = NULL;
temp->right = NULL;
return temp;
}
// Function to Build Tree
Node* buildTree(string str)
{
// Corner Case
if(str.length() == 0 || str[0] == 'N')
return NULL;
// Creating vector of strings from input
// string after spliting by space
vector<string> ip;
istringstream iss(str);
for(string str; iss >> str; )
ip.push_back(str);
// for(string i:ip)
// cout<<i<<" ";
// cout<<endl;
// Create the root of the tree
Node* root = newNode(stoi(ip[0]));
// Push the root to the queue
queue<Node*> queue;
queue.push(root);
// Starting from the second element
int i = 1;
while(!queue.empty() && i < ip.size()) {
// Get and remove the front of the queue
Node* currNode = queue.front();
queue.pop();
// Get the current node's value from the string
string currVal = ip[i];
// If the left child is not null
if(currVal != "N") {
// Create the left child for the current node
currNode->left = newNode(stoi(currVal));
// Push it to the queue
queue.push(currNode->left);
}
// For the right child
i++;
if(i >= ip.size())
break;
currVal = ip[i];
// If the right child is not null
if(currVal != "N") {
// Create the right child for the current node
currNode->right = newNode(stoi(currVal));
// Push it to the queue
queue.push(currNode->right);
}
i++;
}
return root;
}
int main() {
int t;
scanf("%d ",&t);
while(t--)
{
string s;
getline(cin,s);
Node* root = buildTree(s);
leftView(root);
cout << endl;
}
return 0;
}
// } Driver Code Ends
/* A binary tree node
struct Node
{
int data;
struct Node* left;
struct Node* right;
Node(int x){
data = x;
left = right = NULL;
}
};
*/
int height(Node *root)
{
if(root==NULL)
return 0;
return 1+max(height(root->left),height(root->right));
}
// A wrapper over leftViewUtil()
void print(Node* root,int level,int& flag)
{
if(root==NULL || flag==1)
return;
if(level==0)
{
cout<<root->data<<" ";
flag=1;
return;
}
print(root->left,level-1,flag);
print(root->right,level-1,flag);
}
void leftView(Node *root)
{
// Your code here
int h=height(root);
int flag=0;
for(int i=0;i<h;i++)
{
print(root,i,flag);
flag=0;
}
}
| [
"noreply@github.com"
] | noreply@github.com |
840f0524bd6f4f4f08a5d1d485af9615085d54fd | 03d2c56158331505855a758a047743e782222ce6 | /utility/servo-init/servo-init.ino | 2fc4c11991a3c7325a3dfcecbb846294f9053938 | [] | no_license | DarthKipsu/potter | 512fd439a939fc2817d8e7d97072f69601b16ca9 | 8affaf6a7777d68808c9c9925e234f317ad1b245 | refs/heads/master | 2021-01-13T14:27:55.875034 | 2017-01-28T16:01:21 | 2017-01-28T16:01:21 | 79,047,951 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 187 | ino | #include <Servo.h>
Servo servo;
void setup() {
servo.attach(3);
}
void loop() {
servo.write(90);
delay(2000);
servo.write(0);
delay(500);
servo.write(180);
delay(500);
}
| [
"darth.kipsu@gmail.com"
] | darth.kipsu@gmail.com |
32f7a57aa0f16dcef67036268dbc56886f489f76 | dba9a8852119805d4cd0c8b163637d08caac6f49 | /Mednafen/src/drivers/cheat.cpp | c0a39e0d47b38f93cea5e67869bbfd5b4477795b | [] | no_license | billy12/OpenEmu | b9d9ce6c72498ee6fe6f9d807abb0a6a72c2155d | cab889fbd7f06ab5b2c0ec91164319a7ad6e191c | refs/heads/master | 2020-12-25T05:53:21.496096 | 2011-05-16T00:18:59 | 2011-05-16T00:18:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,083 | cpp | /* Mednafen - Multi-system Emulator
*
* 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.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "main.h"
#include <ctype.h>
#include <trio/trio.h>
#include "console.h"
static SDL_Thread *CheatThread = NULL;
static SDL_mutex *CheatMutex = NULL;
static bool isactive = 0;
static char *pending_text = NULL;
class CheatConsoleT : public MDFNConsole
{
public:
CheatConsoleT(void)
{
SetShellStyle(1);
SetSmallFont(0);
}
virtual bool TextHook(UTF8 *text)
{
SDL_mutexP(CheatMutex);
pending_text = strdup((char *)text);
SDL_mutexV(CheatMutex);
return(1);
}
void Draw(SDL_Surface *surface, const SDL_Rect *src_rect)
{
SDL_mutexP(CheatMutex);
MDFNConsole::Draw(surface, src_rect);
SDL_mutexV(CheatMutex);
}
void WriteLine(UTF8 *text)
{
SDL_mutexP(CheatMutex);
MDFNConsole::WriteLine(text);
SDL_mutexV(CheatMutex);
}
void AppendLastLine(UTF8 *text)
{
SDL_mutexP(CheatMutex);
MDFNConsole::AppendLastLine(text);
SDL_mutexV(CheatMutex);
}
};
static CheatConsoleT CheatConsole;
static void CHEAT_printf(const char *format, ...)
{
char temp[2048];
va_list ap;
va_start(ap, format);
trio_vsnprintf(temp, 2048, format, ap);
CheatConsole.WriteLine((UTF8*) temp);
//MDFND_PrintError(temp);
va_end(ap);
}
static void CHEAT_puts(const char *string)
{
CheatConsole.WriteLine((UTF8 *)string);
}
static void CHEAT_gets(char *s, int size)
{
SDL_mutexP(CheatMutex);
while(!pending_text)
{
SDL_mutexV(CheatMutex);
SDL_Delay(5);
SDL_mutexP(CheatMutex);
}
strncpy(s, pending_text, size - 1);
s[size - 1] = 0;
free(pending_text);
pending_text = NULL;
CheatConsole.AppendLastLine((UTF8*)s);
SDL_mutexV(CheatMutex);
}
static char CHEAT_getchar(char def)
{
uint8 buf[2];
CHEAT_gets((char *)buf, 2);
if(buf[0] == 0)
return(def);
return(buf[0]);
}
static void GetString(char *s, int max)
{
CHEAT_gets(s,max);
}
static uint64 GetUI(uint64 def)
{
char buf[64];
memset(buf, 0, sizeof(buf));
CHEAT_gets(buf,64);
if(!buf[0])
return(def);
if(buf[0] == '$')
trio_sscanf(buf + 1, "%llx", &def); // $0FCE
else if(buf[0] == '0' && tolower(buf[1]) == 'x')
trio_sscanf(buf + 2, "%llx", &def); // 0x0FCE
else if(tolower(buf[strlen(buf) - 1]) == 'h') // 0FCEh
trio_sscanf(buf, "%llx", &def);
else
trio_sscanf(buf,"%lld", &def);
return def;
}
static int GetYN(int def)
{
char buf[32];
CHEAT_printf("(Y/N)[%s]: ",def?"Y":"N");
CHEAT_gets(buf,32);
if(buf[0]=='y' || buf[0]=='Y')
return(1);
if(buf[0]=='n' || buf[0]=='N')
return(0);
return(def);
}
/*
** Begin list code.
**
*/
static int listcount;
static int listids[10];
static int listsel;
static int mordoe;
void BeginListShow(void)
{
listcount=0;
listsel=-1;
mordoe=0;
}
/* Hmm =0 for in list choices, hmm=1 for end of list choices. */
/* Return equals 0 to continue, -1 to stop, otherwise a number. */
int ListChoice(int hmm)
{
char buf[32];
if(!hmm)
{
int num=0;
tryagain:
CHEAT_printf(" <'Enter' to continue, (S)top, or #> ");
CHEAT_gets(buf,32);
if(buf[0]=='s' || buf[0]=='S') return(-1);
if(!buf[0]) return(0);
if(!trio_sscanf(buf,"%d",&num))
return(0);
if(num<1) goto tryagain;
return(num);
}
else
{
int num=0;
tryagain2:
CHEAT_printf(" <'Enter' to make no selection, or #> ");
CHEAT_gets(buf,32);
if(!buf[0]) return(0);
if(!trio_sscanf(buf,"%d",&num))
return(0);
if(num<1) goto tryagain2;
return(num);
}
}
int EndListShow(void)
{
if(mordoe)
{
int r=ListChoice(1);
if(r>0 && r<=listcount)
listsel=listids[r-1];
}
return(listsel);
}
/* Returns 0 to stop listing, 1 to continue. */
int AddToList(char *text, uint32 id)
{
if(listcount==10)
{
int t=ListChoice(0);
mordoe=0;
if(t==-1) return(0); // Stop listing.
else if(t>0 && t<11)
{
listsel=listids[t-1];
return(0);
}
listcount=0;
}
mordoe=1;
listids[listcount]=id;
CHEAT_printf("%2d) %s",listcount+1,text);
listcount++;
return(1);
}
/*
**
** End list code.
**/
typedef struct MENU {
const char *text;
void *action;
int type; // 0 for menu, 1 for function.
} MENU;
static void SetOC(void)
{
MDFNI_CheatSearchSetCurrentAsOriginal();
}
static void UnhideEx(void)
{
MDFNI_CheatSearchShowExcluded();
}
static void ToggleCheat(int num)
{
CHEAT_printf("Cheat %d %sabled.",1+num,
MDFNI_ToggleCheat(num)?"en":"dis");
}
static void ModifyCheat(int num)
{
char *name;
char buf[256];
uint32 A;
uint64 V;
uint64 compare;
char type;
int status;
unsigned int bytelen;
bool bigendian;
MDFNI_GetCheat(num, &name, &A, &V, &compare, &status, &type, &bytelen, &bigendian);
CHEAT_printf("Name [%s]: ",name);
GetString(buf,256);
/* This obviously doesn't allow for cheats with no names. Bah. Who wants
nameless cheats anyway...
*/
if(buf[0])
name=buf; // Change name when MDFNI_SetCheat() is called.
else
name=0; // Don't change name when MDFNI_SetCheat() is called.
CHEAT_printf("Address [$%08x]: ",(unsigned int)A);
A=GetUI(A);
CHEAT_printf("Byte length [%d]: ", bytelen);
bytelen = GetUI(bytelen);
if(bytelen > 1)
{
CHEAT_printf("Big endian? [%c]: ", bigendian ? 'Y' : 'N');
bigendian = GetYN(bigendian);
}
else
bigendian = 0;
CHEAT_printf("Value [%03lld]: ",(unsigned int)V);
V=GetUI(V);
do
{
CHEAT_printf("Type('R'=replace,'S'=Read Substitute(or 'C' with compare)) [%c]: ",type);
type = toupper(CHEAT_getchar(type));
} while(type != 'R' && type !='S' && type !='C');
if(type == 'C')
{
CHEAT_printf("Compare [%03lld]: ",compare);
compare = GetUI(compare);
}
CHEAT_printf("Enable? ");
status = GetYN(status);
MDFNI_SetCheat(num, name, A, V, compare, status, type, bytelen, bigendian);
}
bool MDFNI_DecodeGBGG(const char *str, uint32 *a, uint8 *v, uint8 *c, char *type);
static void AddCheatGGPAR(int which)
{
uint32 A;
uint8 V;
uint8 C;
char type;
char name[256],code[256];
CHEAT_printf("Name: ");
GetString(name,256);
CHEAT_printf("Code: ");
GetString(code,256);
CHEAT_printf("Add cheat \"%s\" for code \"%s\"?",name,code);
if(GetYN(0))
{
if(which)
{
if(!MDFNI_DecodePAR(code,&A,&V,&C,&type))
{
CHEAT_puts("Invalid Game Genie code.");
return;
}
}
else
{
if(!strcmp(CurGame->shortname, "gb"))
{
if(!MDFNI_DecodeGBGG(code, &A, &V, &C, &type))
{
CHEAT_puts("Invalid Game Genie code.");
return;
}
}
else
{
if(!MDFNI_DecodeGG(code,&A,&V,&C, &type))
{
CHEAT_puts("Invalid Game Genie code.");
return;
}
}
}
if(MDFNI_AddCheat(name,A,V,C,type, 1, 0))
CHEAT_puts("Cheat added.");
else
CHEAT_puts("Error adding cheat.");
}
}
static void AddCheatGG(void)
{
AddCheatGGPAR(0);
}
static void AddCheatPAR(void)
{
AddCheatGGPAR(1);
}
static void AddCheatParam(uint32 A, uint64 V, unsigned int bytelen, bool bigendian)
{
char name[256];
CHEAT_printf("Name: ");
GetString(name,256);
CHEAT_printf("Address [$%08x]: ", A);
A=GetUI(A);
CHEAT_printf("Byte length [%d]: ", bytelen);
bytelen = GetUI(bytelen);
if(bytelen > 1)
{
CHEAT_printf("Big endian? [%c]: ", bigendian ? 'Y' : 'N');
bigendian = GetYN(bigendian);
}
else
bigendian = 0;
CHEAT_printf("Value [%llu]: ", V);
V=GetUI(V);
CHEAT_printf("Add cheat \"%s\" for address $%08x with value %llu?",name,(unsigned int)A,(unsigned long long)V);
if(GetYN(0))
{
if(MDFNI_AddCheat(name,A,V,0, 'R', bytelen, bigendian))
CHEAT_puts("Cheat added.");
else
CHEAT_puts("Error adding cheat.");
}
}
static void AddCheat(void)
{
AddCheatParam(0, 0, 1, 0);
}
static int lid;
static int clistcallb(char *name, uint32 a, uint64 v, uint64 compare, int s, char type, unsigned int length, bool bigendian, void *data)
{
char tmp[512];
int ret;
if(type == 'C')
trio_snprintf(tmp, 512, "%s $%08x:%03lld:%03lld - %s",s?"*":" ",a,v,compare,name);
else
trio_snprintf(tmp, 512, "%s $%08x:%03lld - %s",s?"*":" ",a,v,name);
if(type != 'R')
tmp[2]='S';
ret = AddToList(tmp,lid);
lid++;
return(ret);
}
static void ListCheats(void)
{
int which;
lid=0;
BeginListShow();
MDFNI_ListCheats(clistcallb,0);
which=EndListShow();
if(which>=0)
{
char tmp[32];
CHEAT_printf(" <(T)oggle status, (M)odify, or (D)elete this cheat.> ");
CHEAT_gets(tmp,32);
switch(tolower(tmp[0]))
{
case 't':ToggleCheat(which);
break;
case 'd':if(!MDFNI_DelCheat(which))
CHEAT_puts("Error deleting cheat!");
else
CHEAT_puts("Cheat has been deleted.");
break;
case 'm':ModifyCheat(which);
break;
}
}
}
static void ResetSearch(void)
{
MDFNI_CheatSearchBegin();
CHEAT_puts("Done.");
}
static unsigned int searchbytelen = 1;
static bool searchbigendian = 0;
static int srescallb(uint32 a, uint64 last, uint64 current, void *data)
{
char tmp[256];
if(searchbytelen == 8)
trio_snprintf(tmp, 256, "$%08x:%020llu:%020llu",(unsigned int)a,(unsigned long long)last,(unsigned long long)current);
if(searchbytelen == 7)
trio_snprintf(tmp, 256, "$%08x:%017llu:%017llu",(unsigned int)a,(unsigned long long)last,(unsigned long long)current);
if(searchbytelen == 6)
trio_snprintf(tmp, 256, "$%08x:%015llu:%015llu",(unsigned int)a,(unsigned long long)last,(unsigned long long)current);
if(searchbytelen == 5)
trio_snprintf(tmp, 256, "$%08x:%013llu:%013llu",(unsigned int)a,(unsigned long long)last,(unsigned long long)current);
if(searchbytelen == 4)
trio_snprintf(tmp, 256, "$%08x:%10u:%10u",(unsigned int)a,(unsigned int)last,(unsigned int)current);
else if(searchbytelen == 3)
trio_snprintf(tmp, 256, "$%08x:%08u:%08u",(unsigned int)a,(unsigned int)last,(unsigned int)current);
else if(searchbytelen == 2)
trio_snprintf(tmp, 256, "$%08x:%05u:%05u",(unsigned int)a,(unsigned int)last,(unsigned int)current);
else if(searchbytelen == 1)
trio_snprintf(tmp, 256, "$%08x:%03u:%03u",(unsigned int)a,(unsigned int)last,(unsigned int)current);
else // > 4
trio_snprintf(tmp, 256, "$%08x:%020llu:%020llu",(unsigned int)a,(unsigned long long)last,(unsigned long long)current);
return(AddToList(tmp,a));
}
static void ShowRes(void)
{
int n=MDFNI_CheatSearchGetCount();
CHEAT_printf(" %d results:",n);
if(n)
{
int which;
BeginListShow();
MDFNI_CheatSearchGet(srescallb, 0);
which=EndListShow();
if(which>=0)
AddCheatParam(which,0, searchbytelen, searchbigendian);
}
}
static int ShowShortList(const char *moe[], unsigned int n, int def)
{
unsigned int x;
int c;
unsigned int baa;
char tmp[256];
red:
for(x=0;x<n;x++)
CHEAT_printf("%d) %s",x+1,moe[x]);
CHEAT_puts("D) Display List");
clo:
CHEAT_puts("");
CHEAT_printf("Selection [%d]> ",def+1);
CHEAT_gets(tmp,256);
if(!tmp[0])
return def;
c=tolower(tmp[0]);
baa=c-'1';
if(baa<n)
return baa;
else if(c=='d')
goto red;
else
{
CHEAT_puts("Invalid selection.");
goto clo;
}
}
static void DoSearch(void)
{
static int v1=0,v2=0;
static int method=0;
const char *m[6]={"O==V1 && C==V2","O==V1 && |O-C|==V2","|O-C|==V2","O!=C","Value decreased","Value increased"};
CHEAT_puts("");
CHEAT_printf("Search Filter:");
method = ShowShortList(m,6,method);
if(method<=1)
{
CHEAT_printf("V1 [%03d]: ",v1);
v1=GetUI(v1);
}
if(method<=2)
{
CHEAT_printf("V2 [%03d]: ",v2);
v2=GetUI(v2);
}
CHEAT_printf("Byte length(1-8)[%1d]: ", searchbytelen);
searchbytelen = GetUI(searchbytelen);
if(searchbytelen > 1)
{
CHEAT_printf("Big endian? [%c]: ", searchbigendian ? 'Y' : 'N');
searchbigendian = GetYN(searchbigendian);
}
else
searchbigendian = 0;
MDFNI_CheatSearchEnd(method, v1, v2, searchbytelen, searchbigendian);
CHEAT_puts("Search completed.");
}
static void DoMenu(MENU *men, bool topmost = 0)
{
int x=0;
redisplay:
x=0;
CHEAT_puts("");
while(men[x].text)
{
CHEAT_printf("%d) %s",x+1,men[x].text);
x++;
}
CHEAT_puts("D) Display Menu");
if(!topmost)
CHEAT_puts("X) Return to Previous");
{
char buf[32];
int c;
recommand:
CHEAT_printf("Command> ");
CHEAT_gets(buf,32);
c=tolower(buf[0]);
if(c == 0)
goto recommand;
else if(c=='d')
goto redisplay;
else if(c=='x' && !topmost)
{
return;
}
else if(trio_sscanf(buf,"%d",&c))
{
if(c>x) goto invalid;
if(men[c-1].type)
{
void (*func)(void)=(void(*)())men[c-1].action;
func();
}
else
DoMenu((MENU*)men[c-1].action); /* Mmm...recursivey goodness. */
goto redisplay;
}
else
{
invalid:
CHEAT_puts("Invalid command.");
goto recommand;
}
}
}
int CheatLoop(void *arg)
{
MENU NewCheatsMenuNES[] =
{
{"Add Cheat",(void *)AddCheat, 1},
{"Reset Search",(void *)ResetSearch, 1},
{"Do Search",(void *)DoSearch, 1},
{"Set Original to Current",(void *)SetOC, 1},
{"Unhide Excluded",(void *)UnhideEx, 1},
{"Show Results",(void *)ShowRes, 1},
{"Add Game Genie Cheat",(void *)AddCheatGG, 1},
{"Add PAR Cheat",(void *)AddCheatPAR, 1},
{0}
};
MENU NewCheatsMenuGB[] =
{
{"Add Cheat",(void *)AddCheat, 1},
{"Reset Search",(void *)ResetSearch, 1},
{"Do Search",(void *)DoSearch, 1},
{"Set Original to Current",(void *)SetOC, 1},
{"Unhide Excluded",(void *)UnhideEx, 1},
{"Show Results",(void *)ShowRes, 1},
{"Add Game Genie Cheat",(void *)AddCheatGG, 1},
{0}
};
MENU NewCheatsMenu[] =
{
{"Add Cheat",(void *)AddCheat, 1},
{"Reset Search",(void *)ResetSearch, 1},
{"Do Search",(void *)DoSearch, 1},
{"Set Original to Current",(void *)SetOC, 1},
{"Unhide Excluded",(void *)UnhideEx, 1},
{"Show Results",(void *)ShowRes, 1},
{0}
};
MENU *thenewcm = NewCheatsMenu;
if(!strcmp(CurGame->shortname, "nes"))
thenewcm = NewCheatsMenuNES;
else if(!strcmp(CurGame->shortname, "gb"))
thenewcm = NewCheatsMenuGB;
MENU MainMenu[] = {
{"List Cheats",(void *)ListCheats,1},
{"New Cheats...",(void *)thenewcm,0},
{0}
};
DoMenu(MainMenu, 1);
return(1);
}
void ShowConsoleCheatConfig(bool show)
{
if(!CheatMutex)
CheatMutex = SDL_CreateMutex();
PauseGameLoop(show);
if(show)
{
if(!CheatThread)
CheatThread = SDL_CreateThread(CheatLoop, NULL);
}
isactive = show;
}
bool IsConsoleCheatConfigActive(void)
{
return(isactive);
}
void DrawCheatConsole(SDL_Surface *surface, const SDL_Rect *src_rect)
{
if(!isactive) return;
CheatConsole.Draw(surface, src_rect);
}
int CheatEventHook(const SDL_Event *event)
{
if(!isactive) return(1);
return(CheatConsole.Event(event));
}
| [
"vade@vade.info"
] | vade@vade.info |
1261f0d606c89aeb483c86f853270936ee9625e4 | 4d225758c30ad6e9faa6645bf705d6e31135bf9a | /CompetitiveProgramming/MultiplesOf3&5.cpp | 02c809d65820b3c841f2531fd79b82926f603489 | [] | no_license | abhi311998/Programming | ba51198e7262213cba051f3f83407082a003008a | 664afaa24a0a0db2d88d95a5feec5f561a3a8e0f | refs/heads/master | 2021-07-18T15:28:21.704570 | 2020-07-23T03:58:13 | 2020-07-23T03:58:13 | 194,397,754 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 293 | cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
short T; //Test Case variable
cin>>T;
while(T--)
{
int n;
cin>>n;
n=n-1;
long long a,b,c;
a=n/3;
b=n/5;
c=n/15;
a=a*(a+1)/2;
b=b*(b+1)/2;
c=c*(c+1)/2;
cout<<(3*a+5*b-15*c)<<"\n";
}
}
| [
"noreply@github.com"
] | noreply@github.com |
a995279b35a1214222aa1bf8a5b1ef58c2c142b8 | 97c102e250d43099788a3fb48fb26a813fe6c543 | /Source/TP_IndieGame/TP_IndieGameCharacter.h | 52d87b45f752e50ab4a23df806f2cc0f6ebd80da | [] | no_license | tripaloz/TP_IndieGame | ca1f36cd89476eba4a1a7084c9079663680d9451 | 00a8f325e395dca2808efd475f6ed7a20857c683 | refs/heads/master | 2020-06-02T18:06:10.508392 | 2019-06-11T20:31:26 | 2019-06-11T20:31:26 | 191,259,526 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,384 | h | // Copyright 1998-2019 Epic Games, Inc. All Rights Reserved.
#pragma once
#include "CoreMinimal.h"
#include "GameFramework/Character.h"
#include "TP_IndieGameCharacter.generated.h"
UCLASS(Blueprintable)
class ATP_IndieGameCharacter : public ACharacter
{
GENERATED_BODY()
public:
ATP_IndieGameCharacter();
// Called every frame.
virtual void Tick(float DeltaSeconds) override;
/** Returns TopDownCameraComponent subobject **/
FORCEINLINE class UCameraComponent* GetTopDownCameraComponent() const { return TopDownCameraComponent; }
/** Returns CameraBoom subobject **/
FORCEINLINE class USpringArmComponent* GetCameraBoom() const { return CameraBoom; }
/** Returns CursorToWorld subobject **/
FORCEINLINE class UDecalComponent* GetCursorToWorld() { return CursorToWorld; }
private:
/** Top down camera */
UPROPERTY(VisibleAnywhere, BlueprintReadOnly, Category = Camera, meta = (AllowPrivateAccess = "true"))
class UCameraComponent* TopDownCameraComponent;
/** Camera boom positioning the camera above the character */
UPROPERTY(VisibleAnywhere, BlueprintReadOnly, Category = Camera, meta = (AllowPrivateAccess = "true"))
class USpringArmComponent* CameraBoom;
/** A decal that projects to the cursor location. */
UPROPERTY(VisibleAnywhere, BlueprintReadOnly, Category = Camera, meta = (AllowPrivateAccess = "true"))
class UDecalComponent* CursorToWorld;
};
| [
"jsousa1990.o@hotmail.com"
] | jsousa1990.o@hotmail.com |
baf7fe591ad0fea402087c0b497099d9b4f207de | 8d953b8783bc94e835b092c72370ff7f4ead90dc | /Source/Gunslinger/Public/Abilities/GunslingerTargetType.h | e51b0d650104bdad6ddf07f57f7d8c5471e038bb | [] | no_license | mvoitkevics/Gunslinger | c9c906f56f4be15e94d05aac87b75baea4a899a2 | e7ed0a8458416df0fdf87cd6a3af5b0b6decebe6 | refs/heads/master | 2023-06-01T03:18:42.895253 | 2021-06-28T10:43:52 | 2021-06-28T10:43:52 | 237,199,313 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,263 | h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "Gunslinger.h"
#include "Abilities/GameplayAbilityTypes.h"
#include "GunslingerAbilityTypes.h"
#include "UObject/NoExportTypes.h"
#include "GunslingerTargetType.generated.h"
class ACharacterBase;
class AActor;
struct FGameplayEventData;
/**
* Class that is used to determine targeting for abilities
* It is meant to be blueprinted to run target logic
* This does not subclass GameplayAbilityTargetActor because this class is never instanced into the world
* This can be used as a basis for a game-specific targeting blueprint
* If your targeting is more complicated you may need to instance into the world once or as a pooled actor
*/
UCLASS(Blueprintable, meta = (ShowWorldContextPin))
class GUNSLINGER_API UGunslingerTargetType : public UObject
{
GENERATED_BODY()
public:
// Constructor and overrides
UGunslingerTargetType() {}
/** Called to determine targets to apply gameplay effects to */
UFUNCTION(BlueprintNativeEvent)
void GetTargets(ACharacterBase* TargetingCharacter, AActor* TargetingActor, FGameplayEventData EventData, TArray<FHitResult>& OutHitResults, TArray<AActor*>& OutActors) const;
};
/** Trivial target type that uses the owner */
UCLASS(NotBlueprintable)
class GUNSLINGER_API UGunslingerTargetType_UseOwner : public UGunslingerTargetType
{
GENERATED_BODY()
public:
// Constructor and overrides
UGunslingerTargetType_UseOwner() {}
/** Uses the passed in event data */
virtual void GetTargets_Implementation(ACharacterBase* TargetingCharacter, AActor* TargetingActor, FGameplayEventData EventData, TArray<FHitResult>& OutHitResults, TArray<AActor*>& OutActors) const override;
};
/** Trivial target type that pulls the target out of the event data */
UCLASS(NotBlueprintable)
class GUNSLINGER_API UGunslingerTargetType_UseEventData : public UGunslingerTargetType
{
GENERATED_BODY()
public:
// Constructor and overrides
UGunslingerTargetType_UseEventData() {}
/** Uses the passed in event data */
virtual void GetTargets_Implementation(ACharacterBase* TargetingCharacter, AActor* TargetingActor, FGameplayEventData EventData, TArray<FHitResult>& OutHitResults, TArray<AActor*>& OutActors) const override;
};
| [
"maksims.voitkevichs@hotmail.com"
] | maksims.voitkevichs@hotmail.com |
212fb75343a9c2e09dd32b2d8dd26c680b9dbbbf | a956e3514fa6f6a72ff9b69a1de500abaf72f511 | /cpp/Tree/111.minimum-depth-of-binary-tree.cpp | 4a1a1e509356c1c3a9533a3b0d35ba6ad69c226f | [] | no_license | linjielangdang/leetcode | f629f0ce4692e5642d1d283e5d36935217ff56cb | a271460707aac12fd075c4e377b1f1e39999be47 | refs/heads/master | 2021-01-10T08:09:05.797233 | 2017-01-11T18:39:27 | 2017-01-11T18:39:27 | 49,800,632 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 663 | cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode* root)
{
if(NULL == root)
{
return 0;
}
if(NULL != root->left && NULL != root->right)
{
return 1 + min(minDepth(root->left), minDepth(root->right));
}
else if(NULL == root->left)
{
return 1 + minDepth(root->right);
}
else
{
return 1 + minDepth(root->left);
}
}
};
| [
"linjiexin@haizhi.com"
] | linjiexin@haizhi.com |
1508fa99a2ca9db610f2ee9cf18f97ebafa8a249 | 4851746b4c0dd2a8f7dd56b73e7d40c6775c2d99 | /src/player.h | 840ad8a0106ef1bc734c458e4a1e5849c01e713e | [] | no_license | LeandroPerrotta/DarghosTFS04_86_v2 | 41a4e9afd1445b5be34d29e4769a75395d323e67 | 91543b631118e3d13688500c2e72580dd9c18246 | refs/heads/master | 2023-06-17T22:38:06.685632 | 2021-07-16T12:33:48 | 2021-07-16T12:33:48 | 386,489,586 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 38,396 | h | ////////////////////////////////////////////////////////////////////////
// OpenTibia - an opensource roleplaying game
////////////////////////////////////////////////////////////////////////
// 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 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
////////////////////////////////////////////////////////////////////////
#ifndef __PLAYER__
#define __PLAYER__
#include "otsystem.h"
#include "enums.h"
#include "creature.h"
#include "cylinder.h"
#include "container.h"
#include "depot.h"
#include "outfit.h"
#include "vocation.h"
#include "group.h"
#include "protocolgame.h"
#include "ioguild.h"
#include "party.h"
#include "npc.h"
#ifdef __DARGHOS_PVP_SYSTEM__
#include "darghos_pvp.h"
#include "darghos_const.h"
#endif
class House;
class NetworkMessage;
class Weapon;
class ProtocolGame;
class Npc;
class Party;
class SchedulerTask;
class Quest;
enum skillsid_t
{
SKILL_LEVEL = 0,
SKILL_TRIES = 1,
SKILL_PERCENT = 2
};
enum playerinfo_t
{
PLAYERINFO_LEVEL,
PLAYERINFO_LEVELPERCENT,
PLAYERINFO_HEALTH,
PLAYERINFO_MAXHEALTH,
PLAYERINFO_MANA,
PLAYERINFO_MAXMANA,
PLAYERINFO_MAGICLEVEL,
PLAYERINFO_MAGICLEVELPERCENT,
PLAYERINFO_SOUL,
};
enum freeslot_t
{
SLOT_TYPE_NONE,
SLOT_TYPE_INVENTORY,
SLOT_TYPE_CONTAINER
};
enum chaseMode_t
{
CHASEMODE_STANDSTILL,
CHASEMODE_FOLLOW,
};
enum fightMode_t
{
FIGHTMODE_ATTACK,
FIGHTMODE_BALANCED,
FIGHTMODE_DEFENSE
};
enum secureMode_t
{
SECUREMODE_ON,
SECUREMODE_OFF
};
enum tradestate_t
{
TRADE_NONE,
TRADE_INITIATED,
TRADE_ACCEPT,
TRADE_ACKNOWLEDGE,
TRADE_TRANSFER
};
enum AccountManager_t
{
MANAGER_NONE,
MANAGER_NEW,
MANAGER_ACCOUNT,
MANAGER_NAMELOCK
};
enum GamemasterCondition_t
{
GAMEMASTER_INVISIBLE = 0,
GAMEMASTER_IGNORE = 1,
GAMEMASTER_TELEPORT = 2
};
enum Exhaust_t
{
#ifdef __DARGHOS_CUSTOM__
EXHAUST_OTHERS = 0,
#endif
EXHAUST_COMBAT = 1,
EXHAUST_HEALING = 2
#ifdef __DARGHOS_CUSTOM__
,EXHAUST_COMBAT_AREA = 3
,EXHAUST_ESPECIAL = 4
#endif
};
typedef std::set<uint32_t> VIPSet;
typedef std::vector<std::pair<uint32_t, Container*> > ContainerVector;
typedef std::map<uint32_t, std::pair<Depot*, bool> > DepotMap;
typedef std::map<uint32_t, uint32_t> MuteCountMap;
typedef std::list<std::string> LearnedInstantSpellList;
typedef std::list<uint32_t> InvitedToGuildsList;
typedef std::list<Party*> PartyList;
typedef std::map<uint32_t, War_t> WarMap;
#define SPEED_MAX 1500
#define SPEED_MIN 10
#define STAMINA_MAX (42 * 60 * 60 * 1000)
#define STAMINA_MULTIPLIER (60 * 1000)
class Player : public Creature, public Cylinder
{
public:
#ifdef __ENABLE_SERVER_DIAGNOSTIC__
static uint32_t playerCount;
#endif
Player(const std::string& name, ProtocolGame* p);
virtual ~Player();
virtual Player* getPlayer() {return this;}
virtual const Player* getPlayer() const {return this;}
static MuteCountMap muteCountMap;
virtual const std::string& getName() const {return name;}
virtual const std::string& getNameDescription() const {return nameDescription;}
virtual std::string getDescription(int32_t lookDistance) const;
const std::string& getSpecialDescription() const {return specialDescription;}
void setSpecialDescription(const std::string& desc) {specialDescription = desc;}
void manageAccount(const std::string& text);
bool isAccountManager() const {return (accountManager != MANAGER_NONE);}
void kickPlayer(bool displayEffect, bool forceLogout);
void setGUID(uint32_t _guid) {guid = _guid;}
uint32_t getGUID() const {return guid;}
#ifdef __DARGHOS_IGNORE_AFK__
static uint32_t afkCount;
#endif
static AutoList<Player> autoList;
virtual uint32_t rangeId() {return 0x10000000;}
void addList();
void removeList();
static uint64_t getExpForLevel(uint32_t lv)
{
lv--;
return ((50ULL * lv * lv * lv) - (150ULL * lv * lv) + (400ULL * lv)) / 3ULL;
}
uint32_t getPromotionLevel() const {return promotionLevel;}
void setPromotionLevel(uint32_t pLevel);
bool changeOutfit(Outfit_t outfit, bool checkList);
void hasRequestedOutfit(bool v) {requestedOutfit = v;}
Vocation* getVocation() const {return vocation;}
int32_t getPlayerInfo(playerinfo_t playerinfo) const;
void setParty(Party* _party) {party = _party;}
Party* getParty() const {return party;}
bool isInviting(const Player* player) const;
bool isPartner(const Player* player) const;
bool getHideHealth() const;
bool addPartyInvitation(Party* party);
bool removePartyInvitation(Party* party);
void clearPartyInvitations();
uint32_t getGuildId() const {return guildId;}
void setGuildId(uint32_t newId) {guildId = newId;}
uint32_t getRankId() const {return rankId;}
void setRankId(uint32_t newId) {rankId = newId;}
GuildLevel_t getGuildLevel() const {return guildLevel;}
bool setGuildLevel(GuildLevel_t newLevel, uint32_t rank = 0);
const std::string& getGuildName() const {return guildName;}
void setGuildName(const std::string& newName) {guildName = newName;}
const std::string& getRankName() const {return rankName;}
void setRankName(const std::string& newName) {rankName = newName;}
const std::string& getGuildNick() const {return guildNick;}
void setGuildNick(const std::string& newNick) {guildNick = newNick;}
bool isGuildInvited(uint32_t guildId) const;
void leaveGuild();
void setFlags(uint64_t flags) {if(group) group->setFlags(flags);}
bool hasFlag(PlayerFlags value) const {return group != NULL && group->hasFlag(value);}
void setCustomFlags(uint64_t flags) {if(group) group->setCustomFlags(flags);}
bool hasCustomFlag(PlayerCustomFlags value) const {return group != NULL && group->hasCustomFlag(value);}
void addBlessing(int16_t blessing) {blessings += blessing;}
bool hasBlessing(int16_t value) const {return (blessings & ((int16_t)1 << value));}
#ifdef __DARGHOS_CUSTOM__
bool hasPvpBlessing() const;
void removePvpBlessing();
void removeBlessing(int16_t value);
void setPvpStatus(bool status) { pvpStatus = status; }
bool isPvpEnabled() const { return pvpStatus; }
#endif
uint16_t getBlessings() const;
OperatingSystem_t getOperatingSystem() const {return operatingSystem;}
void setOperatingSystem(OperatingSystem_t clientOs) {operatingSystem = clientOs;}
uint32_t getClientVersion() const {return clientVersion;}
void setClientVersion(uint32_t version) {clientVersion = version;}
bool hasClient() const {return client;}
bool isVirtual() const {return (getID() == 0);}
void disconnect() {if(client) client->disconnect();}
uint32_t getIP() const;
bool canOpenCorpse(uint32_t ownerId);
Container* getContainer(uint32_t cid);
int32_t getContainerID(const Container* container) const;
void addContainer(uint32_t cid, Container* container);
void closeContainer(uint32_t cid);
virtual bool setStorage(const uint32_t key, const std::string& value);
virtual void eraseStorage(const uint32_t key);
void generateReservedStorage();
bool transferMoneyTo(const std::string& name, uint64_t amount);
void increaseCombatValues(int32_t& min, int32_t& max, bool useCharges, bool countWeapon);
void setGroupId(int32_t newId);
int32_t getGroupId() const {return groupId;}
void setGroup(Group* newGroup);
Group* getGroup() const {return group;}
virtual bool isGhost() const {return hasCondition(CONDITION_GAMEMASTER, GAMEMASTER_INVISIBLE) || hasFlag(PlayerFlag_CannotBeSeen);}
virtual bool isWalkable() const {return hasCustomFlag(PlayerCustomFlag_IsWalkable);}
void switchSaving() {saving = !saving;}
bool isSaving() const {return saving;}
uint32_t getIdleTime() const {return idleTime;}
void setIdleTime(uint32_t amount) {idleTime = amount;}
bool checkLoginDelay(uint32_t playerId) const;
bool isTrading() const {return tradePartner;}
uint32_t getAccount() const {return accountId;}
std::string getAccountName() const {return account;}
uint16_t getAccess() const {return group ? group->getAccess() : 0;}
uint16_t getGhostAccess() const {return group ? group->getGhostAccess() : 0;}
uint32_t getLevel() const {return level;}
uint64_t getExperience() const {return experience;}
uint32_t getMagicLevel() const {return getPlayerInfo(PLAYERINFO_MAGICLEVEL);}
uint64_t getSpentMana() const {return manaSpent;}
bool isPremium() const;
int32_t getPremiumDays() const {return premiumDays;}
bool hasEnemy() const {return !warMap.empty();}
bool getEnemy(const Player* player, War_t& data) const;
bool isEnemy(const Player* player, bool allies) const;
bool isAlly(const Player* player) const;
void addEnemy(uint32_t guild, War_t war)
{warMap[guild] = war;}
void removeEnemy(uint32_t guild) {warMap.erase(guild);}
uint32_t getVocationId() const {return vocationId;}
void setVocation(uint32_t id);
uint16_t getSex(bool full) const {return full ? sex : sex % 2;}
void setSex(uint16_t);
uint64_t getStamina() const {return hasFlag(PlayerFlag_HasInfiniteStamina) ? STAMINA_MAX : stamina;}
void setStamina(uint64_t value) {stamina = std::min((uint64_t)STAMINA_MAX, (uint64_t)std::max((uint64_t)0, value));}
uint32_t getStaminaMinutes() const {return (uint32_t)(getStamina() / (uint64_t)STAMINA_MULTIPLIER);}
void setStaminaMinutes(uint32_t value) {setStamina((uint64_t)(value * STAMINA_MULTIPLIER));}
void useStamina(int64_t value) {stamina = std::min((int64_t)STAMINA_MAX, (int64_t)std::max((int64_t)0, ((int64_t)stamina + value)));}
uint64_t getSpentStamina() {return (uint64_t)STAMINA_MAX - stamina;}
int64_t getLastLoad() const {return lastLoad;}
time_t getLastLogin() const {return lastLogin;}
time_t getLastLogout() const {return lastLogout;}
Position getLoginPosition() const {return loginPosition;}
uint32_t getTown() const {return town;}
void setTown(uint32_t _town) {town = _town;}
virtual bool isPushable() const;
virtual int32_t getThrowRange() const {return 1;}
virtual double getGainedExperience(Creature* attacker) const;
bool isMuted(uint16_t channelId, SpeakClasses type, uint32_t& time);
void addMessageBuffer();
void removeMessageBuffer();
double getCapacity() const {return capacity;}
void setCapacity(double newCapacity) {capacity = newCapacity;}
double getFreeCapacity() const
{
if(hasFlag(PlayerFlag_CannotPickupItem))
return 0.00;
else if(hasFlag(PlayerFlag_HasInfiniteCapacity))
return 10000.00;
return std::max(0.00, capacity - inventoryWeight);
}
virtual int32_t getSoul() const {return getPlayerInfo(PLAYERINFO_SOUL);}
virtual int32_t getMaxHealth() const {return getPlayerInfo(PLAYERINFO_MAXHEALTH);}
virtual int32_t getMaxMana() const {return getPlayerInfo(PLAYERINFO_MAXMANA);}
int32_t getSoulMax() const {return soulMax;}
Item* getInventoryItem(slots_t slot) const;
Item* getEquippedItem(slots_t slot) const;
bool isItemAbilityEnabled(slots_t slot) const {return inventoryAbilities[slot];}
void setItemAbility(slots_t slot, bool enabled) {inventoryAbilities[slot] = enabled;}
int32_t getVarSkill(skills_t skill) const {return varSkills[skill];}
void setVarSkill(skills_t skill, int32_t modifier) {varSkills[skill] += modifier;}
int32_t getVarStats(stats_t stat) const {return varStats[stat];}
void setVarStats(stats_t stat, int32_t modifier);
int32_t getDefaultStats(stats_t stat);
void setConditionSuppressions(uint32_t conditions, bool remove);
uint32_t getLossPercent(lossTypes_t lossType) const {return lossPercent[lossType];}
void setLossPercent(lossTypes_t lossType, uint32_t newPercent) {lossPercent[lossType] = newPercent;}
Depot* getDepot(uint32_t depotId, bool autoCreateDepot);
bool addDepot(Depot* depot, uint32_t depotId);
void useDepot(uint32_t depotId, bool value);
virtual bool canSee(const Position& pos) const;
virtual bool canSeeCreature(const Creature* creature) const;
virtual bool canWalkthrough(const Creature* creature) const;
void setWalkthrough(const Creature* creature, bool walkthrough);
virtual bool canSeeInvisibility() const {return hasFlag(PlayerFlag_CanSenseInvisibility);}
virtual RaceType_t getRace() const {return RACE_BLOOD;}
//safe-trade functions
void setTradeState(tradestate_t state) {tradeState = state;}
tradestate_t getTradeState() {return tradeState;}
Item* getTradeItem() {return tradeItem;}
//shop functions
void setShopOwner(Npc* owner, int32_t onBuy, int32_t onSell, ShopInfoList offer)
{
shopOwner = owner;
purchaseCallback = onBuy;
saleCallback = onSell;
shopOffer = offer;
}
Npc* getShopOwner(int32_t& onBuy, int32_t& onSell)
{
onBuy = purchaseCallback;
onSell = saleCallback;
return shopOwner;
}
const Npc* getShopOwner(int32_t& onBuy, int32_t& onSell) const
{
onBuy = purchaseCallback;
onSell = saleCallback;
return shopOwner;
}
//V.I.P. functions
void notifyLogIn(Player* loginPlayer);
void notifyLogOut(Player* logoutPlayer);
bool removeVIP(uint32_t guid);
bool addVIP(uint32_t guid, std::string& name, bool isOnline, bool internal = false);
//follow functions
virtual bool setFollowCreature(Creature* creature, bool fullPathSearch = false);
virtual void goToFollowCreature();
//follow events
virtual void onFollowCreature(const Creature* creature);
//walk events
virtual void onWalk(Direction& dir);
virtual void onWalkAborted();
virtual void onWalkComplete();
void stopWalk() {cancelNextWalk = true;}
void openShopWindow();
void closeShopWindow(bool send = true);
bool canShopItem(uint16_t itemId, uint8_t subType, ShopEvent_t event);
chaseMode_t getChaseMode() const {return chaseMode;}
void setChaseMode(chaseMode_t mode);
fightMode_t getFightMode() const {return fightMode;}
void setFightMode(fightMode_t mode) {fightMode = mode;}
secureMode_t getSecureMode() const {return secureMode;}
void setSecureMode(secureMode_t mode) {secureMode = mode;}
//combat functions
virtual bool setAttackedCreature(Creature* creature);
bool isImmune(CombatType_t type) const;
bool isImmune(ConditionType_t type) const;
bool hasShield() const;
virtual bool isAttackable() const;
virtual void changeHealth(int32_t healthChange);
virtual void changeMana(int32_t manaChange);
void changeSoul(int32_t soulChange);
bool isPzLocked() const {return pzLocked;}
void setPzLocked(bool v) {pzLocked = v;}
virtual BlockType_t blockHit(Creature* attacker, CombatType_t combatType, int32_t& damage,
bool checkDefense = false, bool checkArmor = false, bool reflect = true, bool field = false);
virtual void doAttacking(uint32_t interval);
virtual bool hasExtraSwing() {return lastAttack > 0 && ((OTSYS_TIME() - lastAttack) >= getAttackSpeed());}
int32_t getShootRange() const {return shootRange;}
int32_t getSkill(skills_t skilltype, skillsid_t skillinfo) const;
bool getAddAttackSkill() const {return addAttackSkillPoint;}
BlockType_t getLastAttackBlockType() const {return lastAttackBlockType;}
Item* getWeapon(bool ignoreAmmo);
ItemVector getWeapons() const;
virtual WeaponType_t getWeaponType();
int32_t getWeaponSkill(const Item* item) const;
void getShieldAndWeapon(const Item* &_shield, const Item* &_weapon) const;
virtual void drainHealth(Creature* attacker, CombatType_t combatType, int32_t damage);
virtual void drainMana(Creature* attacker, CombatType_t combatType, int32_t damage);
void addExperience(uint64_t exp);
void removeExperience(uint64_t exp, bool updateStats = true);
void addManaSpent(uint64_t amount, bool useMultiplier = true);
void addSkillAdvance(skills_t skill, uint32_t count, bool useMultiplier = true);
bool addUnjustifiedKill(const Player* attacked, bool countNow);
virtual int32_t getArmor() const;
virtual int32_t getDefense() const;
virtual float getAttackFactor() const;
virtual float getDefenseFactor() const;
void addExhaust(uint32_t ticks, Exhaust_t type);
void addInFightTicks(bool pzLock, int32_t ticks = 0);
void addDefaultRegeneration(uint32_t addTicks);
//combat event functions
virtual void onAddCondition(ConditionType_t type, bool hadCondition);
virtual void onAddCombatCondition(ConditionType_t type, bool hadCondition);
virtual void onEndCondition(ConditionType_t type);
virtual void onCombatRemoveCondition(const Creature* attacker, Condition* condition);
virtual void onTickCondition(ConditionType_t type, int32_t interval, bool& _remove);
virtual void onAttackedCreature(Creature* target);
virtual void onSummonAttackedCreature(Creature* summon, Creature* target);
virtual void onAttacked();
virtual void onAttackedCreatureDrain(Creature* target, int32_t points);
virtual void onSummonAttackedCreatureDrain(Creature* summon, Creature* target, int32_t points);
virtual void onTargetCreatureGainHealth(Creature* target, int32_t points);
virtual bool onKilledCreature(Creature* target, DeathEntry& entry);
virtual void onGainExperience(double& gainExp, bool fromMonster, bool multiplied);
virtual void onGainSharedExperience(double& gainExp, bool fromMonster, bool multiplied);
virtual void onAttackedCreatureBlockHit(Creature* target, BlockType_t blockType);
virtual void onBlockHit(BlockType_t blockType);
virtual void onChangeZone(ZoneType_t zone);
virtual void onAttackedCreatureChangeZone(ZoneType_t zone);
virtual void onIdleStatus();
virtual void onPlacedCreature();
virtual void getCreatureLight(LightInfo& light) const;
Skulls_t getSkull() const;
Skulls_t getSkullType(const Creature* creature) const;
PartyShields_t getPartyShield(const Creature* creature) const;
GuildEmblems_t getGuildEmblem(const Creature* creature) const;
bool hasAttacked(const Player* attacked) const;
void addAttacked(const Player* attacked);
void clearAttacked() {attackedSet.clear();}
time_t getSkullEnd() const {return skullEnd;}
void setSkullEnd(time_t _time, bool login, Skulls_t _skull);
bool addOutfit(uint32_t outfitId, uint32_t addons);
bool removeOutfit(uint32_t outfitId, uint32_t addons);
bool canWearOutfit(uint32_t outfitId, uint32_t addons);
//tile
//send methods
void sendAddTileItem(const Tile* tile, const Position& pos, const Item* item)
{if(client) client->sendAddTileItem(tile, pos, tile->getClientIndexOfThing(this, item), item);}
void sendUpdateTileItem(const Tile* tile, const Position& pos, const Item* oldItem, const Item* newItem)
{if(client) client->sendUpdateTileItem(tile, pos, tile->getClientIndexOfThing(this, oldItem), newItem);}
void sendRemoveTileItem(const Tile* tile, const Position& pos, uint32_t stackpos, const Item*)
{if(client) client->sendRemoveTileItem(tile, pos, stackpos);}
void sendUpdateTile(const Tile* tile, const Position& pos)
{if(client) client->sendUpdateTile(tile, pos);}
void sendChannelMessage(std::string author, std::string text, SpeakClasses type, uint8_t channel)
{if(client) client->sendChannelMessage(author, text, type, channel);}
void sendCreatureAppear(const Creature* creature)
{if(client) client->sendAddCreature(creature, creature->getPosition(), creature->getTile()->getClientIndexOfThing(
this, creature));}
void sendCreatureDisappear(const Creature* creature, uint32_t stackpos)
{if(client) client->sendRemoveCreature(creature, creature->getPosition(), stackpos);}
void sendCreatureMove(const Creature* creature, const Tile* newTile, const Position& newPos,
const Tile* oldTile, const Position& oldPos, uint32_t oldStackpos, bool teleport)
{if(client) client->sendMoveCreature(creature, newTile, newPos, newTile->getClientIndexOfThing(
this, creature), oldTile, oldPos, oldStackpos, teleport);}
void sendCreatureTurn(const Creature* creature)
{if(client) client->sendCreatureTurn(creature, creature->getTile()->getClientIndexOfThing(this, creature));}
void sendCreatureSay(const Creature* creature, SpeakClasses type, const std::string& text, Position* pos = NULL)
{if(client) client->sendCreatureSay(creature, type, text, pos);}
void sendCreatureSquare(const Creature* creature, uint8_t color)
{if(client) client->sendCreatureSquare(creature, color);}
void sendCreatureChangeOutfit(const Creature* creature, const Outfit_t& outfit)
{if(client) client->sendCreatureOutfit(creature, outfit);}
void sendCreatureChangeVisible(const Creature* creature, Visible_t visible);
void sendCreatureLight(const Creature* creature)
{if(client) client->sendCreatureLight(creature);}
void sendCreatureShield(const Creature* creature)
{if(client) client->sendCreatureShield(creature);}
void sendCreatureEmblem(const Creature* creature)
{if(client) client->sendCreatureEmblem(creature);}
void sendCreatureWalkthrough(const Creature* creature, bool walkthrough)
{if(client) client->sendCreatureWalkthrough(creature, walkthrough);}
//container
void sendAddContainerItem(const Container* container, const Item* item);
void sendUpdateContainerItem(const Container* container, uint8_t slot, const Item* oldItem, const Item* newItem);
void sendRemoveContainerItem(const Container* container, uint8_t slot, const Item* item);
void sendContainer(uint32_t cid, const Container* container, bool hasParent)
{if(client) client->sendContainer(cid, container, hasParent);}
//inventory
void sendAddInventoryItem(slots_t slot, const Item* item)
{if(client) client->sendAddInventoryItem(slot, item);}
void sendUpdateInventoryItem(slots_t slot, const Item*, const Item* newItem)
{if(client) client->sendUpdateInventoryItem(slot, newItem);}
void sendRemoveInventoryItem(slots_t slot, const Item*)
{if(client) client->sendRemoveInventoryItem(slot);}
//event methods
virtual void onUpdateTileItem(const Tile* tile, const Position& pos, const Item* oldItem,
const ItemType& oldType, const Item* newItem, const ItemType& newType);
virtual void onRemoveTileItem(const Tile* tile, const Position& pos,
const ItemType& iType, const Item* item);
virtual void onCreatureAppear(const Creature* creature);
virtual void onCreatureDisappear(const Creature* creature, bool isLogout);
virtual void onCreatureMove(const Creature* creature, const Tile* newTile, const Position& newPos,
const Tile* oldTile, const Position& oldPos, bool teleport);
virtual void onAttackedCreatureDisappear(bool isLogout);
virtual void onFollowCreatureDisappear(bool isLogout);
//cylinder implementations
virtual Cylinder* getParent() {return Creature::getParent();}
virtual const Cylinder* getParent() const {return Creature::getParent();}
virtual bool isRemoved() const {return Creature::isRemoved();}
virtual Position getPosition() const {return Creature::getPosition();}
virtual Tile* getTile() {return Creature::getTile();}
virtual const Tile* getTile() const {return Creature::getTile();}
virtual Item* getItem() {return NULL;}
virtual const Item* getItem() const {return NULL;}
virtual Creature* getCreature() {return this;}
virtual const Creature* getCreature() const {return this;}
//container
void onAddContainerItem(const Container* container, const Item* item);
void onUpdateContainerItem(const Container* container, uint8_t slot,
const Item* oldItem, const ItemType& oldType, const Item* newItem, const ItemType& newType);
void onRemoveContainerItem(const Container* container, uint8_t slot, const Item* item);
void onCloseContainer(const Container* container);
void onSendContainer(const Container* container);
void autoCloseContainers(const Container* container);
//inventory
void onAddInventoryItem(slots_t, Item*) {}
void onUpdateInventoryItem(slots_t slot, Item* oldItem, const ItemType& oldType,
Item* newItem, const ItemType& newType);
void onRemoveInventoryItem(slots_t slot, Item* item);
void sendAnimatedText(const Position& pos, uint8_t color, std::string text) const
{if(client) client->sendAnimatedText(pos,color,text);}
void sendCancel(const std::string& msg) const
{if(client) client->sendCancel(msg);}
void sendCancelMessage(ReturnValue message) const;
void sendCancelTarget() const
{if(client) client->sendCancelTarget();}
void sendCancelWalk() const
{if(client) client->sendCancelWalk();}
void sendChangeSpeed(const Creature* creature, uint32_t newSpeed) const
{if(client) client->sendChangeSpeed(creature, newSpeed);}
void sendCreatureHealth(const Creature* creature) const
{if(client) client->sendCreatureHealth(creature);}
void sendDistanceShoot(const Position& from, const Position& to, uint8_t type) const
{if(client) client->sendDistanceShoot(from, to, type);}
void sendHouseWindow(House* house, uint32_t listId) const;
void sendOutfitWindow() const {if(client) client->sendOutfitWindow();}
void sendQuests() const {if(client) client->sendQuests();}
void sendQuestInfo(Quest* quest) const {if(client) client->sendQuestInfo(quest);}
void sendCreatureSkull(const Creature* creature) const
{if(client) client->sendCreatureSkull(creature);}
void sendFYIBox(std::string message)
{if(client) client->sendFYIBox(message);}
void sendCreatePrivateChannel(uint16_t channelId, const std::string& channelName)
{if(client) client->sendCreatePrivateChannel(channelId, channelName);}
void sendClosePrivate(uint16_t channelId) const
{if(client) client->sendClosePrivate(channelId);}
void sendIcons() const;
void sendMagicEffect(const Position& pos, uint8_t type) const
{if(client) client->sendMagicEffect(pos, type);}
void sendStats() const
{if(client) client->sendStats();}
void sendSkills() const
{if(client) client->sendSkills();}
void sendTextMessage(MessageClasses type, const std::string& message) const
{if(client) client->sendTextMessage(type, message);}
void sendReLoginWindow() const
{if(client) client->sendReLoginWindow();}
void sendTextWindow(Item* item, uint16_t maxLen, bool canWrite) const
{if(client) client->sendTextWindow(windowTextId, item, maxLen, canWrite);}
void sendTextWindow(uint32_t itemId, const std::string& text) const
{if(client) client->sendTextWindow(windowTextId, itemId, text);}
void sendToChannel(Creature* creature, SpeakClasses type, const std::string& text, uint16_t channelId, uint32_t time = 0) const
{if(client) client->sendToChannel(creature, type, text, channelId, time);}
void sendShop() const
{if(client) client->sendShop(shopOffer);}
void sendGoods() const
{if(client) client->sendGoods(shopOffer);}
void sendCloseShop() const
{if(client) client->sendCloseShop();}
void sendTradeItemRequest(const Player* player, const Item* item, bool ack) const
{if(client) client->sendTradeItemRequest(player, item, ack);}
void sendTradeClose() const
{if(client) client->sendCloseTrade();}
void sendWorldLight(LightInfo& lightInfo)
{if(client) client->sendWorldLight(lightInfo);}
void sendChannelsDialog()
{if(client) client->sendChannelsDialog();}
void sendOpenPrivateChannel(const std::string& receiver)
{if(client) client->sendOpenPrivateChannel(receiver);}
void sendOutfitWindow()
{if(client) client->sendOutfitWindow();}
void sendCloseContainer(uint32_t cid)
{if(client) client->sendCloseContainer(cid);}
void sendChannel(uint16_t channelId, const std::string& channelName)
{if(client) client->sendChannel(channelId, channelName);}
void sendRuleViolationsChannel(uint16_t channelId)
{if(client) client->sendRuleViolationsChannel(channelId);}
void sendRemoveReport(const std::string& name)
{if(client) client->sendRemoveReport(name);}
void sendLockRuleViolation()
{if(client) client->sendLockRuleViolation();}
void sendRuleViolationCancel(const std::string& name)
{if(client) client->sendRuleViolationCancel(name);}
void sendTutorial(uint8_t tutorialId)
{if(client) client->sendTutorial(tutorialId);}
void sendAddMarker(const Position& pos, MapMarks_t markType, const std::string& desc)
{if (client) client->sendAddMarker(pos, markType, desc);}
void sendCritical() const;
void sendPlayerIcons(Player* player);
#ifdef __DARGHOS_CUSTOM__
void receivePing();
uint32_t getCurrentPing() const;
#else
void receivePing() {lastPong = OTSYS_TIME();}
#endif
virtual void onThink(uint32_t interval);
uint32_t getAttackSpeed() const;
void setLastMail(uint64_t v) {lastMail = v;}
uint16_t getMailAttempts() const {return mailAttempts;}
void addMailAttempt() {++mailAttempts;}
virtual void postAddNotification(Creature* actor, Thing* thing, const Cylinder* oldParent,
int32_t index, cylinderlink_t link = LINK_OWNER);
virtual void postRemoveNotification(Creature* actor, Thing* thing, const Cylinder* newParent,
int32_t index, bool isCompleteRemoval, cylinderlink_t link = LINK_OWNER);
void setNextAction(int64_t time) {if(time > nextAction) {nextAction = time;}}
bool canDoAction() const {return nextAction <= OTSYS_TIME();}
uint32_t getNextActionTime() const;
Item* getWriteItem(uint32_t& _windowTextId, uint16_t& _maxWriteLen);
void setWriteItem(Item* item, uint16_t _maxWriteLen = 0);
House* getEditHouse(uint32_t& _windowTextId, uint32_t& _listId);
void setEditHouse(House* house, uint32_t listId = 0);
void learnInstantSpell(const std::string& name);
void unlearnInstantSpell(const std::string& name);
bool hasLearnedInstantSpell(const std::string& name) const;
VIPSet VIPList;
ContainerVector containerVec;
InvitedToGuildsList invitedToGuildsList;
ConditionList storedConditionList;
DepotMap depots;
uint32_t marriage;
uint64_t balance;
double rates[SKILL__LAST + 1];
Container transferContainer;
#ifdef __DARGHOS_IGNORE_AFK__
void addAfkState();
void removeAfkState();
bool getAfkState();
#endif
#ifdef __DARGHOS_CUSTOM__
void setDoubleDamage();
void removeDoubleDamage();
bool isDoubleDamage();
time_t getLastKnowUpdate() const { return lastKnowUpdate; }
void setPause(bool isPause) { pause = isPause; onTargetLost(); }
bool isPause() { return pause; }
typedef std::list<uint16_t> LatencyList_t;
LatencyList_t latencyList;
void onTargetLost(bool cancelTarget = true){
#ifdef __DARGHOS_CUSTOM_SPELLS__
if(isInBattleground()) removeCondition(CONDITION_CASTING_SPELL);
#endif
if(cancelTarget) setAttackedCreature(NULL);
sendCancelTarget();
}
double getCriticalFactor() const;
uint32_t getCriticalChance() const;
#endif
#ifdef __DARGHOS_PVP_SYSTEM__
bool isInBattleground() const { return onBattleground; }
void setIsInBattleground(bool in) { onBattleground = in; }
Bg_Teams_t getBattlegroundTeam() const { return team_id; }
void sendPvpChannelMessage(const std::string& text, SpeakClasses speakClass = SPEAK_CHANNEL_W) const;
bool isBattlegroundDeserter();
void setBattlegroundRating(uint32_t rating){ battlegroundRating = rating; }
uint32_t getBattlegroundRating() { return battlegroundRating; }
int64_t getLastBattlegroundDeath() { return lastBattlegroundDeath; }
void setBattlegroundTeam(Bg_Teams_t tid) {
team_id = tid; onBattleground = (tid == BATTLEGROUND_TEAM_NONE) ? false : true;
lastKnowUpdate = time(NULL);
}
void updateBattlegroundSpeed(bool useBase = false) {
if(!useBase)
baseSpeed = vocation->getBaseSpeed() + (2 * (120 - 1));
else
updateBaseSpeed();
}
#endif
#ifdef __DARGHOS_CUSTOM_SPELLS__
void onPerformAction() {
if(isInBattleground()) removeCondition(CONDITION_CASTING_SPELL);
}
#endif
protected:
void checkTradeState(const Item* item);
bool gainExperience(double& gainExp, bool fromMonster);
bool rateExperience(double& gainExp, bool fromMonster);
void updateBaseSpeed()
{
if(!hasFlag(PlayerFlag_SetMaxSpeed))
baseSpeed = vocation->getBaseSpeed() + (2 * (level - 1));
else
baseSpeed = SPEED_MAX;
}
void updateInventoryWeight();
void updateInventoryGoods(uint32_t itemId);
#ifdef __DARGHOS_CUSTOM__
uint32_t findShopItemIdByClientId(uint16_t sprite_id);
#endif
void updateItemsLight(bool internal = false);
void updateWeapon();
void setNextWalkActionTask(SchedulerTask* task);
void setNextWalkTask(SchedulerTask* task);
void setNextActionTask(SchedulerTask* task);
virtual bool onDeath();
virtual Item* createCorpse(DeathList deathList);
virtual void dropCorpse(DeathList deathList);
virtual void dropLoot(Container* corpse);
//cylinder implementations
virtual ReturnValue __queryAdd(int32_t index, const Thing* thing, uint32_t count,
uint32_t flags, Creature* actor = NULL) const;
virtual ReturnValue __queryMaxCount(int32_t index, const Thing* thing, uint32_t count, uint32_t& maxQueryCount,
uint32_t flags) const;
virtual ReturnValue __queryRemove(const Thing* thing, uint32_t count, uint32_t flags, Creature* actor = NULL) const;
virtual Cylinder* __queryDestination(int32_t& index, const Thing* thing, Item** destItem,
uint32_t& flags);
virtual void __addThing(Creature* actor, Thing* thing);
virtual void __addThing(Creature* actor, int32_t index, Thing* thing);
virtual void __updateThing(Thing* thing, uint16_t itemId, uint32_t count);
virtual void __replaceThing(uint32_t index, Thing* thing);
virtual void __removeThing(Thing* thing, uint32_t count);
virtual Thing* __getThing(uint32_t index) const;
virtual int32_t __getIndexOfThing(const Thing* thing) const;
virtual int32_t __getFirstIndex() const;
virtual int32_t __getLastIndex() const;
virtual uint32_t __getItemTypeCount(uint16_t itemId, int32_t subType = -1) const;
virtual std::map<uint32_t, uint32_t>& __getAllItemTypeCount(std::map<uint32_t, uint32_t>& countMap) const;
virtual void __internalAddThing(Thing* thing);
virtual void __internalAddThing(uint32_t index, Thing* thing);
uint32_t getVocAttackSpeed() const {return vocation->getAttackSpeed();}
virtual int32_t getStepSpeed() const
{
if(getSpeed() > SPEED_MAX)
return SPEED_MAX;
if(getSpeed() < SPEED_MIN)
return SPEED_MIN;
return getSpeed();
}
virtual uint32_t getDamageImmunities() const {return damageImmunities;}
virtual uint32_t getConditionImmunities() const {return conditionImmunities;}
virtual uint32_t getConditionSuppressions() const {return conditionSuppressions;}
virtual uint16_t getLookCorpse() const;
virtual uint64_t getLostExperience() const;
virtual void getPathSearchParams(const Creature* creature, FindPathParams& fpp) const;
static uint32_t getPercentLevel(uint64_t count, uint64_t nextLevelCount);
bool isPromoted(uint32_t pLevel = 1) const {return promotionLevel >= pLevel;}
bool hasCapacity(const Item* item, uint32_t count) const;
private:
bool talkState[13];
bool inventoryAbilities[11];
bool pzLocked;
bool saving;
bool isConnecting;
bool requestedOutfit;
bool outfitAttributes;
bool addAttackSkillPoint;
#ifdef __DARGHOS_IGNORE_AFK__
bool isAfk;
#endif
#ifdef __DARGHOS_CUSTOM__
bool doubleDamage;
time_t lastKnowUpdate;
bool pause;
bool pvpStatus;
#endif
#ifdef __DARGHOS_PVP_SYSTEM__
bool onBattleground;
Bg_Teams_t team_id;
uint32_t battlegroundRating;
int64_t lastBattlegroundDeath;
uint16_t m_criticalChance;
double m_criticalFactor;
#endif
OperatingSystem_t operatingSystem;
AccountManager_t accountManager;
PlayerSex_t managerSex;
BlockType_t lastAttackBlockType;
chaseMode_t chaseMode;
fightMode_t fightMode;
secureMode_t secureMode;
tradestate_t tradeState;
GuildLevel_t guildLevel;
int16_t blessings;
uint16_t maxWriteLen;
uint16_t sex;
uint16_t mailAttempts;
int32_t premiumDays;
int32_t soul;
int32_t soulMax;
int32_t vocationId;
int32_t groupId;
int32_t managerNumber, managerNumber2;
int32_t purchaseCallback;
int32_t saleCallback;
int32_t varSkills[SKILL_LAST + 1];
int32_t varStats[STAT_LAST + 1];
int32_t messageBuffer;
int32_t bloodHitCount;
int32_t shieldBlockCount;
int32_t shootRange;
uint32_t clientVersion;
uint32_t messageTicks;
uint32_t idleTime;
uint32_t accountId;
uint32_t lastIP;
uint32_t level;
uint32_t levelPercent;
uint32_t magLevel;
uint32_t magLevelPercent;
uint32_t damageImmunities;
uint32_t conditionImmunities;
uint32_t conditionSuppressions;
uint32_t condition; //?
uint32_t nextStepEvent;
uint32_t actionTaskEvent;
uint32_t walkTaskEvent;
uint32_t lossPercent[LOSS_LAST + 1];
uint32_t skills[SKILL_LAST + 1][3];
uint32_t guid;
uint32_t editListId;
uint32_t windowTextId;
uint32_t guildId;
uint32_t rankId;
uint32_t promotionLevel;
uint32_t town;
time_t skullEnd;
time_t lastLogin;
time_t lastLogout;
int64_t lastLoad;
int64_t lastPong;
int64_t lastPing;
int64_t nextAction;
uint64_t stamina;
uint64_t experience;
uint64_t manaSpent;
uint64_t lastAttack;
uint64_t lastMail;
double inventoryWeight;
double capacity;
char managerChar[100];
std::string managerString, managerString2;
std::string account, password;
std::string name, nameDescription, specialDescription;
std::string guildName, rankName, guildNick;
Position loginPosition;
LightInfo itemsLight;
Vocation* vocation;
ProtocolGame* client;
SchedulerTask* walkTask;
Party* party;
Group* group;
Item* inventory[11];
Player* tradePartner;
Item* tradeItem;
Item* writeItem;
House* editHouse;
Npc* shopOwner;
Item* weapon;
std::vector<uint32_t> forceWalkthrough;
typedef std::set<uint32_t> AttackedSet;
AttackedSet attackedSet;
ShopInfoList shopOffer;
PartyList invitePartyList;
OutfitMap outfits;
LearnedInstantSpellList learnedInstantSpellList;
WarMap warMap;
#ifdef __DARGHOS_PVP_SYSTEM__
friend class Battleground;
#endif
friend class Game;
friend class LuaInterface;
friend class Npc;
friend class Map;
friend class Actions;
friend class IOLoginData;
friend class ProtocolGame;
};
#endif
| [
"leandro_perrotta@hotmail.com"
] | leandro_perrotta@hotmail.com |
95fcf825cefb7ca4e654a20f0187a3b1a29cd392 | 09d4eaa620b7cff09ea94ef8a9e5da8271f59166 | /A1/q2.cpp | 3f3fe01c1b94f97dc7af69dd2b2aca143ccb6fbd | [] | no_license | codekaust/Network-Lab-2019 | c9003a2ba83b68ffda9d885eacdcf299e61a5aca | bba22cd87590c17ff9ec494249acc9006b34e049 | refs/heads/master | 2020-06-23T18:38:18.445117 | 2019-10-16T21:26:15 | 2019-10-16T21:26:15 | 198,718,135 | 0 | 0 | null | 2019-10-01T14:50:49 | 2019-07-24T22:33:04 | HTML | UTF-8 | C++ | false | false | 663 | cpp | #include <sys/ioctl.h>
#include <linux/if.h>
#include <netdb.h>
#include <iostream>
#include <string.h>
#include <bits/stdc++.h>
using namespace std;
int main()
{
struct ifreq ifr;
int fd = socket(PF_INET, SOCK_DGRAM, IPPROTO_IP);
string result;
char buffer[3];
strcpy(ifr.ifr_name, "enp3s0");
if (ioctl(fd, SIOCGIFHWADDR, &ifr) == 0) {
for (int i = 0; i <= 5; i++){
snprintf(buffer, sizeof(buffer), "%.2x", (unsigned char)ifr.ifr_addr.sa_data[i]);
result = (result + buffer + ":");
}
cout << "MAC address of this computer is: " << result << endl;
return 0;
}
return 1;
} | [
"kaustubh1303@gmail.com"
] | kaustubh1303@gmail.com |
650495e2f03940dce93cd9d2a426622fb625581d | 53deb48e966ea536b3b5d964b1940dfbda0484cb | /include/gen_prog/factory/manager.hpp | b0b7c0e8992948d03aba5bbc7cd479b32f2a3758 | [
"BSL-1.0"
] | permissive | ledocc/gen_prog | f9fcfbbae1222fbb9a75a89975c5102032b56c86 | 447a5525bdc4a39cc3fdf5328b847426a0257aaf | refs/heads/master | 2021-12-07T04:18:44.721667 | 2021-12-03T09:55:14 | 2021-12-03T09:55:14 | 13,192,585 | 0 | 1 | null | 2016-11-15T16:23:50 | 2013-09-29T13:12:38 | C++ | UTF-8 | C++ | false | false | 1,601 | hpp | #ifndef GEN_PROG__FACTORY__MANAGER_HPP_
#define GEN_PROG__FACTORY__MANAGER_HPP_
#include <unordered_map>
#include <boost/functional/factory.hpp>
#include <boost/function.hpp>
namespace gen_prog {
namespace factory {
template <typename T>
using factory_generator = boost::function<T*()>;
template <typename IdentifierT, typename ValueT, typename PrototypeT = boost::function<ValueT*()> >
class manager
{
public:
using id_type = IdentifierT;
using value_type = ValueT;
using factory_prototype = PrototypeT;
using factory_map = std::unordered_map<id_type, factory_prototype>;
using result_type = typename factory_prototype::result_type;
public:
bool add(const id_type & id, const factory_prototype & factory)
{
return _map.insert(std::make_pair(id, factory)).second;
}
void remove(const id_type & id)
{
auto it = _map.find(id);
if (it != _map.end()) _map.erase(it);
}
bool has(const id_type & id) const
{
return (_map.find(id) != _map.end());
}
template <typename... Args>
result_type create(const id_type & id, Args&&... args) const
{ return get(id)(std::forward<Args>(args)...); }
private:
factory_prototype get(const id_type & id) const
{
auto it = _map.find(id);
if (it != _map.end()) return it->second;
else return factory_prototype();
}
private:
factory_map _map;
};
} // namespace factory
} // namespace gen_prog
namespace gp = gen_prog;
#endif // ** GEN_PROG__FACTORY__MANAGER_HPP_ ** //
// End of file
| [
"callu.david@gmail.com"
] | callu.david@gmail.com |
2f3f9411667d19201d4bec96aa80af6bdbbbecf2 | 350a99c4955c1d7bd56345b0f38ea26c10ff03ad | /Data_structure_labs/Week_2/Task_3.cpp | 8cbcaad0a8157c93b05ba22b3dfdcb2ecc5fc0de | [] | no_license | shadid-reza/Lab_work_3rd_semester | b981ac249de21d5f37596cc4e61c5da76deb44c4 | 46a2c784b7cf5814ce72c858bb9f80c86f8b1777 | refs/heads/main | 2023-09-06T07:56:36.592862 | 2021-10-28T22:44:56 | 2021-10-28T22:44:56 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,419 | cpp | #include <bits/stdc++.h>
#include <stack>
using namespace std;
//main function
int main()
{
int n;
cin >> n;
while (n--)
{
stack<int> result;
string postfix;
cin >> postfix;
// iterating through the string
for (int i = 0; i < postfix.size(); i++)
{
// when the character is a digit we push it to stack
// and when it's a operator we do the required operation
if (isdigit(postfix[i]))
{
// making the char int
result.push(postfix[i] - '0');
}
else
{
// for example in expression :[ ab- ]it will be [ a-b ] we took b first
int a, b;
b = result.top();
result.pop();
a = result.top();
result.pop();
// using the respective operation
if (postfix[i] == '+')
result.push(a + b);
else if (postfix[i] == '-')
result.push(a - b);
else if (postfix[i] == '*')
result.push(a * b);
else if (postfix[i] == '/')
result.push(a / b);
}
}
cout << result.top() << endl;
result.pop();
}
return 0;
} | [
"hmshadidreza@gmail.com"
] | hmshadidreza@gmail.com |
318b2e70b0b7528b685c80572b64d7653c880a47 | 08b17eb651963352921ccb596b7c61be4a40cdb2 | /Video-Tools/Bitstream.h | af36af4c32f4e641d2fb5c4f11ab9e878f9a6bdc | [] | no_license | BrunoReX/avimuxgui | c798baf50d0bcb4572a97267eb8b5a58c9705ab5 | bfe14ecd7bf6fc34c5cab4c241ed788dd6b04b38 | refs/heads/master | 2021-01-19T15:01:28.551533 | 2014-03-17T21:27:03 | 2014-03-17T21:27:03 | 17,843,935 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,578 | h | #ifndef I_BITSTREAM
#define I_BITSTREAM
#include "basestreams.h"
#include <deque>
#include "types.h"
#include "IBitStream.h"
class BITSTREAM : public virtual IBitStream
{
protected:
DWORD dwCurrBitPos;
void virtual LoadWord(void);
WORD wData;
int ReadBit(int iFlag = 0);
public:
BITSTREAM(void) { source=NULL; dwCurrBitPos=0; }
virtual ~BITSTREAM() {};
int virtual GetBitPos() { return dwCurrBitPos; }
void virtual SetBitPos(int pos) { dwCurrBitPos = pos; }
int virtual Open(STREAM* lpStream);
int virtual Close(void) { source=NULL; return STREAM_OK; }
bool virtual IsEndOfStream(void) { return (source->IsEndOfStream()&&(dwCurrBitPos==15)); }
int virtual Seek(__int64 qwPos);
void virtual FlushInputBuffer() {};
// Flag == 0 -> begin reading at bit 7
// Flag == 1 -> begin reading at bit 0
int virtual ReadBits(int n, int iFlag = 0);
__int64 virtual ReadBits64(int n, int iFlag = 0);
__int64 GetPos();
};
class CBitStream2 : public virtual BITSTREAM
{
private:
std::deque<uint8> m_InputBuffer;
int m_PrebufferSize;
/** \brief Reads data into the input buffer
*
* This function reads as many bytes as indicated \a m_PrebufferSize into \a m_InputBuffer.
* \returns 'true' if at least one byte was read, 'false' if no data could be read
*/
bool virtual FillInputBuffer();
public:
CBitStream2();
virtual ~CBitStream2();
int virtual Seek(__int64 qwPos);
__int64 virtual ReadBits64(int n, int iFlag = 0);
void virtual FlushInputBuffer() {
m_InputBuffer.clear();
dwCurrBitPos = 16;
}
};
#endif | [
"brunorex@gmail.com"
] | brunorex@gmail.com |
e6943f48714e3b02fb7a5c79706afdc28b792165 | 58b9c017c7c293c618342ca4be269284b2ec8405 | /src/CSVReader.h | 21e3d9475464c9abf5b0ade5f7ec1cf1129d6128 | [] | no_license | josh-byster/uiuc-professor-rating | aa53df1b1326b4c6443ecdbb64ba5195009057d1 | fea2ab64dff65581c696f8e41337ed56c196828d | refs/heads/master | 2020-03-15T08:42:10.589564 | 2018-05-03T02:58:34 | 2018-05-03T02:58:34 | 132,057,473 | 1 | 0 | null | 2020-02-12T09:32:59 | 2018-05-03T22:51:01 | C++ | UTF-8 | C++ | false | false | 428 | h | //Note: this functionality is based loosely on the following
//tutorial: http://thispointer.com/how-to-read-data-from-a-csv-file-in-c/
#ifndef CSVREADER_H
#define CSVREADER_H
#include <string>
#include <iostream>
#include <vector>
#include "Course.h"
class CSVReader {
public:
CSVReader(std::string filename) : filename(filename) {};
std::vector<Course> getCourseData();
private:
std::string filename;
};
#endif | [
"joshb1050@gmail.com"
] | joshb1050@gmail.com |
58ca5597879fdb08d8070a59d8a8403094ec4b3d | 9e56fee7b5c530c17d62ded40973b65a7b4e8038 | /courier/src/courier/Programs.h | 8f25f148a0273c76f3a7fb242e2378f183819f68 | [
"BSD-3-Clause"
] | permissive | yokwe/mesa-emulator | a567c969001b0e3f57f37afa85e5ca4a48440426 | 34882d07aa31b2a4599a0ca1f1ec479ab1e3c049 | refs/heads/master | 2021-07-30T20:42:13.424147 | 2021-07-24T00:28:26 | 2021-07-24T00:28:26 | 34,561,150 | 8 | 0 | null | 2020-10-13T10:15:27 | 2015-04-25T08:26:23 | Java | UTF-8 | C++ | false | false | 3,420 | h | /*
Copyright (c) 2019, Yasuhiro Hasegawa
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
OF SUCH DAMAGE.
*/
//
// Programs.h
//
#ifndef COURIER_PROGRAMS_H__
#define COURIER_PROGRAMS_H__
#include "../courier/Block.h"
#include "../stub/IDP.h"
namespace Courier {
namespace Programs {
struct Info {
quint32 programCode;
const char* programName;
quint16 versionCode;
quint16 procedureCode;
const char* procedureName;
};
class Procedure {
public:
quint16 code;
QString name;
Procedure() : code(0xFFFFU), name("?") {}
Procedure(int code_, QString name_) : code(code_), name(name_) {}
Procedure(const Procedure& that) : code(that.code), name(that.name) {}
Procedure& operator=(const Procedure& that) {
code = that.code;
name = that.name;
return *this;
}
};
class Program;
class Version {
public:
quint16 code;
Version() : code(0xFFFF) {}
Version(quint16 code_) : code(code_) {}
Version(const Version& that) : code(that.code) {}
Version& operator=(const Version& that) {
code = that.code;
return *this;
}
void addPocedure (Procedure& value);
Procedure& getProcedure(int procedureCode);
bool contains (int procedureCode);
private:
QMap<quint16, Procedure> procedureMap;
};
class Program {
public:
quint32 code;
QString name;
Program() : code(-1), name("?") {}
Program(quint32 code_, QString name_) : code(code_), name(name_) {}
Program(const Program& that) : code(that.code), name(that.name) {}
Program& operator=(const Program& that) {
code = that.code;
name = that.name;
return *this;
}
void addVersion(quint16 versionCode);
Version& getVersion(quint16 versionCode);
bool contains (quint16 versionCode);
static void addEntry(quint32 programCode, QString programName, quint16 versionCode, quint16 procudureCode, QString procedureName);
static Procedure& getProcedure(quint32 programCode, quint16 versionCode, quint16 procedureCode);
static Program& getProgram(quint32 programCode);
static void init();
private:
static QMap<quint32, Program> programMap;
QMap<quint16, Version> versionMap;
};
}
}
#endif
| [
"hasegawa@ubuntudev.local"
] | hasegawa@ubuntudev.local |
fdbdf49935e46fa24bb1151a8fb082a53322bb37 | 00514cbfea1164262b91c1de279ffa21a0927b16 | /LocationMonitor/inc/MockLocationListener.h | fc14db59663033ee4f5a9061042579114cf2cc90 | [
"BSD-2-Clause"
] | permissive | PassionJHack/passion | 7e1ef1797600dcc003b5a9b167ab75a49021b386 | 06236f5d911dcbd5477d366e1cd8ef0c53b9b01c | refs/heads/master | 2016-09-05T18:24:10.990412 | 2014-09-24T07:42:34 | 2014-09-24T07:42:34 | 24,096,027 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 475 | h | /*
* MockLocationListener.h
*
* Created on: Sep 17, 2014
*/
#ifndef MOCKLOCATIONLISTENER_H_
#define MOCKLOCATIONLISTENER_H_
#include <FBase.h>
class MockLocationListener
: public Tizen::Base::Runtime::ITimerEventListener
{
public:
MockLocationListener();
~MockLocationListener();
void OnTimerExpired(Tizen::Base::Runtime::Timer& timer);
void StartApp();
private:
int __count;
Tizen::Base::Runtime::Timer __timer;
};
#endif /* MOCKLOCATIONLISTENER_H_ */
| [
"coderiff@gmail.com"
] | coderiff@gmail.com |
0bef0371ade0e8728ee8ca82d3205329035fc8a2 | 4f84edd071ba95f236e6695985094ad399a5e1cd | /src/ValuationFunctions/MonteCarloFunctions/FunctionHelpers/OneStepMonteCarloValuation.cpp | 106ea30102a5fc52144710ee204c95e23251e6e7 | [] | no_license | Faiz00762/Cpp-Monte-Carlo-Value-at-Risk-Engine | b1e65db7ae9133d06d016421c61a07b86f0adf71 | 856ae7f198edb7b18a384a16e32a20e36e6f2f93 | refs/heads/master | 2022-12-08T04:50:29.579328 | 2020-08-12T05:19:11 | 2020-08-12T05:19:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 979 | cpp | #include "OneStepMonteCarloValuation.h"
#include "Random.h"
void OneStepMonteCarloValuation(const StandardExcerciseOption& TheOption, double spot, double vol, double r, double d, unsigned long numberOfPaths, MJArray normVariates, StatisticsMC& gatherer)
{
if (normVariates.size() != numberOfPaths)
throw("mismatched number of paths and normal variates");
//Pre-calculate as much as possible
double Expiry = TheOption.GetExpiry();
double variance = vol * vol * Expiry;
double rootVariance = sqrt(variance);
double itoCorrection = -0.5 * variance;
double movedSpot = spot * exp((r-d) * Expiry + itoCorrection);
double thisSpot;
double discounting = exp(-r * Expiry);
for (unsigned long i = 0; i < numberOfPaths; i++)
{
thisSpot = movedSpot * exp(rootVariance * normVariates[i]);
double thisPayoff = TheOption.OptionPayOff(thisSpot);
gatherer.DumpOneResult(discounting * thisPayoff);
}
return;
}
| [
"oscarun@KTH.SE"
] | oscarun@KTH.SE |
0132e8a2df177f8261b73764cc76a06079ae0d33 | 0588e908e8a7a7b87367c036c3df407d88b38700 | /src/test/transaction_tests.cpp | 7ed6d913a5632e241c0454ec17d37ebe93fe4494 | [
"MIT"
] | permissive | ShroudProtocol/ShroudX | d4f06ef262b28aeb115f1ebbd9432e1744829ab0 | 369c800cbf4a50f4a7cd01f5c155833f1ade3093 | refs/heads/master | 2023-04-23T05:12:02.347418 | 2021-05-04T20:28:55 | 2021-05-04T20:28:55 | 302,146,008 | 2 | 4 | MIT | 2020-12-07T10:18:21 | 2020-10-07T19:56:30 | C | UTF-8 | C++ | false | false | 35,798 | cpp | // Copyright (c) 2011-2016 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "data/tx_invalid.json.h"
#include "data/tx_valid.json.h"
#include "test/test_bitcoin.h"
#include "miner.h"
#include "noui.h"
#include "clientversion.h"
#include "checkqueue.h"
#include "consensus/validation.h"
#include "core_io.h"
#include "key.h"
#include "keystore.h"
#include "main.h" // For CheckTransaction
#include "policy/policy.h"
#include "script/script.h"
#include "script/sign.h"
#include "script/script_error.h"
#include "script/standard.h"
#include "utilstrencodings.h"
#include "shroudnodeman.h"
#include "shroudnode-sync.h"
#include "shroudnode-payments.h"
#include <map>
#include <string>
#include <boost/algorithm/string/classification.hpp>
#include <boost/algorithm/string/split.hpp>
#include <boost/assign/list_of.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/assign/list_of.hpp>
#include <boost/foreach.hpp>
#include <univalue.h>
#include "zerocoin.h"
using namespace std;
typedef vector<unsigned char> valtype;
// In script_tests.cpp
extern UniValue read_json(const std::string& jsondata);
static std::map<string, unsigned int> mapFlagNames = boost::assign::map_list_of
(string("NONE"), (unsigned int)SCRIPT_VERIFY_NONE)
(string("P2SH"), (unsigned int)SCRIPT_VERIFY_P2SH)
(string("STRICTENC"), (unsigned int)SCRIPT_VERIFY_STRICTENC)
(string("DERSIG"), (unsigned int)SCRIPT_VERIFY_DERSIG)
(string("LOW_S"), (unsigned int)SCRIPT_VERIFY_LOW_S)
(string("SIGPUSHONLY"), (unsigned int)SCRIPT_VERIFY_SIGPUSHONLY)
(string("MINIMALDATA"), (unsigned int)SCRIPT_VERIFY_MINIMALDATA)
(string("NULLDUMMY"), (unsigned int)SCRIPT_VERIFY_NULLDUMMY)
(string("DISCOURAGE_UPGRADABLE_NOPS"), (unsigned int)SCRIPT_VERIFY_DISCOURAGE_UPGRADABLE_NOPS)
(string("CLEANSTACK"), (unsigned int)SCRIPT_VERIFY_CLEANSTACK)
(string("MINIMALIF"), (unsigned int)SCRIPT_VERIFY_MINIMALIF)
(string("NULLFAIL"), (unsigned int)SCRIPT_VERIFY_NULLFAIL)
(string("CHECKLOCKTIMEVERIFY"), (unsigned int)SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY)
(string("CHECKSEQUENCEVERIFY"), (unsigned int)SCRIPT_VERIFY_CHECKSEQUENCEVERIFY)
(string("WITNESS"), (unsigned int)SCRIPT_VERIFY_WITNESS)
(string("DISCOURAGE_UPGRADABLE_WITNESS_PROGRAM"), (unsigned int)SCRIPT_VERIFY_DISCOURAGE_UPGRADABLE_WITNESS_PROGRAM)
(string("WITNESS_PUBKEYTYPE"), (unsigned int)SCRIPT_VERIFY_WITNESS_PUBKEYTYPE);
unsigned int ParseScriptFlags(string strFlags)
{
if (strFlags.empty()) {
return 0;
}
unsigned int flags = 0;
vector<string> words;
boost::algorithm::split(words, strFlags, boost::algorithm::is_any_of(","));
BOOST_FOREACH(string word, words)
{
if (!mapFlagNames.count(word))
BOOST_ERROR("Bad test: unknown verification flag '" << word << "'");
flags |= mapFlagNames[word];
}
return flags;
}
string FormatScriptFlags(unsigned int flags)
{
if (flags == 0) {
return "";
}
string ret;
std::map<string, unsigned int>::const_iterator it = mapFlagNames.begin();
while (it != mapFlagNames.end()) {
if (flags & it->second) {
ret += it->first + ",";
}
it++;
}
return ret.substr(0, ret.size() - 1);
}
extern bool AppInit(int argc, char* argv[]);
BOOST_FIXTURE_TEST_SUITE(transaction_tests, BasicTestingSetup)
BOOST_AUTO_TEST_CASE(tx_valid)
{
// Read tests from test/data/tx_valid.json
// Format is an array of arrays
// Inner arrays are either [ "comment" ]
// or [[[prevout hash, prevout index, prevout scriptPubKey], [input 2], ...],"], serializedTransaction, verifyFlags
// ... where all scripts are stringified scripts.
//
// verifyFlags is a comma separated list of script verification flags to apply, or "NONE"
UniValue tests = read_json(std::string(json_tests::tx_valid, json_tests::tx_valid + sizeof(json_tests::tx_valid)));
ScriptError err;
for (unsigned int idx = 0; idx < tests.size(); idx++) {
UniValue test = tests[idx];
string strTest = test.write();
if (test[0].isArray())
{
if (test.size() != 3 || !test[1].isStr() || !test[2].isStr())
{
BOOST_ERROR("Bad test: " << strTest);
continue;
}
map<COutPoint, CScript> mapprevOutScriptPubKeys;
map<COutPoint, int64_t> mapprevOutValues;
UniValue inputs = test[0].get_array();
bool fValid = true;
for (unsigned int inpIdx = 0; inpIdx < inputs.size(); inpIdx++) {
const UniValue& input = inputs[inpIdx];
if (!input.isArray())
{
fValid = false;
break;
}
UniValue vinput = input.get_array();
if (vinput.size() < 3 || vinput.size() > 4)
{
fValid = false;
break;
}
COutPoint outpoint(uint256S(vinput[0].get_str()), vinput[1].get_int());
mapprevOutScriptPubKeys[outpoint] = ParseScript(vinput[2].get_str());
if (vinput.size() >= 4)
{
mapprevOutValues[outpoint] = vinput[3].get_int64();
}
}
if (!fValid)
{
BOOST_ERROR("Bad test: " << strTest);
continue;
}
string transaction = test[1].get_str();
CDataStream stream(ParseHex(transaction), SER_NETWORK, PROTOCOL_VERSION);
CTransaction tx;
stream >> tx;
CValidationState state;
BOOST_CHECK_MESSAGE(CheckTransaction(tx, state, tx.GetHash(), false, INT_MAX), strTest);
BOOST_CHECK(state.IsValid());
PrecomputedTransactionData txdata(tx);
for (unsigned int i = 0; i < tx.vin.size(); i++)
{
if (!mapprevOutScriptPubKeys.count(tx.vin[i].prevout))
{
BOOST_ERROR("Bad test: " << strTest);
break;
}
CAmount amount = 0;
if (mapprevOutValues.count(tx.vin[i].prevout)) {
amount = mapprevOutValues[tx.vin[i].prevout];
}
unsigned int verify_flags = ParseScriptFlags(test[2].get_str());
const CScriptWitness *witness = (i < tx.wit.vtxinwit.size()) ? &tx.wit.vtxinwit[i].scriptWitness : NULL;
BOOST_CHECK_MESSAGE(VerifyScript(tx.vin[i].scriptSig, mapprevOutScriptPubKeys[tx.vin[i].prevout],
witness, verify_flags, TransactionSignatureChecker(&tx, i, amount, txdata), &err),
strTest);
BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
}
}
}
}
BOOST_AUTO_TEST_CASE(tx_invalid)
{
// Read tests from test/data/tx_invalid.json
// Format is an array of arrays
// Inner arrays are either [ "comment" ]
// or [[[prevout hash, prevout index, prevout scriptPubKey], [input 2], ...],"], serializedTransaction, verifyFlags
// ... where all scripts are stringified scripts.
//
// verifyFlags is a comma separated list of script verification flags to apply, or "NONE"
UniValue tests = read_json(std::string(json_tests::tx_invalid, json_tests::tx_invalid + sizeof(json_tests::tx_invalid)));
ScriptError err;
for (unsigned int idx = 0; idx < tests.size(); idx++) {
UniValue test = tests[idx];
string strTest = test.write();
if (test[0].isArray())
{
if (test.size() != 3 || !test[1].isStr() || !test[2].isStr())
{
BOOST_ERROR("Bad test: " << strTest);
continue;
}
map<COutPoint, CScript> mapprevOutScriptPubKeys;
map<COutPoint, int64_t> mapprevOutValues;
UniValue inputs = test[0].get_array();
bool fValid = true;
for (unsigned int inpIdx = 0; inpIdx < inputs.size(); inpIdx++) {
const UniValue& input = inputs[inpIdx];
if (!input.isArray())
{
fValid = false;
break;
}
UniValue vinput = input.get_array();
if (vinput.size() < 3 || vinput.size() > 4)
{
fValid = false;
break;
}
COutPoint outpoint(uint256S(vinput[0].get_str()), vinput[1].get_int());
mapprevOutScriptPubKeys[outpoint] = ParseScript(vinput[2].get_str());
if (vinput.size() >= 4)
{
mapprevOutValues[outpoint] = vinput[3].get_int64();
}
}
if (!fValid)
{
BOOST_ERROR("Bad test: " << strTest);
continue;
}
string transaction = test[1].get_str();
CDataStream stream(ParseHex(transaction), SER_NETWORK, PROTOCOL_VERSION );
CTransaction tx;
stream >> tx;
CValidationState state;
fValid = CheckTransaction(tx, state, tx.GetHash(), false, INT_MAX) && state.IsValid();
PrecomputedTransactionData txdata(tx);
for (unsigned int i = 0; i < tx.vin.size() && fValid; i++)
{
if (!mapprevOutScriptPubKeys.count(tx.vin[i].prevout))
{
BOOST_ERROR("Bad test: " << strTest);
break;
}
unsigned int verify_flags = ParseScriptFlags(test[2].get_str());
CAmount amount = 0;
if (mapprevOutValues.count(tx.vin[i].prevout)) {
amount = mapprevOutValues[tx.vin[i].prevout];
}
const CScriptWitness *witness = (i < tx.wit.vtxinwit.size()) ? &tx.wit.vtxinwit[i].scriptWitness : NULL;
fValid = VerifyScript(tx.vin[i].scriptSig, mapprevOutScriptPubKeys[tx.vin[i].prevout],
witness, verify_flags, TransactionSignatureChecker(&tx, i, amount, txdata), &err);
}
BOOST_CHECK_MESSAGE(!fValid, strTest);
BOOST_CHECK_MESSAGE(err != SCRIPT_ERR_OK, ScriptErrorString(err));
}
}
}
BOOST_AUTO_TEST_CASE(basic_transaction_tests)
{
// Random real transaction (e2769b09e784f32f62ef849763d4f45b98e07ba658647343b915ff832b110436)
unsigned char ch[] = {0x01, 0x00, 0x00, 0x00, 0x01, 0x6b, 0xff, 0x7f, 0xcd, 0x4f, 0x85, 0x65, 0xef, 0x40, 0x6d, 0xd5, 0xd6, 0x3d, 0x4f, 0xf9, 0x4f, 0x31, 0x8f, 0xe8, 0x20, 0x27, 0xfd, 0x4d, 0xc4, 0x51, 0xb0, 0x44, 0x74, 0x01, 0x9f, 0x74, 0xb4, 0x00, 0x00, 0x00, 0x00, 0x8c, 0x49, 0x30, 0x46, 0x02, 0x21, 0x00, 0xda, 0x0d, 0xc6, 0xae, 0xce, 0xfe, 0x1e, 0x06, 0xef, 0xdf, 0x05, 0x77, 0x37, 0x57, 0xde, 0xb1, 0x68, 0x82, 0x09, 0x30, 0xe3, 0xb0, 0xd0, 0x3f, 0x46, 0xf5, 0xfc, 0xf1, 0x50, 0xbf, 0x99, 0x0c, 0x02, 0x21, 0x00, 0xd2, 0x5b, 0x5c, 0x87, 0x04, 0x00, 0x76, 0xe4, 0xf2, 0x53, 0xf8, 0x26, 0x2e, 0x76, 0x3e, 0x2d, 0xd5, 0x1e, 0x7f, 0xf0, 0xbe, 0x15, 0x77, 0x27, 0xc4, 0xbc, 0x42, 0x80, 0x7f, 0x17, 0xbd, 0x39, 0x01, 0x41, 0x04, 0xe6, 0xc2, 0x6e, 0xf6, 0x7d, 0xc6, 0x10, 0xd2, 0xcd, 0x19, 0x24, 0x84, 0x78, 0x9a, 0x6c, 0xf9, 0xae, 0xa9, 0x93, 0x0b, 0x94, 0x4b, 0x7e, 0x2d, 0xb5, 0x34, 0x2b, 0x9d, 0x9e, 0x5b, 0x9f, 0xf7, 0x9a, 0xff, 0x9a, 0x2e, 0xe1, 0x97, 0x8d, 0xd7, 0xfd, 0x01, 0xdf, 0xc5, 0x22, 0xee, 0x02, 0x28, 0x3d, 0x3b, 0x06, 0xa9, 0xd0, 0x3a, 0xcf, 0x80, 0x96, 0x96, 0x8d, 0x7d, 0xbb, 0x0f, 0x91, 0x78, 0xff, 0xff, 0xff, 0xff, 0x02, 0x8b, 0xa7, 0x94, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x19, 0x76, 0xa9, 0x14, 0xba, 0xde, 0xec, 0xfd, 0xef, 0x05, 0x07, 0x24, 0x7f, 0xc8, 0xf7, 0x42, 0x41, 0xd7, 0x3b, 0xc0, 0x39, 0x97, 0x2d, 0x7b, 0x88, 0xac, 0x40, 0x94, 0xa8, 0x02, 0x00, 0x00, 0x00, 0x00, 0x19, 0x76, 0xa9, 0x14, 0xc1, 0x09, 0x32, 0x48, 0x3f, 0xec, 0x93, 0xed, 0x51, 0xf5, 0xfe, 0x95, 0xe7, 0x25, 0x59, 0xf2, 0xcc, 0x70, 0x43, 0xf9, 0x88, 0xac, 0x00, 0x00, 0x00, 0x00, 0x00};
vector<unsigned char> vch(ch, ch + sizeof(ch) -1);
CDataStream stream(vch, SER_DISK, CLIENT_VERSION);
CMutableTransaction tx;
stream >> tx;
CValidationState state;
BOOST_CHECK_MESSAGE(CheckTransaction(tx, state, tx.GetHash(), false, INT_MAX) && state.IsValid(), "Simple deserialized transaction should be valid.");
// Check that duplicate txins fail
tx.vin.push_back(tx.vin[0]);
BOOST_CHECK_MESSAGE(!CheckTransaction(tx, state, tx.GetHash(), false, INT_MAX) || !state.IsValid(), "Transaction with duplicate txins should be invalid.");
}
//
// Helper: create two dummy transactions, each with
// two outputs. The first has 11 and 50 CENT outputs
// paid to a TX_PUBKEY, the second 21 and 22 CENT outputs
// paid to a TX_PUBKEYHASH.
//
static std::vector<CMutableTransaction>
SetupDummyInputs(CBasicKeyStore& keystoreRet, CCoinsViewCache& coinsRet)
{
std::vector<CMutableTransaction> dummyTransactions;
dummyTransactions.resize(2);
// Add some keys to the keystore:
CKey key[4];
for (int i = 0; i < 4; i++)
{
key[i].MakeNewKey(i % 2);
keystoreRet.AddKey(key[i]);
}
// Create some dummy input transactions
dummyTransactions[0].vout.resize(2);
dummyTransactions[0].vout[0].nValue = 11*CENT;
dummyTransactions[0].vout[0].scriptPubKey << ToByteVector(key[0].GetPubKey()) << OP_CHECKSIG;
dummyTransactions[0].vout[1].nValue = 50*CENT;
dummyTransactions[0].vout[1].scriptPubKey << ToByteVector(key[1].GetPubKey()) << OP_CHECKSIG;
coinsRet.ModifyCoins(dummyTransactions[0].GetHash())->FromTx(dummyTransactions[0], 0);
dummyTransactions[1].vout.resize(2);
dummyTransactions[1].vout[0].nValue = 21*CENT;
dummyTransactions[1].vout[0].scriptPubKey = GetScriptForDestination(key[2].GetPubKey().GetID());
dummyTransactions[1].vout[1].nValue = 22*CENT;
dummyTransactions[1].vout[1].scriptPubKey = GetScriptForDestination(key[3].GetPubKey().GetID());
coinsRet.ModifyCoins(dummyTransactions[1].GetHash())->FromTx(dummyTransactions[1], 0);
return dummyTransactions;
}
BOOST_AUTO_TEST_CASE(test_Get)
{
CBasicKeyStore keystore;
CCoinsView coinsDummy;
CCoinsViewCache coins(&coinsDummy);
std::vector<CMutableTransaction> dummyTransactions = SetupDummyInputs(keystore, coins);
CMutableTransaction t1;
t1.vin.resize(3);
t1.vin[0].prevout.hash = dummyTransactions[0].GetHash();
t1.vin[0].prevout.n = 1;
t1.vin[0].scriptSig << std::vector<unsigned char>(65, 0);
t1.vin[1].prevout.hash = dummyTransactions[1].GetHash();
t1.vin[1].prevout.n = 0;
t1.vin[1].scriptSig << std::vector<unsigned char>(65, 0) << std::vector<unsigned char>(33, 4);
t1.vin[2].prevout.hash = dummyTransactions[1].GetHash();
t1.vin[2].prevout.n = 1;
t1.vin[2].scriptSig << std::vector<unsigned char>(65, 0) << std::vector<unsigned char>(33, 4);
t1.vout.resize(2);
t1.vout[0].nValue = 90*CENT;
t1.vout[0].scriptPubKey << OP_1;
BOOST_CHECK(AreInputsStandard(t1, coins));
BOOST_CHECK_EQUAL(coins.GetValueIn(t1), (50+21+22)*CENT);
}
void CreateCreditAndSpend(const CKeyStore& keystore, const CScript& outscript, CTransaction& output, CMutableTransaction& input, bool success = true)
{
CMutableTransaction outputm;
outputm.nVersion = 1;
outputm.vin.resize(1);
outputm.vin[0].prevout.SetNull();
outputm.vin[0].scriptSig = CScript();
outputm.wit.vtxinwit.resize(1);
outputm.vout.resize(1);
outputm.vout[0].nValue = 1;
outputm.vout[0].scriptPubKey = outscript;
CDataStream ssout(SER_NETWORK, PROTOCOL_VERSION);
ssout << outputm;
ssout >> output;
assert(output.vin.size() == 1);
assert(output.vin[0] == outputm.vin[0]);
assert(output.vout.size() == 1);
assert(output.vout[0] == outputm.vout[0]);
assert(output.wit.vtxinwit.size() == 0);
CMutableTransaction inputm;
inputm.nVersion = 1;
inputm.vin.resize(1);
inputm.vin[0].prevout.hash = output.GetHash();
inputm.vin[0].prevout.n = 0;
inputm.wit.vtxinwit.resize(1);
inputm.vout.resize(1);
inputm.vout[0].nValue = 1;
inputm.vout[0].scriptPubKey = CScript();
bool ret = SignSignature(keystore, output, inputm, 0, SIGHASH_ALL);
assert(ret == success);
CDataStream ssin(SER_NETWORK, PROTOCOL_VERSION);
ssin << inputm;
ssin >> input;
assert(input.vin.size() == 1);
assert(input.vin[0] == inputm.vin[0]);
assert(input.vout.size() == 1);
assert(input.vout[0] == inputm.vout[0]);
if (inputm.wit.IsNull()) {
assert(input.wit.IsNull());
} else {
assert(!input.wit.IsNull());
assert(input.wit.vtxinwit.size() == 1);
assert(input.wit.vtxinwit[0].scriptWitness.stack == inputm.wit.vtxinwit[0].scriptWitness.stack);
}
}
void CheckWithFlag(const CTransaction& output, const CMutableTransaction& input, int flags, bool success)
{
ScriptError error;
CTransaction inputi(input);
bool ret = VerifyScript(inputi.vin[0].scriptSig, output.vout[0].scriptPubKey, inputi.wit.vtxinwit.size() > 0 ? &inputi.wit.vtxinwit[0].scriptWitness : NULL, flags, TransactionSignatureChecker(&inputi, 0, output.vout[0].nValue), &error);
assert(ret == success);
}
static CScript PushAll(const vector<valtype>& values)
{
CScript result;
BOOST_FOREACH(const valtype& v, values) {
if (v.size() == 0) {
result << OP_0;
} else if (v.size() == 1 && v[0] >= 1 && v[0] <= 16) {
result << CScript::EncodeOP_N(v[0]);
} else {
result << v;
}
}
return result;
}
void ReplaceRedeemScript(CScript& script, const CScript& redeemScript)
{
vector<valtype> stack;
EvalScript(stack, script, SCRIPT_VERIFY_STRICTENC, BaseSignatureChecker(), SIGVERSION_BASE);
assert(stack.size() > 0);
stack.back() = std::vector<unsigned char>(redeemScript.begin(), redeemScript.end());
script = PushAll(stack);
}
BOOST_AUTO_TEST_CASE(test_big_witness_transaction) {
CMutableTransaction mtx;
mtx.nVersion = 1;
CKey key;
key.MakeNewKey(true); // Need to use compressed keys in segwit or the signing will fail
CBasicKeyStore keystore;
keystore.AddKeyPubKey(key, key.GetPubKey());
CKeyID hash = key.GetPubKey().GetID();
CScript scriptPubKey = CScript() << OP_0 << std::vector<unsigned char>(hash.begin(), hash.end());
vector<int> sigHashes;
sigHashes.push_back(SIGHASH_NONE | SIGHASH_ANYONECANPAY);
sigHashes.push_back(SIGHASH_SINGLE | SIGHASH_ANYONECANPAY);
sigHashes.push_back(SIGHASH_ALL | SIGHASH_ANYONECANPAY);
sigHashes.push_back(SIGHASH_NONE);
sigHashes.push_back(SIGHASH_SINGLE);
sigHashes.push_back(SIGHASH_ALL);
// create a big transaction of 4500 inputs signed by the same key
for(uint32_t ij = 0; ij < 4500; ij++) {
uint32_t i = mtx.vin.size();
uint256 prevId;
prevId.SetHex("0000000000000000000000000000000000000000000000000000000000000100");
COutPoint outpoint(prevId, i);
mtx.vin.resize(mtx.vin.size() + 1);
mtx.vin[i].prevout = outpoint;
mtx.vin[i].scriptSig = CScript();
mtx.vout.resize(mtx.vout.size() + 1);
mtx.vout[i].nValue = 1000;
mtx.vout[i].scriptPubKey = CScript() << OP_1;
}
// sign all inputs
for(uint32_t i = 0; i < mtx.vin.size(); i++) {
bool hashSigned = SignSignature(keystore, scriptPubKey, mtx, i, 1000, sigHashes.at(i % sigHashes.size()));
assert(hashSigned);
}
CTransaction tx;
CDataStream ssout(SER_NETWORK, PROTOCOL_VERSION);
WithOrVersion(&ssout, 0) << mtx;
WithOrVersion(&ssout, 0) >> tx;
// check all inputs concurrently, with the cache
PrecomputedTransactionData txdata(tx);
boost::thread_group threadGroup;
CCheckQueue<CScriptCheck> scriptcheckqueue(128);
CCheckQueueControl<CScriptCheck> control(&scriptcheckqueue);
for (int i=0; i<20; i++)
threadGroup.create_thread(boost::bind(&CCheckQueue<CScriptCheck>::Thread, boost::ref(scriptcheckqueue)));
CCoins coins;
coins.nVersion = 1;
coins.fCoinBase = false;
for(uint32_t i = 0; i < mtx.vin.size(); i++) {
CTxOut txout;
txout.nValue = 1000;
txout.scriptPubKey = scriptPubKey;
coins.vout.push_back(txout);
}
for(uint32_t i = 0; i < mtx.vin.size(); i++) {
std::vector<CScriptCheck> vChecks;
CScriptCheck check(coins, tx, i, SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_WITNESS, false, &txdata);
vChecks.push_back(CScriptCheck());
check.swap(vChecks.back());
control.Add(vChecks);
}
bool controlCheck = control.Wait();
assert(controlCheck);
threadGroup.interrupt_all();
threadGroup.join_all();
}
BOOST_AUTO_TEST_CASE(test_witness)
{
CBasicKeyStore keystore, keystore2;
CKey key1, key2, key3, key1L, key2L;
CPubKey pubkey1, pubkey2, pubkey3, pubkey1L, pubkey2L;
key1.MakeNewKey(true);
key2.MakeNewKey(true);
key3.MakeNewKey(true);
key1L.MakeNewKey(false);
key2L.MakeNewKey(false);
pubkey1 = key1.GetPubKey();
pubkey2 = key2.GetPubKey();
pubkey3 = key3.GetPubKey();
pubkey1L = key1L.GetPubKey();
pubkey2L = key2L.GetPubKey();
keystore.AddKeyPubKey(key1, pubkey1);
keystore.AddKeyPubKey(key2, pubkey2);
keystore.AddKeyPubKey(key1L, pubkey1L);
keystore.AddKeyPubKey(key2L, pubkey2L);
CScript scriptPubkey1, scriptPubkey2, scriptPubkey1L, scriptPubkey2L, scriptMulti;
scriptPubkey1 << ToByteVector(pubkey1) << OP_CHECKSIG;
scriptPubkey2 << ToByteVector(pubkey2) << OP_CHECKSIG;
scriptPubkey1L << ToByteVector(pubkey1L) << OP_CHECKSIG;
scriptPubkey2L << ToByteVector(pubkey2L) << OP_CHECKSIG;
std::vector<CPubKey> oneandthree;
oneandthree.push_back(pubkey1);
oneandthree.push_back(pubkey3);
scriptMulti = GetScriptForMultisig(2, oneandthree);
keystore.AddCScript(scriptPubkey1);
keystore.AddCScript(scriptPubkey2);
keystore.AddCScript(scriptPubkey1L);
keystore.AddCScript(scriptPubkey2L);
keystore.AddCScript(scriptMulti);
keystore.AddCScript(GetScriptForWitness(scriptPubkey1));
keystore.AddCScript(GetScriptForWitness(scriptPubkey2));
keystore.AddCScript(GetScriptForWitness(scriptPubkey1L));
keystore.AddCScript(GetScriptForWitness(scriptPubkey2L));
keystore.AddCScript(GetScriptForWitness(scriptMulti));
keystore2.AddCScript(scriptMulti);
keystore2.AddCScript(GetScriptForWitness(scriptMulti));
keystore2.AddKeyPubKey(key3, pubkey3);
CTransaction output1, output2;
CMutableTransaction input1, input2;
SignatureData sigdata;
// Normal pay-to-compressed-pubkey.
CreateCreditAndSpend(keystore, scriptPubkey1, output1, input1);
CreateCreditAndSpend(keystore, scriptPubkey2, output2, input2);
CheckWithFlag(output1, input1, 0, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
CheckWithFlag(output1, input2, 0, false);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, STANDARD_SCRIPT_VERIFY_FLAGS, false);
// P2SH pay-to-compressed-pubkey.
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(scriptPubkey1)), output1, input1);
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(scriptPubkey2)), output2, input2);
ReplaceRedeemScript(input2.vin[0].scriptSig, scriptPubkey1);
CheckWithFlag(output1, input1, 0, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
CheckWithFlag(output1, input2, 0, true);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, STANDARD_SCRIPT_VERIFY_FLAGS, false);
// Witness pay-to-compressed-pubkey (v0).
CreateCreditAndSpend(keystore, GetScriptForWitness(scriptPubkey1), output1, input1);
CreateCreditAndSpend(keystore, GetScriptForWitness(scriptPubkey2), output2, input2);
CheckWithFlag(output1, input1, 0, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
CheckWithFlag(output1, input2, 0, true);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, STANDARD_SCRIPT_VERIFY_FLAGS, false);
// P2SH witness pay-to-compressed-pubkey (v0).
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(GetScriptForWitness(scriptPubkey1))), output1, input1);
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(GetScriptForWitness(scriptPubkey2))), output2, input2);
ReplaceRedeemScript(input2.vin[0].scriptSig, GetScriptForWitness(scriptPubkey1));
CheckWithFlag(output1, input1, 0, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
CheckWithFlag(output1, input2, 0, true);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, STANDARD_SCRIPT_VERIFY_FLAGS, false);
// Normal pay-to-uncompressed-pubkey.
CreateCreditAndSpend(keystore, scriptPubkey1L, output1, input1);
CreateCreditAndSpend(keystore, scriptPubkey2L, output2, input2);
CheckWithFlag(output1, input1, 0, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
CheckWithFlag(output1, input2, 0, false);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, STANDARD_SCRIPT_VERIFY_FLAGS, false);
// P2SH pay-to-uncompressed-pubkey.
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(scriptPubkey1L)), output1, input1);
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(scriptPubkey2L)), output2, input2);
ReplaceRedeemScript(input2.vin[0].scriptSig, scriptPubkey1L);
CheckWithFlag(output1, input1, 0, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
CheckWithFlag(output1, input2, 0, true);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, SCRIPT_VERIFY_WITNESS | SCRIPT_VERIFY_P2SH, false);
CheckWithFlag(output1, input2, STANDARD_SCRIPT_VERIFY_FLAGS, false);
// Signing disabled for witness pay-to-uncompressed-pubkey (v1).
CreateCreditAndSpend(keystore, GetScriptForWitness(scriptPubkey1L), output1, input1, false);
CreateCreditAndSpend(keystore, GetScriptForWitness(scriptPubkey2L), output2, input2, false);
// Signing disabled for P2SH witness pay-to-uncompressed-pubkey (v1).
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(GetScriptForWitness(scriptPubkey1L))), output1, input1, false);
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(GetScriptForWitness(scriptPubkey2L))), output2, input2, false);
// Normal 2-of-2 multisig
CreateCreditAndSpend(keystore, scriptMulti, output1, input1, false);
CheckWithFlag(output1, input1, 0, false);
CreateCreditAndSpend(keystore2, scriptMulti, output2, input2, false);
CheckWithFlag(output2, input2, 0, false);
BOOST_CHECK(output1 == output2);
UpdateTransaction(input1, 0, CombineSignatures(output1.vout[0].scriptPubKey, MutableTransactionSignatureChecker(&input1, 0, output1.vout[0].nValue), DataFromTransaction(input1, 0), DataFromTransaction(input2, 0)));
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
// P2SH 2-of-2 multisig
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(scriptMulti)), output1, input1, false);
CheckWithFlag(output1, input1, 0, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH, false);
CreateCreditAndSpend(keystore2, GetScriptForDestination(CScriptID(scriptMulti)), output2, input2, false);
CheckWithFlag(output2, input2, 0, true);
CheckWithFlag(output2, input2, SCRIPT_VERIFY_P2SH, false);
BOOST_CHECK(output1 == output2);
UpdateTransaction(input1, 0, CombineSignatures(output1.vout[0].scriptPubKey, MutableTransactionSignatureChecker(&input1, 0, output1.vout[0].nValue), DataFromTransaction(input1, 0), DataFromTransaction(input2, 0)));
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
// Witness 2-of-2 multisig
CreateCreditAndSpend(keystore, GetScriptForWitness(scriptMulti), output1, input1, false);
CheckWithFlag(output1, input1, 0, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_WITNESS, false);
CreateCreditAndSpend(keystore2, GetScriptForWitness(scriptMulti), output2, input2, false);
CheckWithFlag(output2, input2, 0, true);
CheckWithFlag(output2, input2, SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_WITNESS, false);
BOOST_CHECK(output1 == output2);
UpdateTransaction(input1, 0, CombineSignatures(output1.vout[0].scriptPubKey, MutableTransactionSignatureChecker(&input1, 0, output1.vout[0].nValue), DataFromTransaction(input1, 0), DataFromTransaction(input2, 0)));
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_WITNESS, true);
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
// P2SH witness 2-of-2 multisig
CreateCreditAndSpend(keystore, GetScriptForDestination(CScriptID(GetScriptForWitness(scriptMulti))), output1, input1, false);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_WITNESS, false);
CreateCreditAndSpend(keystore2, GetScriptForDestination(CScriptID(GetScriptForWitness(scriptMulti))), output2, input2, false);
CheckWithFlag(output2, input2, SCRIPT_VERIFY_P2SH, true);
CheckWithFlag(output2, input2, SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_WITNESS, false);
BOOST_CHECK(output1 == output2);
UpdateTransaction(input1, 0, CombineSignatures(output1.vout[0].scriptPubKey, MutableTransactionSignatureChecker(&input1, 0, output1.vout[0].nValue), DataFromTransaction(input1, 0), DataFromTransaction(input2, 0)));
CheckWithFlag(output1, input1, SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_WITNESS, true);
CheckWithFlag(output1, input1, STANDARD_SCRIPT_VERIFY_FLAGS, true);
}
BOOST_AUTO_TEST_CASE(test_IsStandard)
{
LOCK(cs_main);
CBasicKeyStore keystore;
CCoinsView coinsDummy;
CCoinsViewCache coins(&coinsDummy);
std::vector<CMutableTransaction> dummyTransactions = SetupDummyInputs(keystore, coins);
CMutableTransaction t;
t.vin.resize(1);
t.vin[0].prevout.hash = dummyTransactions[0].GetHash();
t.vin[0].prevout.n = 1;
t.vin[0].scriptSig << std::vector<unsigned char>(65, 0);
t.vout.resize(1);
t.vout[0].nValue = 90*CENT;
CKey key;
key.MakeNewKey(true);
t.vout[0].scriptPubKey = GetScriptForDestination(key.GetPubKey().GetID());
string reason;
BOOST_CHECK(IsStandardTx(t, reason));
// Check dust with default relay fee:
CAmount nDustThreshold = 182 * minRelayTxFee.GetFeePerK()/1000 * 3;
//TO DO BOOST_CHECK_EQUAL(nDustThreshold, 546);
// dust:
t.vout[0].nValue = nDustThreshold - 1;
//TO DO BOOST_CHECK(!IsStandardTx(t, reason));
// not dust:
t.vout[0].nValue = nDustThreshold;
BOOST_CHECK(IsStandardTx(t, reason));
// Check dust with odd relay fee to verify rounding:
// nDustThreshold = 182 * 1234 / 1000 * 3
minRelayTxFee = CFeeRate(1234);
// dust:
t.vout[0].nValue = 672 - 1;
//TO DO BOOST_CHECK(!IsStandardTx(t, reason));
// not dust:
t.vout[0].nValue = 672;
BOOST_CHECK(IsStandardTx(t, reason));
minRelayTxFee = CFeeRate(DEFAULT_MIN_RELAY_TX_FEE);
t.vout[0].scriptPubKey = CScript() << OP_1;
BOOST_CHECK(!IsStandardTx(t, reason));
// MAX_OP_RETURN_RELAY-byte TX_NULL_DATA (standard)
t.vout[0].scriptPubKey = CScript() << OP_RETURN << std::vector<unsigned char>(MAX_OP_RETURN_RELAY - 4);
BOOST_CHECK_EQUAL(MAX_OP_RETURN_RELAY, t.vout[0].scriptPubKey.size());
BOOST_CHECK(IsStandardTx(t, reason));
// MAX_OP_RETURN_RELAY+1-byte TX_NULL_DATA (non-standard)
t.vout[0].scriptPubKey = CScript() << OP_RETURN << std::vector<unsigned char>(MAX_OP_RETURN_RELAY - 3);
BOOST_CHECK_EQUAL(MAX_OP_RETURN_RELAY + 1, t.vout[0].scriptPubKey.size());
BOOST_CHECK(!IsStandardTx(t, reason));
// Data payload can be encoded in any way...
t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("");
BOOST_CHECK(IsStandardTx(t, reason));
t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("00") << ParseHex("01");
BOOST_CHECK(IsStandardTx(t, reason));
// OP_RESERVED *is* considered to be a PUSHDATA type opcode by IsPushOnly()!
t.vout[0].scriptPubKey = CScript() << OP_RETURN << OP_RESERVED << -1 << 0 << ParseHex("01") << 2 << 3 << 4 << 5 << 6 << 7 << 8 << 9 << 10 << 11 << 12 << 13 << 14 << 15 << 16;
BOOST_CHECK(IsStandardTx(t, reason));
t.vout[0].scriptPubKey = CScript() << OP_RETURN << 0 << ParseHex("01") << 2 << ParseHex("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
BOOST_CHECK(IsStandardTx(t, reason));
// ...so long as it only contains PUSHDATA's
t.vout[0].scriptPubKey = CScript() << OP_RETURN << OP_RETURN;
BOOST_CHECK(!IsStandardTx(t, reason));
// TX_NULL_DATA w/o PUSHDATA
t.vout.resize(1);
t.vout[0].scriptPubKey = CScript() << OP_RETURN;
BOOST_CHECK(IsStandardTx(t, reason));
// Only one TX_NULL_DATA permitted in all cases
t.vout.resize(2);
t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38");
t.vout[1].scriptPubKey = CScript() << OP_RETURN << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38");
BOOST_CHECK(!IsStandardTx(t, reason));
t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38");
t.vout[1].scriptPubKey = CScript() << OP_RETURN;
BOOST_CHECK(!IsStandardTx(t, reason));
t.vout[0].scriptPubKey = CScript() << OP_RETURN;
t.vout[1].scriptPubKey = CScript() << OP_RETURN;
BOOST_CHECK(!IsStandardTx(t, reason));
}
BOOST_AUTO_TEST_SUITE_END()
| [
"edgar.keek@gmail.com"
] | edgar.keek@gmail.com |
166ace2053bc0edd28cc9cb54bf18624b831e79f | 6b25b6b444e7adf2b073734787f72575e69ca672 | /src/i2c_mpu6050_node.cpp | 42f559647710b3d5488efbcc9af32802243e558a | [] | no_license | Spritaro/simple_ros2_imu_driver | f2cdd3270cb006765ccc2bd8c98c4cf9bb407789 | 0b8b01bea3f482fb1391c1d68b6378147b3b0b36 | refs/heads/master | 2020-07-30T20:07:56.880853 | 2019-11-25T10:36:19 | 2019-11-25T10:36:19 | 210,343,781 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,840 | cpp | #include <chrono>
#include <math.h>
#include <rclcpp/rclcpp.hpp>
#include <string>
#include <sensor_msgs/msg/imu.hpp>
#include <fcntl.h>
#include <linux/i2c-dev.h>
#include <sys/ioctl.h>
#include <unistd.h>
class I2cMpu6050Node : public rclcpp::Node
{
public:
/* constructor */
explicit I2cMpu6050Node(
const std::string &topic_name,
const unsigned int period_ms,
const std::string &device_name,
const unsigned int address)
: Node("i2c_mpu6050_node")
{
/* Open I2C device */
i2c_fd = open(device_name.c_str(), O_RDWR);
RCLCPP_INFO(this->get_logger(), "device name %s, device no %d", device_name.c_str(), i2c_fd);
if(i2c_fd == -1)
{
throw std::runtime_error("device open error");
}
if (ioctl(i2c_fd, I2C_SLAVE, address) < 0)
{
throw std::runtime_error("Failed to talk to device");
}
/* start IMU */
char buffer[16];
int length;
buffer[0] = 0x6b;
buffer[1] = 0x00;
length = 2;
if(write(i2c_fd, buffer, length) != length)
throw std::runtime_error("Failed to start IMU");
/* message */
message_ = std::make_shared<sensor_msgs::msg::Imu>();
/* publisher */
auto qos = rclcpp::QoS( rclcpp::KeepLast(1) );
publisher_ = create_publisher<sensor_msgs::msg::Imu>(topic_name, qos);
/* timer */
timer_ = create_wall_timer(
std::chrono::milliseconds(period_ms),
std::bind(&I2cMpu6050Node::timer_callback, this)
);
}
private:
/* timer event handler */
void timer_callback()
{
/* read IMU */
char buffer[32];
int length;
buffer[0] = 0x3b; // register address
length = 1;
if(write(i2c_fd, buffer, length) != length)
RCLCPP_INFO(this->get_logger(), "Failed to write");
length = 14; // 6 accelerometer + 2 temperature + 6 gyroscope
if(read(i2c_fd, buffer, length) != length)
RCLCPP_INFO(this->get_logger(), "Failed to read");
message_->linear_acceleration.x = static_cast<double>( static_cast<int16_t>( buffer[0] <<8 | buffer[1] )) * 19.6 / 32768.0;
message_->linear_acceleration.y = static_cast<double>( static_cast<int16_t>( buffer[2] <<8 | buffer[3] )) * 19.6 / 32768.0;
message_->linear_acceleration.z = static_cast<double>( static_cast<int16_t>( buffer[4] <<8 | buffer[5] )) * 19.6 / 32768.0;
message_->angular_velocity.x = static_cast<double>( static_cast<int16_t>( buffer[8] <<8 | buffer[9] )) * M_PI / 360.0 * 250.0 / 32768.0;
message_->angular_velocity.y = static_cast<double>( static_cast<int16_t>( buffer[10]<<8 | buffer[11] )) * M_PI / 360.0 * 250.0 / 32768.0;
message_->angular_velocity.z = static_cast<double>( static_cast<int16_t>( buffer[12]<<8 | buffer[13] )) * M_PI / 360.0 * 250.0 / 32768.0;
RCLCPP_INFO(this->get_logger(), "accel %f %f %f, gyro %f %f %f",
message_->linear_acceleration.x,
message_->linear_acceleration.y,
message_->linear_acceleration.z,
message_->angular_velocity.x,
message_->angular_velocity.y,
message_->angular_velocity.z);
publisher_->publish(*message_);
}
std::shared_ptr<sensor_msgs::msg::Imu> message_;
rclcpp::Publisher<sensor_msgs::msg::Imu>::SharedPtr publisher_;
rclcpp::TimerBase::SharedPtr timer_;
int i2c_fd;
};
int main(int argc, char * argv[])
{
setvbuf(stdout, NULL, _IONBF, BUFSIZ);
/* create node */
rclcpp::init(argc, argv);
auto node = std::make_shared<I2cMpu6050Node>("imu", 50, "/dev/i2c-0", 0x68);
/* spin node */
rclcpp::spin(node);
rclcpp::shutdown();
return 0;
} | [
"k5dot.feb@gmail.com"
] | k5dot.feb@gmail.com |
4df4eca18e73c2f05b7043d1be6873a87ae4d954 | 2f58f7f7834d6f16b0f22d77fc55042f5ede0b0f | /kglt/camera.h | b8e528b16c02073b69c5f8639e159745cadbe231 | [
"BSD-2-Clause"
] | permissive | Nuos/KGLT | 1da0c1e0a4ad49b3e2c5855bf0de8419366eb159 | b172ca304577a0a2df194757ad2ef328ddf3078d | refs/heads/master | 2021-01-12T13:28:04.918040 | 2016-09-27T20:21:52 | 2016-09-27T20:21:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,749 | h | #ifndef CAMERA_H_INCLUDED
#define CAMERA_H_INCLUDED
#include "deps/kazmath/mat4.h"
#include "generic/identifiable.h"
#include "generic/managed.h"
#include "utils/parent_setter_mixin.h"
#include "object.h"
#include "frustum.h"
#include "renderers/renderer.h"
#include "sound.h"
namespace kglt {
class Camera;
enum CameraFollowMode {
CAMERA_FOLLOW_MODE_THIRD_PERSON,
CAMERA_FOLLOW_MODE_DIRECT
};
class CameraProxy:
public ParentSetterMixin<MoveableObject>,
public generic::Identifiable<CameraID>,
public Managed<CameraProxy> {
public:
CameraProxy(CameraID camera_id, Stage* stage);
~CameraProxy();
void follow(ActorID actor, CameraFollowMode mode, const kglt::Vec3& offset=kglt::Vec3(0, 5, 20), float lag_in_seconds=0);
void ask_owner_for_destruction();
void _update_following(double dt);
Frustum& frustum();
kmVec3 project_point(const RenderTarget &target, const Viewport& viewport, const kmVec3& point);
void set_orthographic_projection(double left, double right, double bottom, double top, double near=-1.0, double far=1.0);
unicode __unicode__() const {
if(has_name()) {
return name();
} else {
return _u("Camera {0}").format(this->id());
}
}
private:
ActorID following_actor_;
Vec3 following_offset_;
CameraFollowMode following_mode_;
float following_lag_ = 0.0;
void post_fixed_update(double dt);
CameraPtr camera();
};
class Camera:
public generic::Identifiable<CameraID>,
public Managed<Camera> {
public:
Camera(CameraID id, WindowBase* window);
kmVec3 project_point(const RenderTarget& target, const Viewport& viewport, const kmVec3& point);
const Mat4& view_matrix() { return view_matrix_; }
const Mat4& projection_matrix() const { return projection_matrix_; }
Frustum& frustum() { return frustum_; }
void set_perspective_projection(double fov, double aspect, double near=1.0, double far=1000.0f);
void set_orthographic_projection(double left, double right, double bottom, double top, double near=-1.0, double far=1.0);
double set_orthographic_projection_from_height(double desired_height_in_units, double ratio);
void set_transform(const kglt::Mat4& transform);
bool has_proxy() const { return bool(proxy_); }
void set_proxy(CameraProxy* proxy) { proxy_ = proxy; }
CameraProxy& proxy() {
assert(proxy_);
return *proxy_;
}
const Mat4& transform() const { return transform_; }
private:
WindowBase* window_;
CameraProxy* proxy_;
Frustum frustum_;
kglt::Mat4 transform_;
Mat4 view_matrix_;
Mat4 projection_matrix_;
void update_frustum();
};
}
#endif // CAMERA_H_INCLUDED
| [
"kazade@gmail.com"
] | kazade@gmail.com |
4c96e6c0267cc056d28f2440740b0e7f73807459 | 8048f1230657ae59685d469283fde91f9e841ec8 | /src/core/LogView.h | d2cee6297b42f2fedddd77ff4694ca3e34ed6999 | [
"Unlicense",
"MIT"
] | permissive | LUGGPublic/CG_Labs | be332f6268f331924c3e0a21e94dfa8adef1c709 | 9b9339ee987c4f034ab8a2b06a0820a65d042a2b | refs/heads/master | 2022-10-26T16:52:02.414354 | 2022-10-07T08:21:37 | 2022-10-07T08:21:37 | 67,523,404 | 20 | 58 | Unlicense | 2022-09-21T21:54:39 | 2016-09-06T15:56:32 | C++ | UTF-8 | C++ | false | false | 571 | h | // TODO: Timestamp
#pragma once
#include "Log.h"
#define BUFFER_WIDTH 512
#define BUFFER_ROWS 64
namespace Log {
class View {
public:
static void Init();
static void Destroy();
public:
static void Render();
private:
static void Feed(Log::Type type, const char *msg);
static void ClearLog();
private:
static char mOutput[BUFFER_ROWS * BUFFER_WIDTH * 2];
static char mBuffer[BUFFER_ROWS][BUFFER_WIDTH];
static int mLen[BUFFER_ROWS];
static Log::Type mType[BUFFER_ROWS];
static int mBufferPtr;
static bool mAutoScroll;
static bool mScrollToBottom;
};
}
| [
"pierre.moreau@cs.lth.se"
] | pierre.moreau@cs.lth.se |
547fc229c17b524f5bf43de480af5a3e5304b1d7 | b072860f8483ba0cef1105e0f9a17d8bbc0068e0 | /point2mesh/point2mesh.cpp | 0c771e9f5b80f631984074e761dd6baedf2f2b75 | [] | no_license | gispda/hybrid_pipeline | dd3ccd746a8a7afa5626b325f8618af4826f35ec | b8838bd7fc92c009f0dd3598ddb85cf79fd73877 | refs/heads/master | 2020-03-21T22:29:39.581333 | 2016-04-19T03:20:22 | 2016-04-19T03:20:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,005 | cpp | #include "mex.h"
#include <string.h>
#include <math.h>
void mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[]) {
double* vertex = mxGetPr(prhs[0]); //arg0: num_rows x num_cols x 3 double matrix
unsigned int num_cols = mxGetN(prhs[0])/3;
unsigned int num_rows = mxGetM(prhs[0]);
// double points[num_rows * num_cols][3];
// double faces[num_rows * num_cols * 2][3];
/* create the output matrix */
plhs[0] = mxCreateDoubleMatrix(3,num_rows * num_cols,mxREAL);
plhs[1] = mxCreateDoubleMatrix(3,num_rows * num_cols * 2 * 3,mxREAL);
/* get a pointer to the real data in the output matrix */
double* points = mxGetPr(plhs[0]);
double* faces = mxGetPr(plhs[1]);
int indexMatrix[num_rows][num_cols];
for (unsigned int x = 0; x < num_rows; ++x){
for (unsigned int y = 0; y <num_cols; ++y) indexMatrix[x][y] = 0;
}
double zThreshold = 0.1;
int curIndex = 1;
int curFaces = 0;
unsigned int layerSize = num_cols* num_rows;
for (unsigned int c = 0; c < num_cols-1; ++c) {
double* x00 = vertex+ num_rows*c; double* x01 = x00 + num_rows;
double* x10 = x00 + 1; double* x11 = x01 + 1;
for (unsigned int r = 0; r < num_rows-1; ++r) {
double* y00 = x00+layerSize; double* y01 = x01+layerSize;
double* y10 = x10+layerSize; double* y11 = x11+layerSize;
double* z00 = y00+layerSize; double* z10 = y10+layerSize;
double* z01 = y01+layerSize; double* z11 = y11+layerSize;
double* l00 = z00+layerSize; double* l10 = z10+layerSize;
double* l01 = z01+layerSize; double* l11 = z11+layerSize;
if (*z00 == 0.0){
if (*z01 != 0.0 && *z10 != 0.0 && *z11 != 0.0 && fabs(*z01-*z10)<zThreshold && fabs(*z11-*z10)<zThreshold && fabs(*z01-*z11)<zThreshold ){
int i01;
if (indexMatrix[r][c+1] != 0){
i01 = indexMatrix[r][c+1];
}else{
i01 = curIndex;
curIndex = curIndex +1;
indexMatrix[r][c+1] = i01;
*(points + (i01-1)*3) = *x01;
*(points + (i01-1)*3 + 1) = *y01;
*(points + (i01-1)*3 + 2) = *z01;
// points[i01 - 1][0] = *x01;
// points[i01 - 1][1] = *y01;
// points[i01 - 1][2] = *z01;
}
int i10;
if (indexMatrix[r+1][c] != 0){
i10 = indexMatrix[r+1][c];
}else{
i10 = curIndex;
curIndex = curIndex +1;
indexMatrix[r+1][c] = i10;
*(points + (i10-1)*3) = *x10;
*(points + (i10-1)*3 + 1) = *y10;
*(points + (i10-1)*3 + 2) = *z10;
// points[i10 - 1][0] = *x10;
// points[i10 - 1][1] = *y10;
// points[i10 - 1][2] = *z10;
}
int i11;
if (indexMatrix[r+1][c+1] != 0){
i11 = indexMatrix[r+1][c+1];
}else{
i11 = curIndex;
curIndex = curIndex +1;
indexMatrix[r+1][c+1] = i11;
*(points + (i11-1)*3) = *x11;
*(points + (i11-1)*3 + 1) = *y11;
*(points + (i11-1)*3 + 2) = *z11;
// points[i11 - 1][0] = *x11;
// points[i11 - 1][1] = *y11;
// points[i11 - 1][2] = *z11;
}
// faces[curFaces][0] = i01;
// faces[curFaces][1] = i10;
// faces[curFaces][2] = i01;
*(faces + curFaces*3) = i01;
*(faces + curFaces*3 + 1) = i10;
*(faces + curFaces*3 + 2) = i11;
curFaces = curFaces + 1;
}
}else{
if (*z11 == 0.0){
if (*z01!= 0.0 && *z10!= 0.0 && *z00!= 0.0 && fabs(*z00-*z01)<zThreshold && fabs(*z01-*z10)<zThreshold && fabs(*z10-*z00)<zThreshold ){
int i00;
if (indexMatrix[r][c] != 0){
i00 = indexMatrix[r][c];
}else{
i00 = curIndex;
curIndex = curIndex +1;
indexMatrix[r][c] = i00;
*(points + (i00-1)*3) = *x00;
*(points + (i00-1)*3 + 1) = *y00;
*(points + (i00-1)*3 + 2) = *z00;
// points[i00 - 1][0] = *x00;
// points[i00 - 1][1] = *y00;
// points[i00 - 1][2] = *z00;
}
int i01;
if (indexMatrix[r][c+1] != 0){
i01 = indexMatrix[r][c+1];
}else{
i01 = curIndex;
curIndex = curIndex +1;
indexMatrix[r][c+1] = i01;
*(points + (i01-1)*3) = *x01;
*(points + (i01-1)*3 + 1) = *y01;
*(points + (i01-1)*3 + 2) = *z01;
// points[i01 - 1][0] = *x01;
// points[i01 - 1][1] = *y01;
// points[i01 - 1][2] = *z01;
}
int i10;
if (indexMatrix[r+1][c] != 0){
i10 = indexMatrix[r+1][c];
}else{
i10 = curIndex;
curIndex = curIndex +1;
indexMatrix[r+1][c] = i10;
*(points + (i10-1)*3) = *x10;
*(points + (i10-1)*3 + 1) = *y10;
*(points + (i10-1)*3 + 2) = *z10;
// points[i10 - 1][0] = *x10;
// points[i10 - 1][1] = *y10;
// points[i10 - 1][2] = *z10;
}
// faces[curFaces][0] = i00;
// faces[curFaces][1] = i01;
// faces[curFaces][2] = i10;
*(faces + curFaces*3) = i00;
*(faces + curFaces*3 + 1) = i01;
*(faces + curFaces*3 + 2) = i10;
curFaces = curFaces +1;
}
}else{
if (*z01!=0.0 && fabs(*z00-*z01)<zThreshold && fabs(*z01-*z11)<zThreshold && fabs(*z11-*z00)<zThreshold ){
int i00;
if (indexMatrix[r][c] != 0){
i00 = indexMatrix[r][c];
}else{
i00 = curIndex;
curIndex = curIndex +1;
indexMatrix[r][c] = i00;
*(points + (i00-1)*3) = *x00;
*(points + (i00-1)*3 + 1) = *y00;
*(points + (i00-1)*3 + 2) = *z00;
// points[i00 - 1][0] = *x00;
// points[i00 - 1][1] = *y00;
// points[i00 - 1][2] = *z00;
}
int i01;
if (indexMatrix[r][c+1] != 0){
i01 = indexMatrix[r][c+1];
}else{
i01 = curIndex;
curIndex = curIndex +1;
indexMatrix[r][c+1] = i01;
*(points + (i01-1)*3) = *x01;
*(points + (i01-1)*3 + 1) = *y01;
*(points + (i01-1)*3 + 2) = *z01;
// points[i01 - 1][0] = *x01;
// points[i01 - 1][1] = *y01;
// points[i01 - 1][2] = *z01;
}
int i11;
if (indexMatrix[r+1][c+1] != 0){
i11 = indexMatrix[r+1][c+1];
}else{
i11 = curIndex;
curIndex = curIndex +1;
indexMatrix[r+1][c+1] = i11;
*(points + (i11-1)*3) = *x11;
*(points + (i11-1)*3 + 1) = *y11;
*(points + (i11-1)*3 + 2) = *z11;
// points[i11 - 1][0] = *x11;
// points[i11 - 1][1] = *y11;
// points[i11 - 1][2] = *z11;
}
// faces[curFaces][0] = i00;
// faces[curFaces][1] = i01;
// faces[curFaces][2] = i11;
*(faces + curFaces*3) = i00;
*(faces + curFaces*3 + 1) = i01;
*(faces + curFaces*3 + 2) = i11;
curFaces = curFaces +1;
}
if (*z10!=0.0 && fabs(*z00-*z11)<zThreshold && fabs(*z11-*z10)<zThreshold && fabs(*z10-*z00)<zThreshold ){
int i00;
if (indexMatrix[r][c] != 0){
i00 = indexMatrix[r][c];
}else{
i00 = curIndex;
curIndex = curIndex +1;
indexMatrix[r][c] = i00;
*(points + (i00-1)*3) = *x00;
*(points + (i00-1)*3 + 1) = *y00;
*(points + (i00-1)*3 + 2) = *z00;
// points[i00 - 1][0] = *x00;
// points[i00 - 1][1] = *y00;
// points[i00 - 1][2] = *z00;
}
int i10;
if (indexMatrix[r+1][c] != 0){
i10 = indexMatrix[r+1][c];
}else{
i10 = curIndex;
curIndex = curIndex +1;
indexMatrix[r+1][c] = i10;
*(points + (i10-1)*3) = *x10;
*(points + (i10-1)*3 + 1) = *y10;
*(points + (i10-1)*3 + 2) = *z10;
// points[i10 - 1][0] = *x10;
// points[i10 - 1][1] = *y10;
// points[i10 - 1][2] = *z10;
}
int i11;
if (indexMatrix[r+1][c+1] != 0){
i11 = indexMatrix[r+1][c+1];
}else{
i11 = curIndex;
curIndex = curIndex +1;
indexMatrix[r+1][c+1] = i11;
*(points + (i11-1)*3) = *x11;
*(points + (i11-1)*3 + 1) = *y11;
*(points + (i11-1)*3 + 2) = *z11;
// points[i11 - 1][0] = *x11;
// points[i11 - 1][1] = *y11;
// points[i11 - 1][2] = *z11;
}
// faces[curFaces][0] = i00;
// faces[curFaces][1] = i10;
// faces[curFaces][2] = i11;
*(faces + curFaces*3) = i00;
*(faces + curFaces*3 + 1) = i10;
*(faces + curFaces*3 + 2) = i11;
curFaces = curFaces +1;
}
}
}
// update
x00 = x10++;
x01 = x11++;
}
}
} | [
"victorbai@Victors-MacBook-Pro.local"
] | victorbai@Victors-MacBook-Pro.local |
787319393d1a0e41ed8bfea2dcbdb2177a1318d9 | 3b68f6bf248c3aaa7e8a7bce6762ac397c189f38 | /server/core/src/catalog_utilities.cpp | 181b6379127246e40737dfa8e85cb9aceed30e4a | [
"BSD-3-Clause"
] | permissive | qitsweauca/irods | 8fd214063ccfed24659925e7fb6b0c4df93fa94f | a4ea27a5abd78c320f3af7e7624b8f9d02d08167 | refs/heads/master | 2023-04-21T06:42:24.692383 | 2021-05-12T20:05:39 | 2021-05-17T03:04:53 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,331 | cpp | #include "catalog_utilities.hpp"
#include "rcConnect.h"
#include "rodsConnect.h"
#include "miscServerFunct.hpp"
#include "irods_logger.hpp"
#include "irods_rs_comm_query.hpp"
namespace
{
using log = irods::experimental::log;
auto connected_to_catalog_provider(RsComm& _comm, const rodsServerHost& _host) -> bool
{
return LOCAL_HOST == _host.localFlag;
} // connected_to_catalog_provider
} // anonymous namespace
namespace irods::experimental::catalog
{
auto bind_string_to_statement(bind_parameters& _bp) -> void
{
const std::string& v = _bp.json_input.at(_bp.column_name.data()).get<std::string>();
_bp.bind_values.push_back(v);
const std::string& value = std::get<std::string>(_bp.bind_values.back());
log::database::trace("[{}:{}] - binding [{}] to [{}] at [{}]", __FUNCTION__, __LINE__, _bp.column_name, value, _bp.index);
_bp.statement.bind(_bp.index, value.c_str());
} // bind_string_to_statement
auto bind_bigint_to_statement(bind_parameters& _bp) -> void
{
const std::uint64_t v = std::stoul(_bp.json_input.at(_bp.column_name.data()).get<std::string>());
_bp.bind_values.push_back(v);
const std::uint64_t& value = std::get<std::uint64_t>(_bp.bind_values.back());
log::database::trace("[{}:{}] - binding [{}] to [{}] at [{}]", __FUNCTION__, __LINE__, _bp.column_name, value, _bp.index);
_bp.statement.bind(_bp.index, &value);
} // bind_bigint_to_statement
auto bind_integer_to_statement(bind_parameters& _bp) -> void
{
const int v = std::stoi(_bp.json_input.at(_bp.column_name.data()).get<std::string>());
_bp.bind_values.push_back(v);
const int& value = std::get<int>(_bp.bind_values.back());
log::database::trace("[{}:{}] - binding [{}] to [{}] at [{}]", __FUNCTION__, __LINE__, _bp.column_name, value, _bp.index);
_bp.statement.bind(_bp.index, &value);
} // bind_integer_to_statement
auto user_has_permission_to_modify_entity(RsComm& _comm,
nanodbc::connection& _db_conn,
int _object_id,
const entity_type _entity_type) -> bool
{
using log = irods::experimental::log;
switch (_entity_type) {
case entity_type::data_object:
[[fallthrough]];
case entity_type::collection:
{
const auto query = fmt::format("select t.token_id from R_TOKN_MAIN t"
" inner join R_OBJT_ACCESS a on t.token_id = a.access_type_id "
"where"
" a.user_id = (select user_id from R_USER_MAIN where user_name = '{}') and"
" a.object_id = '{}'", _comm.clientUser.userName, _object_id);
if (auto row = execute(_db_conn, query); row.next()) {
return static_cast<access_type>(row.get<int>(0)) >= access_type::modify_object;
}
break;
}
case entity_type::user:
[[fallthrough]];
case entity_type::resource:
return irods::is_privileged_client(_comm);
default:
log::database::error("Invalid entity type [entity_type => {}]", _entity_type);
break;
}
return false;
} // user_has_permission_to_modify_entity
auto throw_if_catalog_provider_service_role_is_invalid() -> void
{
std::string role;
if (const auto err = get_catalog_service_role(role); !err.ok()) {
THROW(err.code(), "Failed to retrieve service role");
}
if (irods::CFG_SERVICE_ROLE_CONSUMER == role) {
THROW(SYS_NO_ICAT_SERVER_ERR, "Remote catalog provider not found");
}
if (irods::CFG_SERVICE_ROLE_PROVIDER != role) {
THROW(SYS_SERVICE_ROLE_NOT_SUPPORTED, fmt::format("Role not supported [role => {}]", role));
}
} // throw_if_service_role_is_invalid
auto get_catalog_provider_host() -> rodsServerHost
{
rodsServerHost* host{};
if (const int status = getRcatHost(MASTER_RCAT, nullptr, &host); status < 0 || !host) {
THROW(status, "failed getting catalog provider host");
}
return *host;
} // get_catalog_provider_host
auto connected_to_catalog_provider(RsComm& _comm) -> bool
{
return ::connected_to_catalog_provider(_comm, get_catalog_provider_host());
} // connected_to_catalog_provider
auto redirect_to_catalog_provider(RsComm& _comm) -> rodsServerHost
{
rodsServerHost host = get_catalog_provider_host();
if (::connected_to_catalog_provider(_comm, host)) {
return host;
}
if (int ec = svrToSvrConnect(&_comm, &host); ec < 0) {
if (REMOTE_ICAT == host.rcatEnabled) {
ec = convZoneSockError(ec);
}
THROW(ec, fmt::format("svrToSvrConnect to {} failed", host.hostName->name));
}
return host;
} // redirect_to_catalog_provider
} // namespace irods::experimental::catalog
| [
"terrellrussell@gmail.com"
] | terrellrussell@gmail.com |
aa6d1bfdefd7f2f7654085b7f6d8d7224d130a88 | f9653d9b17c41644df3685e47759c3e88bfc8750 | /v1/AI Sandbox/Config.h | 8c0af5cee6ef1fe9c838a565dbfdfdfd3377f46c | [
"MIT"
] | permissive | willihay/ai-sandbox | 81d603715e1258825828311a03ddd621d0695faa | b3b20d2529dc70aa1c5dbc02a3643502f191833f | refs/heads/master | 2020-04-04T21:50:32.558135 | 2018-12-02T01:31:07 | 2018-12-02T01:31:07 | 156,300,190 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 890 | h | #pragma once
namespace Config
{
bool LoadConfigFile();
// General
extern int ConfigVersion;
// Behavior modules
extern char BehaviorModule_DefaultPriorityLevel;
extern float Follow_DefaultDistance;
extern char PlayerInput_DefaultPriorityLevel;
// Game objects
extern float GameObject_DefaultCoefficientFriction;
extern float GameObject_DefaultCoefficientRestitution;
extern float GameObject_DefaultMass; // kilograms
extern float GameObject_DefaultMaxAcceleration; // meters per second per second
extern float GameObject_DefaultMaxAngularVelocity; // radians per second
extern float GameObject_DefaultMaxSpeed; // meters per second
extern const wchar_t* GameObject_DefaultTextureFile;
// World attributes
extern float World_FrictionCoefficient;
extern float World_Gravity; // meters per second per second
extern float World_ScaleMetersPerPixel; // world scale for displaying sprites
}
| [
"willihay@bensam.org"
] | willihay@bensam.org |
77f988bb8a9397d6457013f23a6a8ab835e16095 | 9029dc0601cf34f98b8bf797f0b6145cf1264ca3 | /src/lin3d/aabb.h | 2bda26536f522b4afe96cd547af58614a5f3d5c6 | [] | no_license | lsccsl/lin3d | c38bd67de464e81da73161f02f6df9602a632ac5 | 89f98c4c7a47f6cec227ccb3fa63d6460f6b35e9 | refs/heads/master | 2023-04-22T01:12:11.059651 | 2021-05-12T01:56:14 | 2021-05-12T01:56:14 | 346,627,501 | 3 | 0 | null | null | null | null | GB18030 | C++ | false | false | 7,071 | h | /**
* @file aabb.h
*
* @author lin shao chuan (email:lsccsl@tom.com)
*
* @brief if it works, it was written by lin shao chuan, if not, i don't know who wrote it
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation. lin shao chuan makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
* see the GNU General Public License for more detail.
*/
#ifndef __L3ENG_AABB_H__
#define __L3ENG_AABB_H__
#include "l3_vector3.h"
#include "matrix4.h"
namespace l3eng{
class aabbox
{
public:
enum AABB_EXTENT
{
AABB_NULL,
AABB_FINITE,
AABB_INFINITE,
};
/*
1-----2
/| /|
/ | / |
5-----4 |
| 0--|--3
| / | /
|/ |/
6-----7
*/
enum AABB_CORNER
{
AABB_FAR_LEFT_BOTTOM = 0,
AABB_FAR_LEFT_TOP = 1,
AABB_FAR_RIGHT_TOP = 2,
AABB_FAR_RIGHT_BOTTOM = 3,
AABB_NEAR_RIGHT_TOP = 4,
AABB_NEAR_LEFT_TOP = 5,
AABB_NEAR_LEFT_BOTTOM = 6,
AABB_NEAR_RIGHT_BOTTOMN = 7,
AABB_MAX,
};
public:
inline aabbox():extent_(AABB_NULL){}
inline aabbox(const vector3& v1, const vector3 v2):extent_(AABB_NULL){
this->merge(v1);
this->merge(v2);
}
inline aabbox(l3_f32 bound_min_x, l3_f32 bound_min_y, l3_f32 bound_min_z,
l3_f32 bound_max_x, l3_f32 bound_max_y, l3_f32 bound_max_z):extent_(AABB_FINITE)
{
this->min_.x(bound_min_x);
this->min_.y(bound_min_y);
this->min_.z(bound_min_z);
this->max_.x(bound_max_x);
this->max_.y(bound_max_y);
this->max_.z(bound_max_z);
}
inline void merge(const l3_f32 x,
const l3_f32 y,
const l3_f32 z)
{
switch(this->extent_)
{
case AABB_NULL:
{
this->min_.x(x);
this->min_.y(y);
this->min_.z(z);
this->max_.x(x);
this->max_.y(y);
this->max_.z(z);
this->need_rel_cal_corner_ = 1;
this->extent_ = AABB_FINITE;
}
break;
case AABB_FINITE:
{
if(x > this->max_.x())
this->max_.x(x);
if(y > this->max_.y())
this->max_.y(y);
if(z > this->max_.z())
this->max_.z(z);
if(x < this->min_.x())
this->min_.x(x);
if(y < this->min_.y())
this->min_.y(y);
if(z < this->min_.z())
this->min_.z(z);
this->need_rel_cal_corner_ = 1;
}
break;
case AABB_INFINITE:
break;
}
}
inline void merge(const vector3& v)
{
switch(this->extent_)
{
case AABB_NULL:
{
this->min_ = v;
this->max_ = v;
this->need_rel_cal_corner_ = 1;
this->extent_ = AABB_FINITE;
}
break;
case AABB_FINITE:
{
if(v.x() > this->max_.x())
this->max_.x(v.x());
if(v.y() > this->max_.y())
this->max_.y(v.y());
if(v.z() > this->max_.z())
this->max_.z(v.z());
if(v.x() < this->min_.x())
this->min_.x(v.x());
if(v.y() < this->min_.y())
this->min_.y(v.y());
if(v.z() < this->min_.z())
this->min_.z(v.z());
this->need_rel_cal_corner_ = 1;
}
break;
case AABB_INFINITE:
break;
}
}
inline const vector3 * get_corners(){
if(!this->need_rel_cal_corner_)
return this->corner_;
this->corner_[AABB_FAR_LEFT_BOTTOM].assign(this->min_);
this->corner_[AABB_FAR_LEFT_TOP].xyz(this->min_.x(), this->max_.y(), this->min_.z());
this->corner_[AABB_FAR_RIGHT_TOP].xyz(this->max_.x(), this->max_.y(), this->min_.z());
this->corner_[AABB_FAR_RIGHT_BOTTOM].xyz(this->max_.x(), this->min_.y(), this->min_.z());
this->corner_[AABB_NEAR_RIGHT_TOP].assign(this->max_);
this->corner_[AABB_NEAR_LEFT_TOP].xyz(this->min_.x(), this->max_.y(), this->max_.z());
this->corner_[AABB_NEAR_LEFT_BOTTOM].xyz(this->min_.x(), this->min_.y(), this->max_.z());
this->corner_[AABB_NEAR_RIGHT_BOTTOMN].xyz(this->max_.x(), this->min_.y(), this->max_.z());
this->need_rel_cal_corner_ = 0;
}
/* @brief 获取aab盒的中心 */
inline l3_int32 get_center(vector3& vc)const
{
switch(this->extent_)
{
case AABB_NULL:
case AABB_INFINITE:
return -1;
}
vc.x((this->max_.x() + this->min_.x()) * 0.5f);
vc.y((this->max_.y() + this->min_.y()) * 0.5f);
vc.z((this->max_.z() + this->min_.z()) * 0.5f);
return 0;
}
/* @brief 获取aab盒三个轴的尺寸的一半 */
inline l3_int32 get_half(vector3& vh)const
{
switch(this->extent_)
{
case AABB_NULL:
vh.x(0);
vh.y(0);
vh.z(0);
break;
case AABB_INFINITE:
return -1;
break;
}
vh.x((this->max_.x() - this->min_.x()) * 0.5f);
vh.y((this->max_.y() - this->min_.y()) * 0.5f);
vh.z((this->max_.z() - this->min_.z()) * 0.5f);
return 0;
}
inline l3_int32 get_size(vector3& v_sz)const
{
switch(this->extent_)
{
case AABB_NULL:
v_sz.x(0);
v_sz.y(0);
v_sz.z(0);
break;
case AABB_INFINITE:
return -1;
break;
}
v_sz.x(this->max_.x() - this->min_.x());
v_sz.y(this->max_.y() - this->min_.y());
v_sz.z(this->max_.z() - this->min_.z());
return 0;
}
/* @brief 旋转平旋包围盒,得到新的包围盒 */
void transform(const matrix4& m, aabbox& box)const;
inline const AABB_EXTENT extent()const{ return this->extent_; }
inline void extent(AABB_EXTENT e){ this->extent_ = e; }
/* @brief 设置min max xyz */
inline void min_x(l3_f32 f){ this->min_.x(f); }
inline void min_y(l3_f32 f){ this->min_.y(f); }
inline void min_z(l3_f32 f){ this->min_.z(f); }
inline void max_x(l3_f32 f){ this->max_.x(f); }
inline void max_y(l3_f32 f){ this->max_.y(f); }
inline void max_z(l3_f32 f){ this->max_.z(f); }
inline l3_f32 min_x(){ return this->min_.x(); }
inline l3_f32 min_y(){ return this->min_.y(); }
inline l3_f32 min_z(){ return this->min_.z(); }
inline l3_f32 max_x(){ return this->max_.x(); }
inline l3_f32 max_y(){ return this->max_.y(); }
inline l3_f32 max_z(){ return this->max_.z(); }
inline const vector3& get_min()const{ return this->min_; }
inline const vector3& get_max()const{ return this->max_; }
aabbox& operator = (const aabbox& bbox)
{
this->min_ = bbox.min_;
this->max_ = bbox.max_;
this->extent_ = bbox.extent_;
this->need_rel_cal_corner_ = L3_TRUE;
return *this;
}
inline l3_bool intersects(const aabbox& b2) const
{
if((AABB_NULL == this->extent_) || (AABB_NULL == b2.extent_))
return L3_FALSE;
if((AABB_INFINITE == this->extent_) || (AABB_INFINITE == b2.extent_))
return L3_FALSE;//应该要返回true
if(this->max_.x() < b2.min_.x())
return L3_FALSE;
if(this->max_.y() < b2.min_.y())
return L3_FALSE;
if(this->max_.z() < b2.min_.z())
return L3_FALSE;
if(this->min_.x() > b2.max_.x())
return L3_FALSE;
if(this->min_.y() > b2.max_.y())
return L3_FALSE;
if(this->min_.z() > b2.max_.z())
return L3_FALSE;
return L3_TRUE;
}
private:
vector3 min_;
vector3 max_;
vector3 corner_[AABB_MAX];
l3_bool need_rel_cal_corner_;
AABB_EXTENT extent_;
};
}
#endif
| [
"shaochuanlin@skyunion.net"
] | shaochuanlin@skyunion.net |
9c31e314892d9ee7805cb00ae069702f57188d04 | 6731b328ce4a49867a5287c44816a9c1cefeae01 | /matrix.hpp | 28e47b81b69c1128818261200a09979729313ad4 | [] | no_license | raul-cayo/Boost_uBLAS_GSoC18 | 2898f079a393bc3ffc83c0f556f43563ea6609a5 | e83e04911f1eebfab19fb5d9f7dd4236ab7d8cf0 | refs/heads/master | 2021-04-18T22:18:17.201524 | 2018-03-25T15:59:40 | 2018-03-25T15:59:40 | 126,711,235 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,373 | hpp | #ifndef MATRIX_HPP_INCLUDED
#define MATRIX_HPP_INCLUDED
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
/// -------- EXCEPTIONS --------
class MatrixException : public exception {
private:
string msg;
public:
explicit MatrixException(const char* message) : msg(message) {}
explicit MatrixException(const string& message): msg(message) {}
virtual ~MatrixException() throw() {}
virtual const char* what() const throw() {
return msg.c_str();
}
};
/// -------- MATRIX PROTOTYPE --------
template <class T>
class Matrix {
private:
int rows;
int columns;
vector <vector <T>> data;
void setToZero();
void copyMatrix(const Matrix<T>&);
public:
/* Set of constructors, that allows the Matrix to be
initialized either by default, by row and column size,
or copying an existing Matrix*/
Matrix();
Matrix(const int&, const int&);
Matrix(const Matrix<T>&);
int getRows();
int getColumns();
/* Method overloading the operator [] that allows the values
of the Matrix to be accessed by [row][column] coordinates*/
vector<T>& operator [] (size_t);
/* Couple of methods that increase or decrease all values in a
Matrix by the same constant. These methods use Generic Lambdas. */
void increaseAllBy(const T&);
void decreaseAllBy(const T&);
/* Set of methods overloading common math operators to do
Matrix operations. If the operation is not possible due to the
size of the Matrices, the method will throw a MatrixException*/
Matrix<T> operator + (const Matrix<T>&);
Matrix<T> operator - (const Matrix<T>&);
Matrix<T> operator * (const Matrix<T>&);
Matrix<T> operator * (const T&);
Matrix<T>& operator = (const Matrix<T>&);
void operator += (const Matrix<T>&);
void operator -= (const Matrix<T>&);
void operator *= (const Matrix<T>&);
void operator *= (const T&);
/* Method that returns a string of the Matrix
to print it out in a visual representation.*/
string toString();
};
/// -------- MATRIX IMPLEMENTATION --------
/// Private Methods
template <class T>
void Matrix<T>::setToZero(){
for_each(data.begin(), data.end(), [](vector<T>& vec){
for_each(vec.begin(), vec.end(), [](T& elem){
elem = 0;
});
});
}
template <class T>
void Matrix<T>::copyMatrix(const Matrix<T>& mtx){
rows = mtx.rows;
columns = mtx.columns;
data.resize(rows, vector<T>(columns));
for(int i(0); i < rows; i++){
for(int j(0); j < columns; j++){
data[i][j] = mtx.data[i][j];
}
}
}
/// Public Methods
template <class T>
Matrix<T>::Matrix() : rows(3), columns(3) {
data.resize(rows, vector<T>(columns));
setToZero();
}
template <class T>
Matrix<T>::Matrix(const int& r, const int& c) {
rows = r;
columns = c;
data.resize(rows, vector<T>(columns));
setToZero();
}
template <class T>
Matrix<T>::Matrix(const Matrix<T>& mtx) {
copyMatrix(mtx);
}
template <class T>
int Matrix<T>::getRows() {
return rows;
}
template <class T>
int Matrix<T>::getColumns() {
return columns;
}
template <class T>
vector<T>& Matrix<T>::operator [] (size_t i) {
return data[i];
}
template <class T>
void Matrix<T>::increaseAllBy(const T& num) {
for_each(data.begin(), data.end(), [n = num](vector<T>& vec){
for_each(vec.begin(), vec.end(), [&](T& elem){
elem += n;
});
});
}
template <class T>
void Matrix<T>::decreaseAllBy(const T& num) {
for_each(data.begin(), data.end(), [n = num](vector<T>& vec){
for_each(vec.begin(), vec.end(), [&](T& elem){
elem -= n;
});
});
}
template <class T>
Matrix<T> Matrix<T>::operator + (const Matrix<T>& rhs) {
if(rows != rhs.rows || columns != rhs.columns){
throw MatrixException("operator +: The matrices are not the same size.");
}
Matrix<T> result(rows, columns);
for(int i(0); i < rows; i++){
for(int j(0); j < columns; j++){
result.data[i][j] = data[i][j] + rhs.data[i][j];
}
}
return result;
}
template <class T>
Matrix<T> Matrix<T>::operator - (const Matrix<T>& rhs) {
if(rows != rhs.rows || columns != rhs.columns){
throw MatrixException("operator -: The matrices are not the same size.");
}
Matrix<T> result(rows, columns);
for(int i(0); i < rows; i++){
for(int j(0); j < columns; j++){
result.data[i][j] = data[i][j] - rhs.data[i][j];
}
}
return result;
}
template <class T>
Matrix<T> Matrix<T>::operator * (const Matrix<T>& rhs) {
if(columns != rhs.rows){
throw MatrixException("operator *: The matrices are not the required row and column size to multiply each other.");
}
Matrix<T> result(rows, rhs.columns);
for(int i(0); i < rows; i++){
for(int j(0); j < columns; j++){
for(int k(0); k < columns; k++){
result[i][j] += data[i][k] * rhs.data[k][j];
}
}
}
return result;
}
template <class T>
Matrix<T> Matrix<T>::operator * (const T& num) {
Matrix<T> result(rows, columns);
for(int i(0); i < rows; i++){
for(int j(0); j < columns; j++){
result.data[i][j] = data[i][j] * num;
}
}
return result;
}
template <class T>
Matrix<T>& Matrix<T>::operator = (const Matrix<T>& rhs){
copyMatrix(rhs);
return *this;
}
template <class T>
void Matrix<T>::operator += (const Matrix<T>& rhs) {
*this = *this + rhs;
}
template <class T>
void Matrix<T>::operator -= (const Matrix<T>& rhs) {
*this = *this - rhs;
}
template <class T>
void Matrix<T>::operator *= (const Matrix<T>& rhs) {
*this = *this * rhs;
}
template <class T>
void Matrix<T>::operator *= (const T& num) {
*this = *this * num;
}
template <class T>
string Matrix<T>::toString(){
string result;
for(int i(0); i < columns; i++){
result += " _______";
}
for(int i(0); i < rows; i++){
result += "\n| ";
for(int j(0); j <columns; j++){
result += to_string(data[i][j]) + "\t| ";
}
result += "\n";
for(int j(0); j < columns; j++){
result += " _______";
}
}
return result;
}
#endif // MATRIX_HPP_INCLUDED
| [
"raul.sanchez.cayo@gmail.com"
] | raul.sanchez.cayo@gmail.com |
458592930436c8ed381984f9e909bc74043c52bd | 0c3b5fab13497d38bcb2c516c4692cb212b133f6 | /polygon.cpp | f39fbb57947d119e50015ebd6fc27047f9203c01 | [] | no_license | Liangsanzhu/NJU2019cv | 58ce0b38a0d7a5daa55d31ba8cf4c1d56f2963e9 | 18382c8afd21a61576f1130d92c739a06489b641 | refs/heads/master | 2022-03-31T18:55:30.116641 | 2020-02-05T16:33:36 | 2020-02-05T16:33:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,706 | cpp | #include "polygon.h"
#include"line.h"
Polygon::Polygon(int ID_NUM,QString a, int*cf_temp,int LineWidth_temp,QPixmap*pix_temp,int**Gra,int l,int w)
{
id=ID_NUM;
algorithm=a;
cf[0]=cf_temp[0];
cf[1]=cf_temp[1];
cf[2]=cf_temp[2];
cf[3]=cf_temp[3];
pix=pix_temp;
pnts=NULL;
LineWidth=LineWidth_temp;
gra=Gra;
Length=l;
Width=w;
alive=0;
}
void Polygon::draw(QPixmap*pix_temp)
{
pix=pix_temp;
pnts=gra;
alive=1;
for(int i=0;i<points.size()-1;i++)
{
Line l1(id,points[i].x(),points[i].y(),points[i+1].x(),points[i+1].y(),algorithm,cf,LineWidth,pix,pnts,Length,Width);
}
}
void Polygon::draw()
{
for(int i=0;i<points.size()-1;i++)
{
Line l1(id,points[i].x(),points[i].y(),points[i+1].x(),points[i+1].y(),algorithm,cf,LineWidth,pix,pnts,Length,Width);
}
}
void Polygon::translate(int dx, int dy)
{
for (int i = 0;i < points.size();i++)
{
points[i].setX(points[i].x()+dx);
points[i].setY(points[i].y()+dy);
}
}
int Polygon::add_point(int x,int y)
{
if(!(x>=0&&x<Length&&y>=0&&y<Width))
{
return -1;
}
if(points.size()==0)
{
points.push_back(QPoint(x,y));
}else
{
if(points.size()>1)
{
int a=x-(int)points[0].x();
int b=y-(int)points[0].y();
if((a*a+b*b)<=100)
{
points.push_back(QPoint((int)points[0].x(),(int)points[0].y()));
int n=points.size();
draw();
return 1;
}
else
{
points.push_back(QPoint(x,y));
}
}else
{
points.push_back(QPoint(x,y));
}
draw();
}
return 0;
}
void Polygon::scale_one(double X, double Y, float r,int&x,int&y)
{
x = (double)x*r + X * (1 - r)+0.5;
y = (double)y*r + Y * (1 - r)+0.5;
}
void Polygon::scale(int X, int Y, float r)
{
for (int i = 0;i < points.size();i++)
{
scale_one(X, Y, r, points[i].rx(), points[i].ry());
}
}
void Polygon::rotate_one(double X, double Y, double R, int&x, int&y)
{
double cos_r = cos(R*pi_c);
double sin_r = sin(R*pi_c);
int x1 = x;
int y1 = y;
x = X + ((double)x1 - X)*cos_r - ((double)y1 - Y)*sin_r+0.5;
y = Y + ((double)x1 - X)*sin_r + ((double)y1 - Y)*cos_r+0.5;
}
void Polygon::rotate(int X, int Y, double R)
{
for (int i = 0;i < points.size();i++)
{
rotate_one(X, Y, R, points[i].rx(), points[i].ry());
}
}
| [
"noreply@github.com"
] | noreply@github.com |
09d3a1a34076a1042a025877e5a792daa47ca6e7 | 20a0e47f59f2e0fea922495179dbd418b32fe014 | /nestedtensor/csrc/creation.h | 26cdd00adea5a744414d2b8bf44344a7fb571cb2 | [
"BSD-3-Clause"
] | permissive | cpuhrsch/nestedtensor | 7b65c2538c4904d6488f0096e77f73860765977e | a97e1f6fc1650372bcb149d1fc243dde87514dcf | refs/heads/master | 2022-06-07T19:44:09.117107 | 2022-03-15T16:35:23 | 2022-03-15T16:35:23 | 205,246,373 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 451 | h | #pragma once
#include <nestedtensor/csrc/nested_tensor_impl.h>
#include <nestedtensor/csrc/py_utils.h>
namespace torch {
namespace nested_tensor {
NestedNode<py::object> py_to_nested_node(py::object&& py_obj);
at::Tensor nested_tensor_impl(
pybind11::sequence list,
pybind11::object dtype,
pybind11::object device,
bool requires_grad,
bool pin_memory,
bool channels_last);
} // namespace nested_tensor
} // namespace torch
| [
"noreply@github.com"
] | noreply@github.com |
445764d90fa5bfcc3346b934b8856357b8c87aa7 | c844665c3a4ae3d3ce737d16c7974f729497d0ee | /include/Scripting/CastScriptNode.h | 898e6024defca093481a87a64238d1dea6c34354 | [
"BSD-2-Clause"
] | permissive | forkrp/Enjon | de642b38ab6c9cac3d69bf7a624f3588a24b8c9a | 405733f1b8d05c65bc6b4f4c779d3c6845a8c12b | refs/heads/master | 2022-03-14T00:34:50.930488 | 2019-11-18T15:58:23 | 2019-11-18T15:58:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 685 | h | #ifndef ENJON_CAST_SCRIPT_NODE_H
#define ENJON_CAST_SCRIPT_NODE_H
#include <Scripting/ScriptNode.h>
namespace Enjon { namespace Scripting {
template <typename T, typename K>
struct CastNode : public ScriptNode<CastNode<T, K>, K>
{
CastNode()
{
Input = nullptr;
}
void Execute()
{
static_cast<T*>(this)->Execute();
}
void FillData(ScriptNodeBase* A, K* Data)
{
if (A != nullptr)
{
A->Execute();
GetValue<K>(A, Data);
}
}
ScriptNodeBase* Input;
};
struct CastToIntNode : public CastNode<CastToIntNode, Enjon::int32>
{
CastToIntNode()
{
this->Data = 1;
}
void Execute()
{
FillData(Input, &Data);
}
};
}}
#endif | [
"mrfrenik@gmail.com"
] | mrfrenik@gmail.com |
78b54f5af61575b9e48a11643741234a50cf7d17 | 4c48058a86b379721c66aaec7bc3193a35ea6457 | /GIGAengine/video.cpp | 1d473d2465f39b057ff32b1fa9ed743c594379e7 | [] | no_license | msqrt/GIGAengine | 59e6a7f90859c73b184b5f7c7e56518c583f1cc9 | 9038e85b6d48803fefa60153e7ad353fdfc21af4 | refs/heads/master | 2020-04-10T09:25:43.725753 | 2013-10-07T16:06:21 | 2013-10-07T16:06:21 | 10,426,370 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,746 | cpp |
#include "main.h"
#include <comdef.h>
HRESULT textureGrabber::CheckMediaType(const CMediaType *mediaType) {
width = 0;
if(*mediaType->Type() != MEDIATYPE_Video || *mediaType->Subtype() != MEDIASUBTYPE_RGB24 || !mediaType->IsValid())
return S_FALSE;
if(((VIDEOINFOHEADER*)mediaType->pbFormat)->bmiHeader.biCompression!=BI_RGB||
((VIDEOINFOHEADER*)mediaType->pbFormat)->bmiHeader.biBitCount!=24)
return S_FALSE;
if(mediaType->formattype==FORMAT_VideoInfo) {
width = ((VIDEOINFOHEADER*)mediaType->pbFormat)->bmiHeader.biWidth;
height = ((VIDEOINFOHEADER*)mediaType->pbFormat)->bmiHeader.biHeight;
}
if(mediaType->formattype==FORMAT_MPEG2Video) {
width = ((MPEG1VIDEOINFO*)mediaType->pbFormat)->hdr.bmiHeader.biWidth;
height = ((MPEG1VIDEOINFO*)mediaType->pbFormat)->hdr.bmiHeader.biHeight;
}
if(!width)
return S_FALSE;
printf("Video resolution: %dx%d\n",width,height);
return S_OK;
}
HRESULT textureGrabber::DoRenderSample(IMediaSample * mediaSample) {
if(sampleSize != mediaSample->GetActualDataLength()) {
delete [] sampleData;
sampleSize = mediaSample->GetActualDataLength();
sampleData = new unsigned char[mediaSample->GetActualDataLength()];
}
unsigned char * temporaryData;
mediaSample->GetPointer(&temporaryData);
memcpy(sampleData, temporaryData, sampleSize);
refreshed = 1;
return S_OK;
}
textureGrabber::textureGrabber(LPUNKNOWN lpUnknown, HRESULT *phResult) : CBaseVideoRenderer(__uuidof(peisikVideoSystem), NAME("peisikVideoSystem"), lpUnknown, phResult) {
refreshed = 0;
sampleData = 0;
sampleSize = 0;
Ready();
}
textureGrabber::~textureGrabber() {
delete [] sampleData;
}
int textureGrabber::setTexture(texture * texture) {
video = texture;
return 0;
}
video::video(std::wstring path): texture(1,1,false,GL_LINEAR,GL_REPEAT), rendered(false), isPlaying(false) {
printf("Opening video \"%ls\"\n", path.c_str());
IGraphBuilder * graph;
IBaseFilter * base;
__int64 clipLength;
CoInitialize(0);
CoCreateInstance(CLSID_FilterGraph, 0, CLSCTX_INPROC, IID_IGraphBuilder, (void**)&graph);
HRESULT hr = S_OK;
graph->QueryInterface(IID_IMediaControl, (void**)&mediaControl);
graph->QueryInterface(IID_IMediaSeeking, (void**)&mediaSeeking);
grabber = new textureGrabber(0, &hr);
grabber->AddRef();
grabber->QueryInterface(IID_IBaseFilter, (void**)&base);
graph->AddFilter(base, L"peisikVideoSystem OpenGL texture renderer");
hr = graph->RenderFile(path.c_str(), 0);
grabber->setTexture(&texture);
graph->Release();
base->Release();
if(SUCCEEDED(hr) && grabber->width)
{
printf("Video succesfully rendered\n");
mediaSeeking->SetTimeFormat(&TIME_FORMAT_MEDIA_TIME);
mediaSeeking->GetDuration(&clipLength);
length = (long double)(clipLength)/(long double)10000000.0;
__int64 position = 0;
mediaSeeking->SetPositions(&position, AM_SEEKING_AbsolutePositioning, &position, AM_SEEKING_NoPositioning);
rendered = true;
}
else
printf("Couldn't find a working video graph\n");
}
video::~video() {
mediaControl->Release();
mediaSeeking->Release();
grabber->Release();
CoUninitialize();
}
int video::isValid() {
return rendered;
}
int video::play() {
if(!isValid())
return 1;
mediaControl->Run();
isPlaying = true;
return 0;
}
int video::pause() {
if(!isValid())
return 1;
mediaControl->Stop();
isPlaying = false;
return 0;
}
int video::toggle() {
if(!isValid())
return 1;
isPlaying = !isPlaying;
if(isPlaying)
play();
else
pause();
return 0;
}
int video::seek(long double position) {
if(!isValid())
return 1;
if(position>length)
position = length;
if(position<.0)
position = .0;
__int64 seekPosition = __int64(10000000.0*position);
mediaControl->Stop();
mediaSeeking->SetPositions(&seekPosition, AM_SEEKING_AbsolutePositioning, &seekPosition, AM_SEEKING_NoPositioning);
if(isPlaying)
mediaControl->Run();
return 0;
}
long double video::getTime() {
if(!isValid())
return 1;
__int64 position;
mediaSeeking->GetCurrentPosition(&position);
return (long double)(position)/(long double)10000000.0;
}
long double video::getDuration() {
if(!isValid())
return .0;
else
return length;
}
int video::hasNewFrame() {
if(!isValid())
return 0;
else
return grabber->refreshed;
}
int video::updateFrame(int slot) {
if(!isValid())
return 1;
if(grabber->sampleSize) {
if(grabber->width!=grabber->video->width||grabber->height!=grabber->video->height)
grabber->video->resize(grabber->width, grabber->height);
texture.bind(slot);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB8, texture.width, texture.height, 0, GL_BGR, GL_UNSIGNED_BYTE, grabber->sampleData);
}
grabber->refreshed = 0;
return 0;
}
int video::playing() {
if(!isValid())
return 0;
else
return isPlaying;
} | [
"pauli.kemppinen@hotmail.com"
] | pauli.kemppinen@hotmail.com |
5fdde801b6cf5c0fd9217a1b84c665eb1ae2cccc | 761f82a78bb65f93580b0cf2f30ad8b06462b65c | /BinarySearch.cpp | 3873403753eda445c247bca2d06c1709df9dc5ba | [] | no_license | Paritosh456Pancholi/Data-Structure-and-Algorithm | 1128ebb195e31e520451fdf723a98bd8159c4eed | 1e4dfcece04bf33bde4b6aa07b4b90be6392c38d | refs/heads/main | 2023-06-28T19:59:01.965996 | 2021-08-04T17:51:14 | 2021-08-04T17:51:14 | 373,918,761 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 767 | cpp | #include<iostream>
using namespace std;
int binarySearch(int arr[], int n , int key){
int start=0;
int end=n;
while(start<=end){
int mid=(start+end)/2;
if (arr[mid]==key){
return mid;
}
else if (arr[mid]>key){
end=mid-1;
}
else{
start=mid+1;
}
}
return -1;
}
int main(){
int n;
cout<<"Enter size of array:";
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
cout<<"Entered array is:";
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}
int key;
cout<<"enter key to find:";
cin>>key;
cout<<binarySearch(arr,n,key)<<endl;
return 0;
}
| [
"noreply@github.com"
] | noreply@github.com |
d96930d1911fa1ed07184cd3ddd8ef9b9d95e7b3 | d26a306d0dc07a6a239e0f1e87e83e8d96712681 | /ZOMCAV2/main.cpp | d4be4cffd0a5d7de58f6a2621d17f4b0a6ff73a7 | [] | no_license | umar-07/Competitive-Programming-questions-with-solutions | e08f8dbbebed7ab48c658c3f0ead19baf966f140 | 39353b923638dff2021923a8ea2f426cd94d2204 | refs/heads/main | 2023-05-19T03:05:48.669470 | 2021-06-16T18:36:22 | 2021-06-16T18:36:22 | 377,588,251 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,611 | cpp | #include <bits/stdc++.h>
using namespace std;
void add(long long int arr[], int N, int lo, int hi, int val)
{
arr[lo] += val;
if (hi != N -1)
arr[hi + 1] -= val;
}
void updateArray(long long int arr[], int N)
{
// convert array into prefix sum array
for (int i = 1; i < N; i++)
arr[i] += arr[i - 1];
}
int main()
{
int t;
cin >> t;
while(t--)
{
int n;
cin >> n;
long long int arr[n], c[n+1]={0}, h[n]={0};
for(int i=0; i<n; i++)
{
cin >> arr[i];
int j=(i+1)-arr[i], k=(i+1)+arr[i];
//cout << j << " " << k << endl;
add(c, n+1, j, k, 1);
for(int i=0; i<n; i++)
cout << c[i] << " ";
cout << endl;
}
for(int i=0; i<n; i++)
cout << c[i] << " ";
cout << endl;
updateArray(c,n+1);
for(int i=0; i<n; i++)
cout << c[i] << " ";
cout << endl;
for(int i=0; i<n; i++)
cin >> h[i];
//c[0]=0;
sort(c, c+n);
sort(h, h+n);
int flag=1;
for(int i=0; i<n; i++)
{
if(h[i]!=c[i])
{
flag=0;
break;
}
}
for(int i=0; i<n; i++)
cout << c[i] << " ";
cout << endl;
for(int i=0; i<n; i++)
cout << h[i] << " ";
cout << endl;
if(flag==0)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
return 0;
}
| [
"mdu07100@gmail.com"
] | mdu07100@gmail.com |
c0bd7575e712042aa1a2b20ad84c69975a150c0c | d2249116413e870d8bf6cd133ae135bc52021208 | /SkinControls/Test/Test.h | 12443bce64f17f217a286b7f015d1271ba7c6a68 | [] | no_license | Unknow-man/mfc-4 | ecbdd79cc1836767ab4b4ca72734bc4fe9f5a0b5 | b58abf9eb4c6d90ef01b9f1203b174471293dfba | refs/heads/master | 2023-02-17T18:22:09.276673 | 2021-01-20T07:46:14 | 2021-01-20T07:46:14 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 475 | h |
// Test.h : PROJECT_NAME 应用程序的主头文件
//
#pragma once
#ifndef __AFXWIN_H__
#error "在包含此文件之前包含“stdafx.h”以生成 PCH 文件"
#endif
#include "resource.h" // 主符号
// CTestApp:
// 有关此类的实现，请参阅 Test.cpp
//
class CTestApp : public CWinApp
{
public:
CTestApp();
// 重写
public:
virtual BOOL InitInstance();
// 实现
DECLARE_MESSAGE_MAP()
};
extern CTestApp theApp; | [
"chenchao0632@163.com"
] | chenchao0632@163.com |
9f8c000a11d96f923364481f82fa158e4902b2a5 | eccdf178b4cc1e89a78e28f774088179d2473443 | /indexer/document/document.cpp | 884c8ee153135c650b8b0bb077ff85ae8b8b4edc | [] | no_license | MRsummer/GogoEngine | adb746e5072ded3906ea4e2ee7e7d35beec759b1 | b60ebf47859ec50ff9b521616d7e8a3f214bc419 | refs/heads/master | 2020-03-29T14:00:54.992616 | 2013-03-31T06:18:39 | 2013-03-31T06:18:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,097 | cpp | #include "document.h"
Regx Document::titleRegx =
Regx("<title>([^<]*)</tiltle>");
Regx Document::descRegx =
Regx("<meta[^>]*name=[\'\"]description[\'\"]"
"[^>]*content=[\'\"]([^>]*)[\'\"][^>]*>");
Regx Document::kwordsRegx =
Regx("<meta[^>]*name=[\'\"]keywords[\'\"]"
"[^>]*content=[\'\"]([^>]*)[\'\"][^>]*>");
Regx Document::bodyRegx =
Regx("<body>([^<]*)</body>");
Document::Document(string filepath
,string savedocpath)
{
//read the content
File file = File(filepath,"r");
string content = file.ReadContent();
//get file parts
title = titleRegx.Match(content,1);
title = RemoveBreakLines(title);
desc = descRegx.Match(content,1);
desc = RemoveBreakLines(desc);
kwords = kwordsRegx.Match(content,1);
kwords = RemoveBreakLines(kwords);
content = bodyRegx.Match(content,1);
content = RemoveTags(content);
//save the document
File file = File(savedocpath,"w");
vector<string> v;
v.push("<document>");
v.push(title);
v.push(kwords);
v.push(desc);
v.push(content);
v.push("</documnet>");
file.WriteLines(v);
file.Close();
}
Document::Document(string docpath)
{
File file = File();
vector<string> v;
file.GetLines(v,6);
if(v[0] != "<document>"
|| v[6] != "</document>")
{
PrintAndExit("document file error");
}
title = v[1];
kwords = v[2];
desc = v[3];
content = v[4];
file.Close();
}
string Document::RemoveTags(string content)
{
bool isContent = true;
string ret = "";
for(int i = 0;i < content.length();i ++)
{
if(content[i] == '<')
{
isContent = false;
continue;
}
else if(i >= 1 && content[i-1] == '>')
{
isContent = true;
ret += " ";
}
//remove tags and break lines
if(isContent && content[i] != '\n'
&& content[i] != '\r')
{
ret += content[i];
}
}
return ret;
}
string Document::RemoveBreakLines(stirng content)
{
string ret;
for(int i = 0;i < content.length();i ++)
{
if(content[i] != '\r'
&& content[i] != '\n')
{
ret += content[i];
}
}
return ret;
} | [
"zhu_guangwen@bingyan.net"
] | zhu_guangwen@bingyan.net |
79a18f96ccfe17814bffb96a94d8372b9db71f2c | 68c07259df374db79c031cc73cafadf779a52253 | /example.h | 06afc52e19d4d205fae02f5512c33efc58906139 | [] | no_license | TheSandDoctor/Pybind-mwbot-tests | 1b8c3af75b908de17e4fa53915e40e4670799565 | 89c3e350336697f3be95868c19ab92380ad16499 | refs/heads/master | 2020-03-11T16:32:06.374967 | 2018-04-24T04:09:36 | 2018-04-24T04:09:36 | 130,119,663 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,321 | h | /**
Copyright (C) 2018 Kyle Wilson <majorjohn1@mail.com>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#include "pybind/include/pybind11/pybind11.h"
#include "pybind/include/pybind11/embed.h"
#include "utilities.h"
#include <iostream>
#include <string>
#include <string.h>
#include <stdio.h>
#include <sys/types.h>
#define CAT_MODULE_STRING_ERRORS "[[Category:Music infoboxes with Module:String errors{{!}}"
#define BOT_USER "DeprecatedFixerBot"
/**
* See example.cpp for comments.
*/
namespace py = pybind11;
using namespace std;
#include <sys/stat.h>
namespace Helpers {
py::str get_valid_filename(string s) {
py::object re = py::module::import("re");
py::object s1 = py::str(s).attr("strip")().attr("replace")(' ','_');
return re.attr("sub")("r'(?u)[^-\w.]'","",py::str(s1));
}
/**
* @brief Reverses a python list
* @param list List to revert
* @return void
*/
const void reverseList(py::list list) {
list.attr("reverse")();
}
const void makeDir(const char* directory) {
int dir_err = mkdir(directory, S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);
if (-1 == dir_err)
{
printf("Error creating directory!n");
//exit(1);
}
}
const void createWriteFile(const char* file_name, const char *contents) {
FILE * pFile;
pFile = fopen(file_name, "w"); // write-only
fwrite(contents,sizeof(char),sizeof(contents),pFile);
fclose(pFile);
// free(pFile);
}
//TODO: Needs fixing
const void createWriteFile2(string file_name) {
py::object pathlib = py::module::import("pathlib");
if(pathlib.attr("Path")("./errors").attr("is_dir")() == Py_False)
pathlib.attr("Path")("./errors").attr("mkdir")(); // create dir
py::print("FF");
py::str title = get_valid_filename(file_name);
py::print(title);
// py::exec(R"");
// py::object ob;
//py::object text_file = ob.attr("open")("./errors/err " + string(title) + ".txt",'w');
}
};
bool pageInList(std::string page_name,py::list list);
string template_figure_type(string temp);
py::str process(string text);
bool bContent_changed = false;
bool getContentChanged();
bool revert(string page_name,py::object site);
| [
"twitter@markyrosongaming.com"
] | twitter@markyrosongaming.com |
73a937314e55040b8ec02112646ce5e04baee530 | 7a8ab491ee2683287ae4bc14ad56d40946c942fa | /workdir/src/common/management/manager_avoidance.h | 59fdd5f6af9747d9d4da27d0e44b5b40d26e4cc3 | [] | no_license | MenshovSergey/FlockProject | aae1611b115757f2d363ee3160eda9b820059773 | cd3f06307ed9e36a91544446ae3bcdc1d7156af1 | refs/heads/master | 2021-01-10T16:20:37.882253 | 2015-12-17T07:32:33 | 2015-12-17T07:32:33 | 48,161,847 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 736 | h | #pragma once
#include<management/manager_base.h>
namespace object
{
class manager_avoidance
: public manager_base
{
public: //info_mod
state get_state () override;
state_vis get_state_vis () override;
int get_type () override;
public: //semantic
void update () override;
public : //object_mod
void reg (boost::shared_ptr<object_mod>) ;
void unreg (boost::shared_ptr<object_mod>) ;
manager_avoidance ();
manager_avoidance (double radius);
void init (double radius);
private:
double radius;
}
}//object | [
"menshov-sergej@yandex.ru"
] | menshov-sergej@yandex.ru |
546a34d4cad49718ad389cc3447d70d885c60813 | f94710e5e4edddcb99aa285dd63ea629084f226c | /src/BaseLocation.h | 6b5e44ef85926cd89fb5ba41880b106cbc7fdea0 | [
"MIT"
] | permissive | andrewssobral/SassySpecter | e10efed4818b710dd0a4f8e43669d78b02ca0860 | d534732f6901e1e552aca7b1d5e4f4131cbca884 | refs/heads/master | 2020-12-22T10:02:49.651828 | 2020-01-28T13:06:27 | 2020-01-28T13:06:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,801 | h | #pragma once
#include "Common.h"
#include "DistanceMap.h"
#include "Unit.h"
#include <map>
#include <vector>
class SassySpecterBot;
class BaseLocation
{
SassySpecterBot & m_bot;
DistanceMap m_distanceMap;
CCTilePosition m_depotPosition;
CCPosition m_centerOfResources;
std::vector<Unit> m_geysers;
std::vector<Unit> m_minerals;
std::vector<CCPosition> m_mineralPositions;
std::vector<CCPosition> m_geyserPositions;
std::map<CCPlayer, bool> m_isPlayerOccupying;
std::map<CCPlayer, bool> m_isPlayerStartLocation;
int m_baseID;
CCPositionType m_left;
CCPositionType m_right;
CCPositionType m_top;
CCPositionType m_bottom;
bool m_isStartLocation;
public:
BaseLocation(SassySpecterBot & bot, int baseID, const std::vector<Unit> & resources);
int getGroundDistance(const CCPosition & pos) const;
int getGroundDistance(const CCTilePosition & pos) const;
bool isStartLocation() const;
bool isPlayerStartLocation(CCPlayer player) const;
bool isMineralOnly() const;
bool containsPosition(const CCPosition & pos) const;
const CCTilePosition & getDepotPosition() const;
const CCPosition & getPosition() const;
const std::vector<Unit> & getGeysers() const;
const std::vector<Unit> & getMinerals() const;
bool isOccupiedByPlayer(CCPlayer player) const;
bool isExplored() const;
bool isInResourceBox(int x, int y) const;
void setPlayerOccupying(CCPlayer player, bool occupying);
const std::vector<CCTilePosition> & getClosestTiles() const;
void draw();
};
| [
"florian.richoux@polytechnique.edu"
] | florian.richoux@polytechnique.edu |
f87d2d5d7dae849907289e9538717fb03f34c6cd | f204bb9d936fb787e4501b36ce2b229d1fc08f38 | /parser/include/csv.hpp | 68491ad6a16035dab3a735bb1eb476ec27f6b572 | [] | no_license | u123056/cxx-tasks | 2ea25fb0adb383f117e25503967620c3c1dd7d78 | 3dee07653d0fc80c76f6fab0e1fb65412c0e1d26 | refs/heads/master | 2020-04-02T04:02:40.614636 | 2019-01-18T08:54:07 | 2019-01-18T09:41:07 | 153,996,888 | 0 | 0 | null | 2019-01-18T09:41:08 | 2018-10-21T10:36:21 | C++ | UTF-8 | C++ | false | false | 1,830 | hpp | /* CSV parser.
* @file
* @date 2018-08-15
* @author Anonymous
*/
#ifndef __CSV_HPP__
#define __CSV_HPP__
#include <string>
#include <vector>
#include <boost/spirit/home/x3.hpp>
#include <boost/spirit/home/x3/support/utility/error_reporting.hpp>
#include "parser.hpp"
#include "quoted_string.hpp"
/* An example of CSV:
* kind,of,header
* abc,with space,"quote"
* "comma , inside",132, spaces dot
* empty,,
*
* CSV (comma separated value) EBNF specification (http://www.rfc-editor.org/rfc/rfc4180.txt)
* string := [^,\n]+
* quoted_string := " [^"]* "
* cell := quated_string | string
* row := cell (, cell)* \n
* header := row
* csv := header row*
*/
namespace types
{
namespace csv
{
//? Which kind of types should I use to describe the CSV type?
//{
using csv = std::vector<std::vector<std::string>>;
//}
}
}
namespace parser
{
namespace csv
{
//? Why I need a x3::no_skip here? Where is the original of the error?
//? Where is BOOST_SPIRIT_DEFINE? Is it necessary?
namespace x3 = boost::spirit::x3;
//{ csv grammar
const auto string = x3::lexeme[+(~x3::char_(",\n"))];
const auto cell = quoted_string | string;
const auto row = x3::rule<class row, std::vector<std::string>>{}
= cell % ',';
const auto csv = x3::rule<class csv, types::csv::csv>{}
= +row;
//}
}
}
namespace literals
{
namespace csv
{
//{ declare ``_csv`` literal
types::csv::csv operator "" _csv(const char* s, long unsigned int size)
{
return parser::load_from_string<types::csv::csv>(std::string(s, size), parser::csv::csv);
}
//}
}
}
#endif // __CSV_HPP__
| [
"igsha@users.noreply.github.com"
] | igsha@users.noreply.github.com |
6862bb2b10cc2567c4e1bb56d91ff41d5a340611 | d0af4ec3045ca773d2540989ffd2c990db884d09 | /src/Magnum/Implementation/RendererState.cpp | e72bd24cc3998a3224350c4be1c6df8f1d0bb80c | [
"MIT"
] | permissive | WasserEsser/magnum | 830fddbd67074f6bf47ae32a88c7fbfb8e03ea1a | 52613a2ad94e7c6f11c7898e162f636db7d07980 | refs/heads/master | 2021-05-02T08:26:07.550661 | 2018-02-01T14:42:03 | 2018-02-01T14:42:32 | 120,804,004 | 1 | 0 | null | 2018-02-08T19:00:15 | 2018-02-08T19:00:15 | null | UTF-8 | C++ | false | false | 4,630 | cpp | /*
This file is part of Magnum.
Copyright © 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018
Vladimír Vondruš <mosra@centrum.cz>
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
*/
#include "RendererState.h"
#include "Magnum/Context.h"
#include "Magnum/Extensions.h"
namespace Magnum { namespace Implementation {
RendererState::RendererState(Context& context, std::vector<std::string>& extensions)
#ifndef MAGNUM_TARGET_WEBGL
: resetNotificationStrategy()
#endif
{
/* Float depth clear value implementation */
#ifndef MAGNUM_TARGET_GLES
if(context.isExtensionSupported<Extensions::GL::ARB::ES2_compatibility>())
#endif
{
#ifndef MAGNUM_TARGET_GLES
extensions.emplace_back(Extensions::GL::ARB::ES2_compatibility::string());
#endif
clearDepthfImplementation = &Renderer::clearDepthfImplementationES;
}
#ifndef MAGNUM_TARGET_GLES
else clearDepthfImplementation = &Renderer::clearDepthfImplementationDefault;
#endif
#ifndef MAGNUM_TARGET_WEBGL
/* Graphics reset status implementation */
#ifndef MAGNUM_TARGET_GLES
if(context.isExtensionSupported<Extensions::GL::ARB::robustness>())
#else
if(context.isExtensionSupported<Extensions::GL::EXT::robustness>())
#endif
{
#ifndef MAGNUM_TARGET_GLES
extensions.emplace_back(Extensions::GL::ARB::robustness::string());
#else
extensions.push_back(Extensions::GL::EXT::robustness::string());
#endif
graphicsResetStatusImplementation = &Renderer::graphicsResetStatusImplementationRobustness;
} else graphicsResetStatusImplementation = &Renderer::graphicsResetStatusImplementationDefault;
#else
static_cast<void>(context);
static_cast<void>(extensions);
#endif
/* In case the extensions are not supported on ES2, row length is
constantly 0 to avoid modifying that state */
#if !(defined(MAGNUM_TARGET_GLES2) && defined(MAGNUM_TARGET_WEBGL))
unpackPixelStorage.disengagedRowLength = PixelStorage::DisengagedValue;
packPixelStorage.disengagedRowLength = PixelStorage::DisengagedValue;
#ifdef MAGNUM_TARGET_GLES2
if(!context.isExtensionSupported<Extensions::GL::EXT::unpack_subimage>())
unpackPixelStorage.disengagedRowLength = 0;
if(!context.isExtensionSupported<Extensions::GL::NV::pack_subimage>())
packPixelStorage.disengagedRowLength = 0;
#endif
#endif
}
RendererState::PixelStorage::PixelStorage():
#ifndef MAGNUM_TARGET_GLES
swapBytes{false},
#endif
alignment{4}
#if !(defined(MAGNUM_TARGET_GLES2) && defined(MAGNUM_TARGET_WEBGL))
, rowLength{0}
#endif
#ifndef MAGNUM_TARGET_GLES2
, imageHeight{0},
skip{0}
#endif
#ifndef MAGNUM_TARGET_GLES
, compressedBlockSize{0},
compressedBlockDataSize{0}
#endif
{}
void RendererState::PixelStorage::reset() {
#ifndef MAGNUM_TARGET_GLES
swapBytes = Containers::NullOpt;
#endif
alignment = DisengagedValue;
#if !(defined(MAGNUM_TARGET_GLES2) && defined(MAGNUM_TARGET_WEBGL))
/* Resets to 0 instead of DisengagedValue in case the EXT_unpack_subimage/
NV_pack_image ES2 extension is not supported to avoid modifying that
state */
rowLength = disengagedRowLength;
#endif
#ifndef MAGNUM_TARGET_GLES2
imageHeight = DisengagedValue;
skip = Vector3i{DisengagedValue};
#endif
#ifndef MAGNUM_TARGET_GLES
compressedBlockSize = Vector3i{DisengagedValue};
compressedBlockDataSize = DisengagedValue;
#endif
}
}}
| [
"mosra@centrum.cz"
] | mosra@centrum.cz |
145fbc70b142a4c90525550867c1840c0495fbbc | 26303826fe1ced3ae2de169e81aca9a799bda027 | /absolute.cpp | 6b3f3eb2a1a0010221af11e6d7f195b89cac5ae0 | [] | no_license | Gemma-B/CPP-Practice | a67536f0d0aaa3ae46c0650103c27aa3380d3365 | 618041e08b30c22b352f46fd4ddf103423d24104 | refs/heads/master | 2021-06-09T17:35:57.161877 | 2016-12-23T05:41:03 | 2016-12-23T05:41:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 436 | cpp | #include <iostream>
#include <cmath>
int main() {
std::cout << "ENTER YOUR NUMBER" << std::endl;
double absoluteNumber;
std::cin >> absoluteNumber;
if (absoluteNumber == 0) {
std::cout << "The absolute value of 0 is 0 " << std::endl;
}
else {
absoluteNumber = pow(pow(absoluteNumber, 2), 0.5);
std::cout << "The absolute value is " << absoluteNumber << std::endl;
}
return 0;
}
| [
"gemma@bertain.net"
] | gemma@bertain.net |
d4dfd8c2addb5ab8ec63adb02d4d44eae29f6dce | 0c360ce74a4b3f08457dd354a6d1ed70a80a7265 | /src/components/application_manager/include/application_manager/commands/mobile/end_audio_pass_thru_request.h | add6d2497e7168014ea08487581bc0aac4859b96 | [] | permissive | APCVSRepo/sdl_implementation_reference | 917ef886c7d053b344740ac4fc3d65f91b474b42 | 19be0eea481a8c05530048c960cce7266a39ccd0 | refs/heads/master | 2021-01-24T07:43:52.766347 | 2017-10-22T14:31:21 | 2017-10-22T14:31:21 | 93,353,314 | 4 | 3 | BSD-3-Clause | 2022-10-09T06:51:42 | 2017-06-05T01:34:12 | C++ | UTF-8 | C++ | false | false | 2,847 | h | /*
Copyright (c) 2013, Ford Motor Company
All rights reserved.
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 following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following
disclaimer in the documentation and/or other materials provided with the
distribution.
Neither the name of the Ford Motor Company nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef SRC_COMPONENTS_APPLICATION_MANAGER_INCLUDE_APPLICATION_MANAGER_COMMANDS_END_AUDIO_PASS_THRU_REQUEST_H_
#define SRC_COMPONENTS_APPLICATION_MANAGER_INCLUDE_APPLICATION_MANAGER_COMMANDS_END_AUDIO_PASS_THRU_REQUEST_H_
#include "application_manager/commands/command_request_impl.h"
#include "utils/macro.h"
namespace application_manager {
namespace commands {
/**
* @brief EndAudioPassThruRequest command class
**/
class EndAudioPassThruRequest : public CommandRequestImpl {
public:
/**
* @brief EndAudioPassThruRequest class constructor
*
* @param message Incoming SmartObject message
**/
EndAudioPassThruRequest(const MessageSharedPtr& message,
ApplicationManager& application_manager);
/**
* @brief EndAudioPassThruRequest class destructor
**/
virtual ~EndAudioPassThruRequest();
/**
* @brief Execute command
**/
virtual void Run();
/**
* @brief Interface method that is called whenever new event received
*
* @param event The received event
*/
void on_event(const event_engine::Event& event);
private:
DISALLOW_COPY_AND_ASSIGN(EndAudioPassThruRequest);
};
} // namespace commands
} // namespace application_manager
#endif // SRC_COMPONENTS_APPLICATION_MANAGER_INCLUDE_APPLICATION_MANAGER_COMMANDS_END_AUDIO_PASS_THRU_REQUEST_H_
| [
"luwanjia@aliyun.com"
] | luwanjia@aliyun.com |
f203e863bc0a35d1c3ad1b1b5879409b985711f1 | 8e69e9ccf958a834576e762fcd3d560842c4dbec | /libstudio/includes/triangle.hpp | 1a8db4d7870c5741eae09c859b122a4143db2d72 | [
"MIT"
] | permissive | mzdun/studio | 45e2c4cf768f01c87b803a7bcd4614207ef148af | 3e05e3f2987f10c2aa4ad7c3f94a01f09feca669 | refs/heads/master | 2021-01-21T01:46:30.388522 | 2013-07-27T16:47:27 | 2013-07-27T16:47:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,928 | hpp | /*
* Copyright (C) 2013 Marcin Zdun
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use, copy,
* modify, merge, publish, distribute, sublicense, and/or sell copies
* of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef __LIBSTUDIO_TRIANGLE_HPP__
#define __LIBSTUDIO_TRIANGLE_HPP__
#include "renderable.hpp"
namespace studio
{
class Triangle : public Renderable
{
public:
typedef math::Vertex vertices_t[3];
Triangle(const math::Vertex& v1, const math::Vertex& v2, const math::Vertex& v3);
void renderTo(const ICamera* cam, const math::Matrix& parent, const Lights& lights) const override;
MaterialPtr material() const override { return m_material; }
const vertices_t& vertices() const { return m_vertices; }
math::Vector normal() const { return math::Vector::crossProduct(m_vertices[2] - m_vertices[1], m_vertices[0] - m_vertices[1]); }
void setMaterial(const MaterialPtr& material) { m_material = material; }
private:
vertices_t m_vertices;
MaterialPtr m_material;
};
}
#endif //__LIBSTUDIO_TRIANGLE_HPP__ | [
"mzdun@midnightbits.com"
] | mzdun@midnightbits.com |
e218d74b64ef5b67f33f2a847d2a69e2c95d7014 | 74a62b00ab9d6a810b0f4802aa3d943e2d614bfa | /LeetCode51-100/LeetCode060.cpp | 99afe89fafd963d4fa1a74562af3a89dea9de443 | [] | no_license | House1993/acmicpc | b5a14080dab1cc73e21cd380522644e737556fe5 | bca75b4d1f5bde0d4e6124f4b314076619114529 | refs/heads/master | 2021-01-01T05:18:05.816356 | 2017-10-26T07:54:43 | 2017-10-26T07:54:43 | 59,340,483 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 997 | cpp | //
// Created by 房籽呈 on 2017/5/26.
//
/**
* 题解：
* http://blog.csdn.net/houserabbit/article/details/72764544
*/
class Solution {
public:
string getPermutation(int n, int k) {
vector<int> presum;
vector<int> factorial;
for (int i = 0; i <= n; ++i) {
presum.push_back(i);
if (i) {
factorial.push_back(factorial[i - 1] * i);
} else {
factorial.push_back(1);
}
}
stringstream ss;
for (int i = 0; i < n; ++i) {
for (int j = n; j > 0; --j) {
if (presum[j] - presum[j - 1] && k > factorial[n - i - 1] * (presum[j] - 1)) {
ss << j;
k -= factorial[n - i - 1] * (presum[j] - 1);
for (int o = j; o <= n; ++o) {
--presum[o];
}
break;
}
}
}
return ss.str();
}
}; | [
"HouseFangFZC@gmail.com"
] | HouseFangFZC@gmail.com |
ce1ea8fddb16b1d890c5c3803e762c08a22c4b24 | 39eae5cc024b6631a3a77853afed6983d8af31fe | /mix/workspace_vs/YY_WJX/BlurFind/BlurFind.cpp | 12bd22cffe0322b1a592077f04574d5ac079859c | [] | no_license | SniperXiaoJun/mix-src | cd83fb5fedf99b0736dd3a5a7e24e86ab49c4c3b | 4d05804fd03894fa7859b4837c50b3891fc45619 | refs/heads/master | 2020-03-30T06:21:14.855395 | 2018-09-28T03:32:55 | 2018-09-28T03:32:55 | 150,854,539 | 1 | 0 | null | 2018-09-29T10:44:41 | 2018-09-29T10:44:41 | null | GB18030 | C++ | false | false | 4,570 | cpp | // BlurFind.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include "iostream"
#include "string"
#include "vector"
#include <hash_map>
using namespace stdext;
using namespace std;
bool IsBlur(unsigned char c1,unsigned char c2,char c);
bool BlurFindStr(string &strSource,string &strFindCell);
bool Find(string &strFind, struct Contact contact);
struct Contact
{
string name;
string phone;
};
int _tmain(int argc, _TCHAR* argv[])
{
string s1 = "736";
//string s2 = "阳";
hash_map<int,struct Contact> contact_hash_map;
vector<int> ivec;
struct Contact Den;
Den.name = "邓冠阳";
Den.phone = "13840436736";
contact_hash_map[1] = Den;
hash_map<int,struct Contact>::iterator map_it = contact_hash_map.begin();
while (map_it != contact_hash_map.end())
{
bool ret = Find(s1, map_it->second);
if (ret == true)
{
ivec.push_back(map_it->first);
printf("True\n");
}
else
{
printf("False\n");
}
++map_it;
}
vector<int>::iterator vec_it = ivec.begin();
while(vec_it != ivec.end())
{
struct Contact con = contact_hash_map[*vec_it];
cout << con.phone <<endl;
++vec_it;
}
return 0;
}
bool Find(string &strFind, struct Contact contact)
{
return BlurFindStr(contact.name,strFind) || BlurFindStr(contact.phone,strFind);
}
bool BlurFindStr(string &strSource,string &strFindCell)
{//模糊搜索，支持用汉字用声母查询,返回
int nLenCell = strFindCell.size();
int nLenSource = strSource.size();
if(nLenCell < 1)
return true;
if(nLenSource <1)
return false;
//strSource.MakeLower();
//strFindCell.MakeLower();
for (int i = 0; i < nLenCell; i++)
{
strFindCell[i] = tolower(strFindCell[i]);
}
for (int i = 0; i < nLenSource; i++)
{
strSource[i] = tolower(strSource[i]);
}
bool bContainChar = false;
int i,j,k;
for(i=0; i< nLenCell; i++)
{
if( !(strFindCell[i]&0x80) ) //1<<7 //不是汉字,需要进行模糊查询
{
bContainChar = true;
break;
}
}
j = 0;
int nMatchCharCount = 0;
bool bEqual = false; //??什么作用？
int ik;
for(i = 0; i< nLenCell && j < nLenSource; i++)
{
ik = i;
char c = strFindCell[i];
if(c&0x80)//汉字
{
i++;
while(j < nLenSource)
{
char cs = strSource[j++];
k = j;
if(cs&0x80)//汉字
j++;
if(cs == c && k < nLenSource && strSource[k] == strFindCell[i])
{
if(ik == 0)
bEqual = true;
nMatchCharCount += 2;
break;
}
else if(i > 0)
{
bEqual = false;
nMatchCharCount = 0;
i = 0;
break;
}
}
}
else//字母
{
while(j < nLenSource)
{
char cs = strSource[j++];
k = j;
if(cs&0x80)//汉字
{
j++;
if(IsBlur(cs,strSource[k],c))
{
if(ik == 0)
bEqual = true;
nMatchCharCount++;
break;
}
else if(i > 0)
{
bEqual = false;
nMatchCharCount = 0;
i = 0;
break;
}
}
else if(cs == c)
{
if(ik == 0)
bEqual = false;
nMatchCharCount++;
break;
}
else if(i > 0)
{
bEqual = false;
nMatchCharCount = 0;
i = 0;
break;
}
}
}
}
if(bEqual && i == nLenCell && j == nLenSource)
return true;
else
return (nMatchCharCount == nLenCell);
}
bool IsBlur(unsigned char c1,unsigned char c2,char c)
{//模糊匹配函数，判断字母c是否为汉字（c1c2）的声母。（一个汉字由两个字节构成，且每个字节的最高位即左边第一位为1）
//汉字声母区间表：
static unsigned char cEnd[23*5+1] = "啊澳a芭怖b擦错c搭堕d蛾贰e发咐f噶过g哈紕h肌骏j喀阔k垃络l妈那m娜诺n哦沤o啪瀑p期群q然弱r撒所s塌唾t挖误w昔迅x压孕y匝座z";
static int nWord[23][2] = {0};
int i=0;
if(nWord[0][0] == 0)
{
//初始化nWord
for(i = 0;i < 23; i++)
{
nWord[i][0] = cEnd[i*5]*256 + cEnd[i*5+1];
nWord[i][1] = cEnd[i*5+2]*256 + cEnd[i*5+3];
}
}
int nWordChinese = c1 * 256 + c2;
int nLeft = 0,nRight = 22;
bool bMatch = false;
while(nLeft <= nRight)
{
i = (nLeft + nRight)/2;
if(nWordChinese > nWord[i][1])
nLeft = i+1;
else if(nWordChinese < nWord[i][0])
nRight = i-1;
else
{
if(cEnd[i*5+4] == c)
bMatch = true;
break;
}
}
return
bMatch;
} | [
"244540499@qq.com"
] | 244540499@qq.com |
94d05bef01cea383a4c871964069da9fc4b2020c | ac9e8b1032292f300623eae6a69eecbb9f29fed0 | /Q1/PRO1/CONS3/prova.cc | ad9d6eda27a575e1621e4003c75e759eac15e6b5 | [] | no_license | ericfib/UPC-FIB | 284888753cf300bbbf801b38e4a62eb5861e7c2b | 0cb178994d0ec0be9cab978f9c090641c0b074b9 | refs/heads/master | 2020-12-14T15:34:06.554808 | 2020-04-15T16:41:33 | 2020-04-15T16:41:33 | 234,789,710 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 303 | cc | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct prova {
string part;
};
int main (){
vector<prova> s (5);
for (int i = 0; i < s.size(); i++){
cin >> s[i].part;
}
for(int i = 0; i < 5; i++){
if (s[i].part[0] == 'c') cout << s[i].part << endl;
}
}
| [
"ersele46@gmail.com"
] | ersele46@gmail.com |
bc09352b36d57627559304d72419eba60535c6fd | 56c0cca18382143d3aa033554df17eea742379e3 | /OLC game jam 2019/StickmanAnimationStay.h | 37b1208251fe92dfa167fcfa8b4cdf59542cdec7 | [] | no_license | Meridor6919/OLC-game-jam-2019 | 07b10cd0536a0915bcf92da016f726163afd61c3 | 6d8f967b1b91afed28909fd6e3b10bf4ed16dcbf | refs/heads/master | 2020-07-15T09:25:36.137704 | 2020-04-27T10:57:38 | 2020-04-27T10:57:38 | 205,532,110 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 644 | h | #pragma once
#include "Animation.h"
class StickmanAnimationStay : public Animation
{
public:
StickmanAnimationStay(DirectX::SpriteBatch* sprite_batch, ID3D11Device* device)
{
frame_time = 0.2f;
path = L"Graphics\\StickmanStay.png";
frame_width = 250;
frame_height = 250;
number_of_frames = 1;
Animation::Init(sprite_batch, device);
}
void Draw(int x, int y, int width, int height, float depth, DirectX::SpriteEffects effect) { Animation::Draw(x, y, width, height, depth, effect); }
bool LastFrameReached() { return Animation::LastFrameReached(); }
void Update(float delta_time) { return Animation::Update(delta_time); }
};
| [
"michalbalicki@o2.pl"
] | michalbalicki@o2.pl |
8f16af06014458b0e83a7ae1d9d0cb461dd226d6 | f05ccad530089bad49b88383738ebdbe74fecaf8 | /vsConfig/vsConfig2/vsConfig2_1/vsConfig2_1.cpp | e80d15d66a2817566c6601b85f63dc50e9ee6be6 | [] | no_license | Xudoge/Xudoge-PersonalC-Study | 1256ed136ab18238149c8fd76d420c4647b96518 | 7e415acf032fb1869d04a07dae1cd127324d04af | refs/heads/main | 2023-01-10T20:39:41.986279 | 2020-11-17T12:55:05 | 2020-11-17T12:55:05 | 305,564,231 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 842 | cpp | // vsConfig2_1.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
#include <iostream>
int main()
{
std::cout << "Hello World!\n";
}
// 运行程序: Ctrl + F5 或调试 >“开始执行(不调试)”菜单
// 调试程序: F5 或调试 >“开始调试”菜单
// 入门使用技巧:
// 1. 使用解决方案资源管理器窗口添加/管理文件
// 2. 使用团队资源管理器窗口连接到源代码管理
// 3. 使用输出窗口查看生成输出和其他消息
// 4. 使用错误列表窗口查看错误
// 5. 转到“项目”>“添加新项”以创建新的代码文件，或转到“项目”>“添加现有项”以将现有代码文件添加到项目
// 6. 将来，若要再次打开此项目，请转到“文件”>“打开”>“项目”并选择 .sln 文件
| [
"490207448@qq.com"
] | 490207448@qq.com |
6609b904668fb4e38fea8d3938727ebc47520b52 | 065514567124ae77a1c18ac3a05cdbd5a479bde1 | /MeshIO/FEGMshImport.h | 35044219bc7113ea205e3be6cec6be00ea46216e | [
"MIT"
] | permissive | davidlni/FEBioStudio | d6b1f61304c104e33e6b1b1e8d522c19c95aa154 | 324d76b069a60e99328500b9b25eb79cf5a019e8 | refs/heads/master | 2023-08-17T09:04:30.943726 | 2021-09-28T21:19:29 | 2021-09-28T21:19:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,724 | h | /*This file is part of the FEBio Studio source code and is licensed under the MIT license
listed below.
See Copyright-FEBio-Studio.txt for details.
Copyright (c) 2020 University of Utah, The Trustees of Columbia University in
the City of New York, and others.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.*/
#pragma once
#include "FileReader.h"
#include <MeshTools/FEProject.h>
class FEGMshImport : public FEFileImport
{
protected:
struct ELEMENT
{
int ntype;
int gid;
int node[20];
};
public:
FEGMshImport(FEProject& prj);
bool Load(const char* szfile);
protected:
bool ReadMeshFormat();
bool ReadPhysicalNames();
bool ReadNodes();
bool ReadElements();
protected:
char m_szline[256];
FEModel* m_pfem;
FEMesh* m_pm;
};
| [
"michaelrossherron@gmail.com"
] | michaelrossherron@gmail.com |
d8bae03ee4d9bde10a35d40cd2c5aca74ea5041a | 8e516fb6fc53c12df53d80653f14e262c303cbd2 | /Source/lua_cdp_functions/lua_cdp_functions_time_texture.h | acb846881bbb4ffcf7d9bbd6839af4fc43743c52 | [
"MIT"
] | permissive | loganmcbroom/Altar | 8a087b3902e03962af45ce9e4ad9baa42aebf38f | 90b447c6dc8c612cb6c9bf999596ebae747592d2 | refs/heads/master | 2021-01-09T20:53:51.767702 | 2018-06-20T06:59:06 | 2018-06-20T06:59:06 | 59,455,378 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,197 | h | #pragma once
#include "lua_cdp_utilities.h"
#define TEXTURE_MODAL_FUNC( process, params, flags ) \
int lua_cdp_texture_ ## process( lua_State * L ) \
{ \
int mode = lua_tonumber( L, 1 ); \
lua_remove( L, 1 ); \
if( mode > 5 ) \
return luaL_error( L, ( "lua_cdp_texture_" + std::string( #process ) + " has no mode " + std::to_string( mode ) ).c_str() ); \
return lua_nonlinear_proc( L, params, flags, [&]( lua_State * L, int groupSize ) \
{ \
lua_pushpairs( L, { {"texture", 1}, { (std::string(#process) + " " + to_string( mode )).c_str(), 2}, {WAV_TYPE, 3 + groupSize} } );\
return cdp( L ); \
} ); \
}
TEXTURE_MODAL_FUNC( simple, 13, 5 )
TEXTURE_MODAL_FUNC( grouped, 24, 7 )
TEXTURE_MODAL_FUNC( decorated, 21, 10 )
TEXTURE_MODAL_FUNC( predecor, 21, 10 )
TEXTURE_MODAL_FUNC( postdecor, 21, 10 )
TEXTURE_MODAL_FUNC( motifs, 18, 7 )
TEXTURE_MODAL_FUNC( motifsin, 18, 7 )
TEXTURE_MODAL_FUNC( ornate, 16, 9 )
TEXTURE_MODAL_FUNC( preornate, 16, 9 )
TEXTURE_MODAL_FUNC( postornate, 16, 9 )
TEXTURE_MODAL_FUNC( timed, 11, 5 )
TEXTURE_MODAL_FUNC( tgrouped, 22, 7 )
TEXTURE_MODAL_FUNC( tmotifs, 16, 7 )
TEXTURE_MODAL_FUNC( tmotifsin, 16, 7 )
void register_lua_cdp_functions_texture( lua_State * L )
{
lua_register( L, "texture_simple", lua_cdp_texture_simple );
lua_register( L, "texture_grouped", lua_cdp_texture_grouped );
lua_register( L, "texture_decorated", lua_cdp_texture_decorated );
lua_register( L, "texture_predecor", lua_cdp_texture_predecor );
lua_register( L, "texture_postdecor", lua_cdp_texture_postdecor );
lua_register( L, "texture_motifs", lua_cdp_texture_motifs );
lua_register( L, "texture_motifsin", lua_cdp_texture_motifsin );
lua_register( L, "texture_ornate", lua_cdp_texture_ornate );
lua_register( L, "texture_preornate", lua_cdp_texture_preornate );
lua_register( L, "texture_postornate", lua_cdp_texture_postornate );
lua_register( L, "texture_timed", lua_cdp_texture_timed );
lua_register( L, "texture_tgrouped", lua_cdp_texture_tgrouped );
lua_register( L, "texture_tmotifs", lua_cdp_texture_tmotifs );
lua_register( L, "texture_tmotifsin", lua_cdp_texture_tmotifsin );
} | [
"noreply@github.com"
] | noreply@github.com |
437ba76fe158a3190463d01e20be9e7a6bfbdaf1 | c77cebb3029fc72928b035661a4da547b1f684bb | /uva/graphs/Special graphs - eulerian graph/UVa 10054 The Necklace.cpp | b61c9b93a14d793340446d4a1db90d42a6b612c5 | [] | no_license | HelderAntunes/competitive-programming | 37d9fde0d5c7a603277ce9b71e3cc5880a802aff | 0e143efedaed33876ecc7edf81d7f18885e70cba | refs/heads/master | 2018-12-21T19:05:54.141613 | 2018-09-29T22:05:12 | 2018-09-29T22:05:12 | 77,644,911 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,359 | cpp | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <string.h>
#include <stack>
#include <algorithm>
#include <queue>
#include <set>
#include <climits>
#include <fstream>
#include <map>
#include <functional>
#include <sstream>
#include <bitset>
#include <list>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define INF 1e9
#define INF2 2e9
#define PI acos(-1)
#define VISITED 1
#define UNVISITED 0
#define PROCESSED 2
vi a;
vector<vii> AdjList;
list<ii> cyc;
void EulerTour(list<ii>::iterator i, int u) {
for (int j = 0; j < (int)AdjList[u].size(); j++) {
ii v = AdjList[u][j];
if (v.second) {
AdjList[u][j].second = 0;
for (int k = 0; k < (int)AdjList[v.first].size(); k++) {
ii uu = AdjList[v.first][k];
if (uu.first == u && uu.second) {
AdjList[v.first][k].second = 0;
break;
}
}
EulerTour(cyc.insert(i, ii(u,v.first)), v.first);
}
}
}
/**
* Helder Antunes
* 10054 The Necklace
* Solution: Just print the euler tour/circuit
*/
int main()
{
freopen("in.txt","r", stdin);
freopen("out.txt","w", stdout);
int t, Case = 1;
scanf("%d", &t);
while(t--) {
int n, e1, e2;
scanf("%d", &n);
a.assign(51, 0);
AdjList.assign(51, vii());
cyc.clear();
int A;
for (int i = 0; i < n; i++) {
scanf("%d %d", &e1, &e2);
a[e1]++;
a[e2]++;
AdjList[e1].push_back(ii(e2,1));
AdjList[e2].push_back(ii(e1,1));
A = e1;
}
bool lost = false;
for (int i = 0; i < 51; i++) {
if (a[i] % 2 != 0) {
lost = true;
break;
}
}
printf("Case #%d\n", Case++);
if (lost) {
printf("some beads may be lost\n");
}
else {
EulerTour(cyc.begin(), A);
cyc.reverse();
for (list<ii>::iterator it = cyc.begin(); it != cyc.end(); it++)
printf("%d %d\n", it->first, it->second);
}
if (t > 0)
printf("\n");
}
return 0;
}
| [
"helder_antunes-@hotmail.com"
] | helder_antunes-@hotmail.com |
3aee028009fd797c644a25cede765a9e80a56b06 | 17d0bbf2697c85d42c2773f8e16c0bc50c030c6a | /curie_eeprom/curie_eeprom.ino | 472baac76db2181915d6fd31c88fd7bd5ab2087e | [] | no_license | backupbrain/arduino-projects | 17032ff11170e130e8eeef16e1c0f7b9cd4cc29b | d14b56d66e88b1e4cfd88bcee24df4fc80bf7c42 | refs/heads/master | 2023-02-03T17:02:48.575084 | 2020-12-23T21:45:39 | 2020-12-23T21:45:39 | 324,007,307 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,147 | ino | #include "CurieEEPROM.h"
void setup() {
Serial.begin(9600);
while(!Serial);
Serial.println("Running EEPROM Test for Curie/101");
Serial.print("EEPROM Size: ");
Serial.print(EEPROM.length());
Serial.println(" (NOTE: Should be 1024)");
write_eeprom();
dump_eeprom();
}
void loop() {
delay(1000);
}
void print_byte(byte value) {
if (value <= 0x0F) {
Serial.print(" 0");
} else {
Serial.print(' ');
}
Serial.print(value, HEX);
}
void write_eeprom() {
int len = 15;
byte buf[len];
for (int i = 0; i < len; i++) {
buf[i] = i + 1;
}
Serial.print("Writing ");
Serial.print(len);
Serial.println(" bytes");
for (int i = 0; i < len; i++) {
byte value = buf[i];
EEPROM.update(i, value);
if (value == EEPROM.read(i)) {
print_byte(value);
} else {
Serial.println("\nWRITE FAILED");
return;
}
}
Serial.println("\nSUCCESS?");
}
void dump_eeprom() {
Serial.println("Dump EEPROM");
for (int i = 0; i < EEPROM.length(); i++) {
int value = EEPROM.read(i);
print_byte(value);
if (i > 0 && ((i + 1) % 32 == 0)) {
Serial.println();
}
}
}
| [
"backupbrain@gmail.com"
] | backupbrain@gmail.com |
febc26c616c2fb75fa9448930d513dfd1eaf465a | b1cc146e3a7bbc0ee28a14d3d4348a294d70da47 | /Betweenes_cenerality/short_path.cpp | bff8be633efd9f1f1064bb23803b8ae8ff033351 | [] | no_license | HMarsafy/Data-Structure-Project | 71fa1b62f00277b464f947ea52b419d7d0358587 | c83f998c39b4b733699f90422b952e6f4f0feca7 | refs/heads/master | 2022-02-01T07:51:15.349141 | 2019-07-03T12:13:13 | 2019-07-03T12:13:13 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 272 | cpp | int minDistance(bool ShortpassSet[], int distance[], int numOfver)
{
int indexOfmin;
int min = int_max;
for (int i = 0; i < numOfver; i++)
{
if (distance[i] < min && ShortpassSet[i] == false)
{
min = distance[i];
indexOfmin = i;
}
}
return indexOfmin;
}
| [
"noreply@github.com"
] | noreply@github.com |
4c32dd840c69b7273b47d10f09c0c6fbdf5a0fbf | 7f60403f7027fd94021c00a4cbf4dba433f26013 | /include/disk_info.h | 5b85e040f7aecb68da0f3f8728dfd5862d41c613 | [] | no_license | bum2free/alac_converter | ab6e8f172894f42032dab331a78df29b3ec95fc6 | db8361abde28a0abe0ebcbfa7c080d8ce4217c4a | refs/heads/master | 2020-03-17T05:19:19.820702 | 2018-05-20T12:32:25 | 2018-05-22T04:18:03 | 133,311,465 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,036 | h | #ifndef __DISK_INFO_H__
#define __DISK_INFO_H__
#include <string>
#include <sstream>
#include <vector>
class TrackInfo;
class CommonInfo
{
public:
virtual ~CommonInfo() = default;
int parse(std::string &line);
std::string title;
std::string performer;
std::string file;
std::string disc_id;
protected:
std::vector<TrackInfo> *p_tracks;
private:
void string_split(std::vector<std::string> &subs, std::string &str,
char splitter);
};
class TrackInfo : public CommonInfo
{
public:
TrackInfo(std::string &file, std::string &index,
std::vector<TrackInfo> *p_tracks);
std::string index;
std::vector<std::string> time_index;
int start_time = -1; //in second
int duration = 0;
};
class DiscInfo : public CommonInfo
{
public:
DiscInfo()
{
p_tracks = &tracks;
}
int parse_file(const std::string &file_name);
std::vector<TrackInfo> tracks;
private:
int process_time(void);
int parse_time_index(const std::string &index);
};
#endif
| [
"eric_tj@126.com"
] | eric_tj@126.com |
6e40565f317fe4e1984df1ede2b356ab68e27b8c | af7b57e2c1da688289902b91c0c931a380efccf0 | /Zanshin/Networking/NetworkSingleton.h | d5136e90ace4ba51f558124e9e6f07823e36263b | [] | no_license | JuanCCS/Zanshin | c4f00c1b7d059b6eb1005e8d8df04bdbc800f03a | 0bf35b98f0e412d3abba5c25dd6ac997ddb3c743 | refs/heads/master | 2021-01-01T03:49:42.560714 | 2016-05-19T16:05:49 | 2016-05-19T16:05:49 | 56,642,412 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 689 | h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "GameFramework/Actor.h"
#include "NetworkSingleton.generated.h"
UCLASS()
class ZANSHIN_API ANetworkSingleton : public AActor
{
GENERATED_BODY()
public:
/** Returns the instance, creates it if it doesn't exist. */
static ANetworkSingleton& GetInstance();
/** Sets default values for this actor's properties */
ANetworkSingleton();
/** Sets default values for this actor's properties */
virtual void BeginPlay() override;
/** Sets default values for this actor's properties */
virtual void Tick( float DeltaSeconds ) override;
private:
};
| [
"juanccs@juans-mbp.vfs.local"
] | juanccs@juans-mbp.vfs.local |
8d17603723352487e64c5137692326d8d4898b07 | d928ac698895ec2a276b2549ce8c0f2cf39d4e03 | /CodeForces/CF657Div2/A.cpp | c3f8cf0d36a3ebd88498718f0520dc06984236ec | [] | no_license | BlowHail/record-in-oj | bb066c979a804f8c957290544c74b8f3da28c2e8 | 2182145cbb03b4f8382eb927d2291b92e5c01b59 | refs/heads/master | 2023-03-18T23:44:56.351907 | 2021-03-13T06:33:50 | 2021-03-13T06:33:50 | 287,764,353 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,121 | cpp | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#define ll long long
#define pi 3.1415927
#define inf 0x3f3f3f3f
#define mod 1000000007
using namespace std;
#define _int __int128_t
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+c-'0',c=getchar();
return f*x;
}
void print(int x)
{
if(x < 0) {putchar('-');x = -x;}
if(x/10) print(x/10);
putchar(x%10+'0');
}
int n,m;
string s;
int main ()
{
int T,i,t,j,k,p,sum=0;
cin>>T;
while(T--){
cin>>n>>s;
sum=0;
int res=0;
for(i=0;i<n-6;++i){
if(s[i]==s[i+2]==s[i+4]==s[i+6]=='a' && s[i+1]==s[i+5]=='b' &&s[i+3]=='c')
sum++;
if( (s[i]=='a'||s[i]=='?') && (s[i+2]=='a'||s[i+2]=='?')&&
(s[i+4]=='a'||s[i+4]=='?') && (s[i+6]=='a'||s[i+6]=='?') &&
s[i+1]=='b'&& s[i+5]=='b' &&s[i+3]=='c')
;
}
}
return 0;
} | [
"1144062115@qq.com"
] | 1144062115@qq.com |
80eec68f8988aba9ac9cd6481a9084f760a020d0 | 6bf4991a04d6f28948cf397a6850f0f02401cd5a | /myCode/lastOne/main.cpp | 141a0c613e1268c3cd844051542d3e38bed36a96 | [] | no_license | lishaohsuai/hw_software | ac3ffddd35ea829c65198e7164a3a6fdab94c25c | e92b81de9ea21bcf91cdfc8489a585b4f4bcea5f | refs/heads/main | 2023-03-02T03:52:41.483442 | 2021-01-09T02:21:59 | 2021-01-09T02:21:59 | 328,053,745 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,252 | cpp | #include "header.hpp"
#include <stdio.h>
#include <algorithm>
#include <thread>
#include <cstring>
#include <time.h>
#include <iostream>
#include <sstream>
#include <sys/mman.h>
#include <unistd.h>
#include <fcntl.h>
#define TEST
static const int threadCount = 4;
static const int MAXID = 220000;
// 以下数组存储图
static int Gout[MAXID][100]; // 记录出边ID
static int Gin[MAXID][100]; // 记录入边ID
static int pOut[MAXID]; // Gout[i]数组索引
static int pIn[MAXID]; // Gin[i]数组索引
static int inputs[MAXID];
static unsigned int maxNodeOut; // 有出度的节点的最大id
// 以下变量与线程有关，每个线程需要单独享有一份
static bool vis[threadCount][MAXID];
static int vis1[threadCount][MAXID]; // dfs3i得到该数组，dfs6o遍历时与他做交集进行减枝
static int vis2[threadCount][MAXID]; // for 6 + 1, vis2[i] = head + 1表示i是head的入边节点
static int totalCircles[threadCount];
static int tmpPath[threadCount][10];
static short int tmpPathIdx[threadCount];
static int tmpFlag[threadCount];
/* for multi-thread */
static char ans[threadCount][5][90000000]; // 每个线程将结果写入对应的数组
static int ansIndex[threadCount][5];
void parseInput(std::string &testFile)
{
FILE* fp = fopen(testFile.c_str(), "r");
register unsigned int u, v, c, tmpMax = 0;
memset(pOut, 0, sizeof(pOut));
memset(pIn, 0, sizeof(pIn));
while (fscanf(fp, "%u,%u,%u", &u, &v, &c) != EOF) {
Gout[u][pOut[u]++] = v;
Gin[v][pIn[v]++] = u;
if(u > tmpMax) tmpMax = u;
}
maxNodeOut = tmpMax;
fclose(fp);
}
void addans(int length, int threadNo)
{
register int j, tmpLen;
for(j = 0; j < tmpPathIdx[threadNo]; ++j) {
tmpLen = strlen(intToChar[tmpPath[threadNo][j]]);
memcpy(ans[threadNo][length] + ansIndex[threadNo][length], intToChar[tmpPath[threadNo][j]], tmpLen);
ansIndex[threadNo][length] += tmpLen;
ans[threadNo][length][ansIndex[threadNo][length]] = ',';
++ansIndex[threadNo][length];
}
ans[threadNo][length][ansIndex[threadNo][length] - 1] = '\n';
++totalCircles[threadNo];
}
// 正向遍历6层
void dfs6o(int head, int cur, int depth, int threadNo)
{
register int v, i;
vis[threadNo][cur] = true;
tmpPath[threadNo][tmpPathIdx[threadNo]] = cur;
++tmpPathIdx[threadNo];
for(i = 0; i < pOut[cur]; ++i) {
v = Gout[cur][i];
if(v < head || vis[threadNo][v]) continue; // id < head 才继续访问
if (depth >= 4 && vis1[threadNo][v] != tmpFlag[threadNo]) continue; // 第四层以后有交集才访问(剪枝)
if(vis2[threadNo][v] == tmpFlag[threadNo] && depth >= 2) { // 存在路径，得到一条结果
tmpPath[threadNo][tmpPathIdx[threadNo]] = v;
++tmpPathIdx[threadNo];
addans(depth - 2, threadNo); // depth-2映射为 0 - 4 之间
--tmpPathIdx[threadNo];
}
if (depth < 6) {
dfs6o(head, v, depth + 1, threadNo);
}
}
vis[threadNo][cur] = false;
--tmpPathIdx[threadNo];
}
// 反向遍历3层： 如果将图看做是无向图，一个点数为7的环中，距离起点最远的点距离不超过3
// 所以寻找可以到达的深度为4以内的素有路劲，按理说BFS会快些，但尝试了下，感觉更慢
void dfs3i(int head, int cur, int depth, int threadNo)
{
register int v, i;
vis[threadNo][cur] = true;
for(i = 0; i < pIn[cur]; ++i) {
v = Gin[cur][i];
if(v < head || vis[threadNo][v]) continue;
vis1[threadNo][v] = tmpFlag[threadNo]; // 记录距离起点反向距离不超过3的所有节点
if(depth == 1) { // for 6 + 1, 记录head的直接入度节点，即最后一层
vis2[threadNo][v] = tmpFlag[threadNo] ; // 标记
}
if (depth < 3) {
dfs3i(head, v, depth + 1, threadNo);
}
}
vis[threadNo][cur] = false;
}
void process(int start, int end, int threadNo)
{
register int i;
for(i = start; i < end; ++i) {
tmpFlag[threadNo] = inputs[i] + 1; // for 6 + 1， 标记入度节点， head + 1的目的是因为有id为0的节点
dfs3i(inputs[i], inputs[i], 1, threadNo);
dfs6o(inputs[i], inputs[i], 1, threadNo);
}
}
void solve()
{
register int i, idx = 0;
for(i = 0; i <= maxNodeOut; ++i) {
if (pOut[i]) {
// 对出度所连接的节点进行排序，这样查找是id都是从小到大，对结果就不用排序了
std::sort(Gout[i], Gout[i] + pOut[i]);
if(pIn[i]) {
inputs[idx++] = i;
}
}
}
// 划分区间
int d = idx >> 3;
int s1 = 0 , e1 = s1 + d;
int s2 = e1, e2 = s2 + d + d;
int s3 = e2, e3 = s3 + d + d;
int s4 = e3, e4 = idx;
std::thread t1 = std::thread(&process, s1, e1, 0);
std::thread t2 = std::thread(&process, s2, e2, 1);
std::thread t3 = std::thread(&process, s3, e3, 2);
process(s4, e4, 3);
t1.join();
t2.join();
t3.join();
}
void save(std::string &outputFile)
{
std::ostringstream os;
os << totalCircles[0] + totalCircles[1] + totalCircles[2] + totalCircles[3] << std::endl;
FILE * fp = fopen(outputFile.c_str(), "w" );
fwrite(os.str().c_str(), os.str().length(), 1, fp);
// printf("%d %d %d %d\n", totalCircles[0], totalCircles[1], totalCircles[2], totalCircles[3]);
register int i, j;
for(i = 0; i < 5; i++) {
for(j = 0; j < threadCount; j++) {
fwrite(ans[j][i], ansIndex[j][i], 1, fp);
}
}
fclose(fp);
}
int main()
{
std::string testFile = "../std/stdin/3512444/test_data.txt";
std::string outputFile = "../std/testout/351244.txt";
#ifdef TEST
auto t0 = clock();
#endif
parseInput(testFile); // 读取数据并构建图
#ifdef TEST
auto t1 = clock();
std::cout << "[DEBUG] 读取文件并构建图所消耗时间" << t1 - t0 << std::endl;
#endif
solve();
#ifdef TEST
auto t2 = clock();
std::cout << "[DEBUG] 处理时间" << t2 - t1 << std::endl;
#endif
save(outputFile);
#ifdef TEST
auto t3 = clock();
std::cout << "[DEBUG] 存储文件时间" << t3 - t2 << std::endl;
#endif
return 0;
}
| [
"l049188593@qq.com"
] | l049188593@qq.com |
c9134893fcf1553d1a4017c89b1cbb33c44bee54 | b5fbc8a3c3700b563b98132520b76b0228eca174 | /CodeForces/Contest1354(div2)/Contest(div3)/Diego/G.cpp | 7d8412133f9ef86bde9594b267f7c85c77c64aad | [] | no_license | juandiegocastano/Competitiva | 09efd94499e6d15af1b8a0a9cb7b234bd32b3492 | c303b703e52e0c534c1fe22333a85bb76dd50537 | refs/heads/master | 2022-12-27T05:10:39.172466 | 2020-10-08T21:35:06 | 2020-10-08T21:35:06 | 301,774,107 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,777 | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
struct edge {
int u, v;
LL cap, flow;
edge() {}
edge(int u, int v, LL cap): u(u), v(v), cap(cap), flow(0) {}
};
struct dinic {
int N;
vector<edge> E;
vector<vector<int>> g;
vector<int> d, pt;
dinic(int N): N(N), E(0), g(N), d(N), pt(N) {}
void add_edge(int u, int v, LL cap) {
if (u != v) {
E.emplace_back(edge(u, v, cap));
g[u].emplace_back(E.size() - 1);
E.emplace_back(edge(v, u, 0));
g[v].emplace_back(E.size() - 1);
}
}
bool bfs(int S, int T) {
queue<int> q({S});
fill(d.begin(), d.end(), N + 1);
d[S] = 0;
while(!q.empty()) {
int u = q.front(); q.pop();
if (u == T) break;
for (int k: g[u]) {
edge &e = E[k];
if (e.flow < e.cap && d[e.v] > d[e.u] + 1) {
d[e.v] = d[e.u] + 1;
q.emplace(e.v);
}
}
}
return d[T] != N + 1;
}
LL dfs(int u, int T, LL flow = -1) {
if (u == T || flow == 0) return flow;
for (int &i = pt[u]; i < int(g[u].size()); ++i) {
edge &e = E[g[u][i]];
edge &oe = E[g[u][i]^1];
if (d[e.v] == d[e.u] + 1) {
LL amt = e.cap - e.flow;
if (flow != -1 && amt > flow) amt = flow;
if (LL pushed = dfs(e.v, T, amt)) {
e.flow += pushed;
oe.flow -= pushed;
return pushed;
}
}
}
return 0;
}
LL max_flow(int S, int T) {
LL total = 0;
while (bfs(S, T)) {
fill(pt.begin(), pt.end(), 0);
while (LL flow = dfs(S, T))
total += flow;
}
return total;
}
};
int main() {
// ios_base::sync_with_stdio(false); cin.tie(NULL);
int t;
cin >> t;
while( t-- ) {
int n, m, a, b;
cin >> n >> m >> a >> b;
if( a*n == m*b ) {
int s = n+m, t = s+1;
dinic F(n+m+2);
int cnt = 0;
for( int i = 0; i < n; i++ ) {
F.add_edge( s, i, a );
cnt++;
}
for( int i = 0; i < m; i++ ) {
F.add_edge( n+i, t, b );
cnt++;
}
cnt *= 2;
for( int i = 0; i < n; i++ ) {
for( int j = 0; j < m ; j++ ) {
F.add_edge( i, n+j, 1 );
}
}
if( F.max_flow(s, t) == n*a ) {
cout << "YES\n";
for( int i = cnt, temp = 0; i < F.E.size(); i+=2 ) {
cout << F.E[i].flow;
temp++;
if( temp == m ) { cout << '\n'; temp = 0; }
}
} else {
cout << "NO\n";
}
} else {
cout << "NO\n";
}
}
return 0;
} | [
"j.castano@utp.edu.co"
] | j.castano@utp.edu.co |
c40b3bcc258c4608fec1acb4142e22a9aaae888c | a92a96fe76a90f335227676f4ac963c71f5211aa | /Peg.h | 9dca46342f1063ce4b79c4c3eacc73a89b37d698 | [] | no_license | ClayMStamper/AI-4346---Final-Project | acbaf1f0ed3fd26810097c770abf4d5eb8f7065f | 9451b10275712271698bb3d9c49454ac367e77b2 | refs/heads/master | 2020-09-15T13:36:57.474711 | 2019-11-25T15:52:21 | 2019-11-25T15:52:21 | 223,462,001 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 584 | h | //
// Created by clays on 11/22/2019.
//
#ifndef AI_PROJ2_PEG_H
#define AI_PROJ2_PEG_H
#include "vector"
#include "Disk.h"
#include "Debug.h"
class Peg : public IConvertToString {
public:
std::vector<Disk> disks;
int offset, height;
public:
Peg(int ringCount, int height);
~Peg() = default;
string ToString() override;
string GetOffsetSpace(int width);
bool HasDisk(int width); // used to check goal peg for Heuristic
bool operator == (Peg other);
private:
string pegChar = "||";
};
#endif //AI_PROJ2_PEG_H
| [
"claystamper@gmail.com"
] | claystamper@gmail.com |
6db92b15d7f65026feab830c3038c6deb27c8390 | 6515a1f37574522fa831e6daa2a3e8678b866756 | /src/esp/gfx/MaterialData.h | 018a9484fdd3ec893af18453701511b7349df8ba | [
"MIT"
] | permissive | ROAR-ROBOTICS/habitat-sim | 42a27f726146d966d3e5f3fae940c4bdcf6cdba9 | 7db914d23f462e4451ea4d84be4b39fcd47a1926 | refs/heads/master | 2022-12-30T15:14:20.450331 | 2020-10-15T22:30:03 | 2020-10-15T22:30:03 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,040 | h | // Copyright (c) Facebook, Inc. and its affiliates.
// This source code is licensed under the MIT license found in the
// LICENSE file in the root directory of this source tree.
#ifndef ESP_GFX_MATERIALDATA_H_
#define ESP_GFX_MATERIALDATA_H_
#include <Magnum/GL/Texture.h>
#include <Magnum/Magnum.h>
#include <Magnum/Math/Color.h>
#include <Magnum/Math/Matrix3.h>
#include "esp/core/esp.h"
namespace esp {
namespace gfx {
struct MaterialData {};
struct PhongMaterialData : public MaterialData {
Magnum::Float shininess = 80.f;
Magnum::Color4 ambientColor{0.1};
Magnum::Color4 diffuseColor{0.7};
Magnum::Color4 specularColor{0.2};
Magnum::Matrix3 textureMatrix;
Magnum::GL::Texture2D *ambientTexture = nullptr, *diffuseTexture = nullptr,
*specularTexture = nullptr, *normalTexture = nullptr;
bool perVertexObjectId = false, vertexColored = false;
ESP_SMART_POINTERS(PhongMaterialData)
};
// TODO: Ptex material data
} // namespace gfx
} // namespace esp
#endif // ESP_GFX_MATERIALDATA_H_
| [
"noreply@github.com"
] | noreply@github.com |
2f1cdb4fe30d949f86b2187ab9c0885e13fb87f4 | 76171660651f1c680d5b5a380c07635de5b2367c | /SH6_43mps/0.34/p | d6d2a26fb155f772c2267e5736d7db0697908ec1 | [] | no_license | lisegaAM/SH_Paper1 | 3cd0cac0d95cc60d296268e65e2dd6fed4cc6127 | 12ceadba5c58c563ccac236b965b4b917ac47551 | refs/heads/master | 2021-04-27T19:44:19.527187 | 2018-02-21T16:16:50 | 2018-02-21T16:16:50 | 122,360,661 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 166,000 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 3.0.x |
| \\ / A nd | Web: www.OpenFOAM.org |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class volScalarField;
location "0.34";
object p;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [1 -1 -2 0 0 0 0];
internalField nonuniform List<scalar>
13800
(
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80184e+07
1.80185e+07
1.8019e+07
1.80205e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80184e+07
1.80185e+07
1.8019e+07
1.80205e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80184e+07
1.80185e+07
1.8019e+07
1.80204e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80184e+07
1.80185e+07
1.80189e+07
1.80201e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80184e+07
1.80186e+07
1.80191e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80182e+07
1.80176e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80182e+07
1.80177e+07
1.80163e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80182e+07
1.80176e+07
1.80161e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80182e+07
1.80176e+07
1.8016e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80181e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80182e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80183e+07
1.80182e+07
1.80176e+07
1.8016e+07
1.80309e+07
1.80356e+07
1.80373e+07
1.80377e+07
1.80377e+07
1.80377e+07
1.80377e+07
1.80376e+07
1.80374e+07
1.80372e+07
1.8037e+07
1.80368e+07
1.80365e+07
1.80362e+07
1.80358e+07
1.80353e+07
1.80345e+07
1.80335e+07
1.80321e+07
1.80297e+07
1.80303e+07
1.80343e+07
1.80359e+07
1.80363e+07
1.80363e+07
1.80363e+07
1.80363e+07
1.80362e+07
1.8036e+07
1.80359e+07
1.80357e+07
1.80354e+07
1.80352e+07
1.80349e+07
1.80344e+07
1.80339e+07
1.80332e+07
1.80321e+07
1.80307e+07
1.80284e+07
1.80296e+07
1.80337e+07
1.80356e+07
1.80361e+07
1.80361e+07
1.80362e+07
1.80361e+07
1.8036e+07
1.80359e+07
1.80357e+07
1.80355e+07
1.80353e+07
1.8035e+07
1.80346e+07
1.80342e+07
1.80336e+07
1.80328e+07
1.80317e+07
1.80301e+07
1.80277e+07
1.8027e+07
1.80292e+07
1.80299e+07
1.80298e+07
1.80297e+07
1.80297e+07
1.80296e+07
1.80294e+07
1.80293e+07
1.80291e+07
1.80289e+07
1.80287e+07
1.80285e+07
1.80282e+07
1.80278e+07
1.80273e+07
1.80266e+07
1.80257e+07
1.80243e+07
1.80225e+07
1.80228e+07
1.80244e+07
1.80256e+07
1.80265e+07
1.80271e+07
1.80275e+07
1.80277e+07
1.80277e+07
1.80277e+07
1.80275e+07
1.80273e+07
1.8027e+07
1.80265e+07
1.8026e+07
1.80253e+07
1.80246e+07
1.80237e+07
1.80226e+07
1.80215e+07
1.80202e+07
1.80154e+07
1.80142e+07
1.80128e+07
1.80115e+07
1.80102e+07
1.80092e+07
1.80085e+07
1.8008e+07
1.80076e+07
1.80073e+07
1.80071e+07
1.8007e+07
1.80071e+07
1.80072e+07
1.80073e+07
1.80074e+07
1.80076e+07
1.80078e+07
1.80081e+07
1.80087e+07
1.80071e+07
1.80049e+07
1.80042e+07
1.80044e+07
1.80046e+07
1.80046e+07
1.80046e+07
1.80046e+07
1.80045e+07
1.80043e+07
1.80041e+07
1.80039e+07
1.80036e+07
1.80033e+07
1.80031e+07
1.8003e+07
1.80031e+07
1.80036e+07
1.80045e+07
1.80059e+07
1.79969e+07
1.79904e+07
1.79852e+07
1.79815e+07
1.7979e+07
1.79772e+07
1.79758e+07
1.79749e+07
1.79743e+07
1.79741e+07
1.79741e+07
1.79744e+07
1.7975e+07
1.79759e+07
1.79772e+07
1.79788e+07
1.79809e+07
1.79837e+07
1.79871e+07
1.79913e+07
1.79938e+07
1.79869e+07
1.79822e+07
1.79793e+07
1.79773e+07
1.79758e+07
1.79746e+07
1.79738e+07
1.79733e+07
1.7973e+07
1.7973e+07
1.79733e+07
1.79738e+07
1.79746e+07
1.79758e+07
1.79773e+07
1.79793e+07
1.79818e+07
1.79852e+07
1.79895e+07
1.79909e+07
1.7981e+07
1.79749e+07
1.79713e+07
1.79688e+07
1.79669e+07
1.79655e+07
1.79646e+07
1.7964e+07
1.79638e+07
1.79639e+07
1.79643e+07
1.79649e+07
1.79659e+07
1.79674e+07
1.79692e+07
1.79716e+07
1.79746e+07
1.79785e+07
1.79835e+07
1.80203e+07
1.80154e+07
1.8014e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80145e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80148e+07
1.80149e+07
1.8015e+07
1.8015e+07
1.80151e+07
1.80152e+07
1.80152e+07
1.80153e+07
1.80154e+07
1.80155e+07
1.80155e+07
1.80156e+07
1.80157e+07
1.80158e+07
1.80158e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80162e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.80123e+07
1.80102e+07
1.80199e+07
1.80153e+07
1.80139e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80145e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80148e+07
1.80149e+07
1.8015e+07
1.8015e+07
1.80151e+07
1.80152e+07
1.80152e+07
1.80153e+07
1.80154e+07
1.80155e+07
1.80155e+07
1.80156e+07
1.80157e+07
1.80158e+07
1.80158e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80162e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.80123e+07
1.80102e+07
1.802e+07
1.80155e+07
1.80141e+07
1.80137e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80145e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80148e+07
1.80149e+07
1.8015e+07
1.8015e+07
1.80151e+07
1.80152e+07
1.80152e+07
1.80153e+07
1.80154e+07
1.80155e+07
1.80155e+07
1.80156e+07
1.80157e+07
1.80158e+07
1.80158e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80162e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.80123e+07
1.80103e+07
1.80171e+07
1.8014e+07
1.80133e+07
1.80132e+07
1.80133e+07
1.80134e+07
1.80134e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80145e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80148e+07
1.80149e+07
1.8015e+07
1.8015e+07
1.80151e+07
1.80152e+07
1.80152e+07
1.80153e+07
1.80154e+07
1.80155e+07
1.80155e+07
1.80156e+07
1.80157e+07
1.80158e+07
1.80158e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80162e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80131e+07
1.80132e+07
1.80131e+07
1.80125e+07
1.80107e+07
1.8017e+07
1.80157e+07
1.8015e+07
1.80143e+07
1.80138e+07
1.80136e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80145e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80148e+07
1.80149e+07
1.8015e+07
1.8015e+07
1.80151e+07
1.80152e+07
1.80152e+07
1.80153e+07
1.80154e+07
1.80155e+07
1.80155e+07
1.80156e+07
1.80157e+07
1.80158e+07
1.80159e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80162e+07
1.80163e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80131e+07
1.80132e+07
1.80132e+07
1.80131e+07
1.80125e+07
1.80098e+07
1.80112e+07
1.8012e+07
1.80127e+07
1.80131e+07
1.80133e+07
1.80134e+07
1.80134e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80145e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80148e+07
1.80149e+07
1.8015e+07
1.8015e+07
1.80151e+07
1.80152e+07
1.80153e+07
1.80153e+07
1.80154e+07
1.80155e+07
1.80156e+07
1.80156e+07
1.80157e+07
1.80158e+07
1.80159e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80163e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80131e+07
1.80132e+07
1.80134e+07
1.80138e+07
1.80145e+07
1.80109e+07
1.80137e+07
1.8014e+07
1.80138e+07
1.80136e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80145e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80148e+07
1.80149e+07
1.8015e+07
1.8015e+07
1.80151e+07
1.80152e+07
1.80153e+07
1.80153e+07
1.80154e+07
1.80155e+07
1.80156e+07
1.80156e+07
1.80157e+07
1.80158e+07
1.80159e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80163e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80132e+07
1.80133e+07
1.80135e+07
1.80142e+07
1.80159e+07
1.80058e+07
1.80113e+07
1.80128e+07
1.80133e+07
1.80134e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80146e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80149e+07
1.80149e+07
1.8015e+07
1.80151e+07
1.80151e+07
1.80152e+07
1.80153e+07
1.80154e+07
1.80154e+07
1.80155e+07
1.80156e+07
1.80157e+07
1.80157e+07
1.80158e+07
1.80159e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80163e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80132e+07
1.80133e+07
1.80136e+07
1.80143e+07
1.80163e+07
1.80062e+07
1.80118e+07
1.8013e+07
1.80134e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80146e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80149e+07
1.80149e+07
1.8015e+07
1.80151e+07
1.80151e+07
1.80152e+07
1.80153e+07
1.80153e+07
1.80154e+07
1.80155e+07
1.80156e+07
1.80157e+07
1.80157e+07
1.80158e+07
1.80159e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80163e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80132e+07
1.80133e+07
1.80136e+07
1.80144e+07
1.80164e+07
1.80052e+07
1.80115e+07
1.8013e+07
1.80134e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80135e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80136e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80137e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80138e+07
1.80139e+07
1.80139e+07
1.80139e+07
1.8014e+07
1.8014e+07
1.8014e+07
1.80141e+07
1.80141e+07
1.80142e+07
1.80142e+07
1.80142e+07
1.80143e+07
1.80143e+07
1.80144e+07
1.80144e+07
1.80145e+07
1.80146e+07
1.80146e+07
1.80147e+07
1.80147e+07
1.80148e+07
1.80149e+07
1.80149e+07
1.8015e+07
1.80151e+07
1.80151e+07
1.80152e+07
1.80153e+07
1.80154e+07
1.80154e+07
1.80155e+07
1.80156e+07
1.80157e+07
1.80157e+07
1.80158e+07
1.80159e+07
1.80159e+07
1.8016e+07
1.80161e+07
1.80161e+07
1.80162e+07
1.80163e+07
1.80163e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80166e+07
1.80165e+07
1.80165e+07
1.80165e+07
1.80164e+07
1.80164e+07
1.80164e+07
1.80163e+07
1.80163e+07
1.80162e+07
1.80162e+07
1.80161e+07
1.8016e+07
1.8016e+07
1.80159e+07
1.80159e+07
1.80158e+07
1.80157e+07
1.80156e+07
1.80156e+07
1.80155e+07
1.80154e+07
1.80153e+07
1.80153e+07
1.80152e+07
1.80151e+07
1.8015e+07
1.80149e+07
1.80149e+07
1.80148e+07
1.80147e+07
1.80146e+07
1.80145e+07
1.80144e+07
1.80144e+07
1.80143e+07
1.80142e+07
1.80141e+07
1.8014e+07
1.8014e+07
1.80139e+07
1.80138e+07
1.80137e+07
1.80137e+07
1.80136e+07
1.80135e+07
1.80135e+07
1.80134e+07
1.80133e+07
1.80133e+07
1.80132e+07
1.80131e+07
1.80131e+07
1.8013e+07
1.8013e+07
1.80129e+07
1.80129e+07
1.80128e+07
1.80128e+07
1.80127e+07
1.80127e+07
1.80126e+07
1.80126e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80122e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80123e+07
1.80124e+07
1.80124e+07
1.80124e+07
1.80125e+07
1.80125e+07
1.80125e+07
1.80126e+07
1.80126e+07
1.80127e+07
1.80127e+07
1.80128e+07
1.80128e+07
1.80129e+07
1.8013e+07
1.80131e+07
1.80132e+07
1.80133e+07
1.80136e+07
1.80144e+07
1.80164e+07
1.7988e+07
1.79776e+07
1.79712e+07
1.79675e+07
1.79648e+07
1.79628e+07
1.79613e+07
1.79604e+07
1.79598e+07
1.79596e+07
1.79596e+07
1.796e+07
1.79607e+07
1.79617e+07
1.79632e+07
1.79651e+07
1.79675e+07
1.79705e+07
1.79745e+07
1.79797e+07
1.79906e+07
1.79833e+07
1.79784e+07
1.79754e+07
1.79732e+07
1.79716e+07
1.79703e+07
1.79695e+07
1.79689e+07
1.79687e+07
1.79687e+07
1.7969e+07
1.79695e+07
1.79703e+07
1.79715e+07
1.79731e+07
1.79752e+07
1.79778e+07
1.79812e+07
1.79856e+07
1.79935e+07
1.79868e+07
1.79814e+07
1.79776e+07
1.79749e+07
1.7973e+07
1.79716e+07
1.79706e+07
1.797e+07
1.79698e+07
1.79698e+07
1.79701e+07
1.79707e+07
1.79716e+07
1.79729e+07
1.79746e+07
1.79768e+07
1.79796e+07
1.79831e+07
1.79874e+07
1.80029e+07
1.80006e+07
1.79998e+07
1.79999e+07
1.80001e+07
1.80002e+07
1.80001e+07
1.80001e+07
1.8e+07
1.79999e+07
1.79997e+07
1.79994e+07
1.79992e+07
1.7999e+07
1.79988e+07
1.79988e+07
1.79989e+07
1.79993e+07
1.80003e+07
1.80017e+07
1.80108e+07
1.80097e+07
1.80084e+07
1.8007e+07
1.80057e+07
1.80047e+07
1.8004e+07
1.80035e+07
1.80031e+07
1.80029e+07
1.80027e+07
1.80026e+07
1.80028e+07
1.80029e+07
1.8003e+07
1.80031e+07
1.80033e+07
1.80036e+07
1.8004e+07
1.80045e+07
1.80177e+07
1.80194e+07
1.80207e+07
1.80216e+07
1.80224e+07
1.80228e+07
1.8023e+07
1.80231e+07
1.80231e+07
1.8023e+07
1.80228e+07
1.80225e+07
1.8022e+07
1.80215e+07
1.80209e+07
1.80202e+07
1.80193e+07
1.80183e+07
1.80172e+07
1.8016e+07
1.80218e+07
1.80241e+07
1.80249e+07
1.8025e+07
1.80249e+07
1.80249e+07
1.80249e+07
1.80248e+07
1.80247e+07
1.80245e+07
1.80244e+07
1.80242e+07
1.8024e+07
1.80237e+07
1.80234e+07
1.80229e+07
1.80223e+07
1.80214e+07
1.80201e+07
1.80182e+07
1.80243e+07
1.80285e+07
1.80306e+07
1.80312e+07
1.80313e+07
1.80314e+07
1.80314e+07
1.80314e+07
1.80312e+07
1.80311e+07
1.80309e+07
1.80307e+07
1.80304e+07
1.80301e+07
1.80297e+07
1.80292e+07
1.80284e+07
1.80274e+07
1.80258e+07
1.80234e+07
1.8025e+07
1.80291e+07
1.80309e+07
1.80314e+07
1.80315e+07
1.80315e+07
1.80316e+07
1.80315e+07
1.80314e+07
1.80312e+07
1.80311e+07
1.80309e+07
1.80306e+07
1.80304e+07
1.803e+07
1.80295e+07
1.80288e+07
1.80278e+07
1.80264e+07
1.80241e+07
1.80257e+07
1.80305e+07
1.80323e+07
1.80328e+07
1.80329e+07
1.80329e+07
1.80329e+07
1.80329e+07
1.80327e+07
1.80326e+07
1.80324e+07
1.80322e+07
1.8032e+07
1.80317e+07
1.80313e+07
1.80308e+07
1.80301e+07
1.80292e+07
1.80277e+07
1.80254e+07
1.80011e+07
1.80075e+07
1.80091e+07
1.80097e+07
1.80099e+07
1.80101e+07
1.80102e+07
1.80104e+07
1.80106e+07
1.80107e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.8031e+07
1.80317e+07
1.80325e+07
1.80333e+07
1.80341e+07
1.80349e+07
1.80357e+07
1.80366e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80723e+07
1.80735e+07
1.8074e+07
1.80733e+07
1.80021e+07
1.80077e+07
1.80092e+07
1.80097e+07
1.80099e+07
1.80101e+07
1.80102e+07
1.80104e+07
1.80106e+07
1.80107e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.8031e+07
1.80317e+07
1.80325e+07
1.80333e+07
1.80341e+07
1.80349e+07
1.80357e+07
1.80366e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80723e+07
1.80735e+07
1.8074e+07
1.80733e+07
1.80016e+07
1.80073e+07
1.80089e+07
1.80096e+07
1.80099e+07
1.80101e+07
1.80102e+07
1.80104e+07
1.80106e+07
1.80107e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.8031e+07
1.80317e+07
1.80325e+07
1.80333e+07
1.80341e+07
1.80349e+07
1.80357e+07
1.80366e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80723e+07
1.80735e+07
1.80741e+07
1.80734e+07
1.80068e+07
1.80097e+07
1.80102e+07
1.80101e+07
1.80101e+07
1.80102e+07
1.80103e+07
1.80104e+07
1.80106e+07
1.80107e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.80309e+07
1.80317e+07
1.80325e+07
1.80333e+07
1.80341e+07
1.80349e+07
1.80357e+07
1.80365e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80723e+07
1.80735e+07
1.80742e+07
1.80738e+07
1.80057e+07
1.80072e+07
1.80081e+07
1.80089e+07
1.80095e+07
1.80099e+07
1.80101e+07
1.80103e+07
1.80105e+07
1.80107e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.80309e+07
1.80317e+07
1.80325e+07
1.80332e+07
1.8034e+07
1.80349e+07
1.80357e+07
1.80365e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80724e+07
1.80737e+07
1.80748e+07
1.80755e+07
1.8013e+07
1.80118e+07
1.80112e+07
1.80106e+07
1.80103e+07
1.80102e+07
1.80103e+07
1.80104e+07
1.80106e+07
1.80108e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.80309e+07
1.80317e+07
1.80325e+07
1.80332e+07
1.8034e+07
1.80349e+07
1.80357e+07
1.80365e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80724e+07
1.80738e+07
1.80754e+07
1.80774e+07
1.80132e+07
1.80102e+07
1.80094e+07
1.80095e+07
1.80097e+07
1.801e+07
1.80102e+07
1.80104e+07
1.80105e+07
1.80107e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.80309e+07
1.80317e+07
1.80324e+07
1.80332e+07
1.8034e+07
1.80348e+07
1.80357e+07
1.80365e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80725e+07
1.8074e+07
1.80759e+07
1.80787e+07
1.8016e+07
1.80116e+07
1.80103e+07
1.801e+07
1.801e+07
1.80101e+07
1.80102e+07
1.80104e+07
1.80106e+07
1.80107e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.80309e+07
1.80317e+07
1.80325e+07
1.80332e+07
1.8034e+07
1.80348e+07
1.80357e+07
1.80365e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80725e+07
1.8074e+07
1.8076e+07
1.80791e+07
1.8016e+07
1.80114e+07
1.80101e+07
1.80099e+07
1.80099e+07
1.801e+07
1.80102e+07
1.80104e+07
1.80106e+07
1.80107e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.80309e+07
1.80317e+07
1.80325e+07
1.80332e+07
1.8034e+07
1.80348e+07
1.80357e+07
1.80365e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80725e+07
1.8074e+07
1.8076e+07
1.80791e+07
1.80164e+07
1.80115e+07
1.80102e+07
1.80099e+07
1.80099e+07
1.80101e+07
1.80102e+07
1.80104e+07
1.80106e+07
1.80107e+07
1.80109e+07
1.80111e+07
1.80113e+07
1.80116e+07
1.80118e+07
1.8012e+07
1.80122e+07
1.80125e+07
1.80127e+07
1.8013e+07
1.80133e+07
1.80136e+07
1.80139e+07
1.80142e+07
1.80145e+07
1.80148e+07
1.80151e+07
1.80155e+07
1.80158e+07
1.80162e+07
1.80166e+07
1.8017e+07
1.80174e+07
1.80178e+07
1.80182e+07
1.80186e+07
1.80191e+07
1.80195e+07
1.802e+07
1.80205e+07
1.8021e+07
1.80215e+07
1.8022e+07
1.80226e+07
1.80231e+07
1.80237e+07
1.80243e+07
1.80249e+07
1.80255e+07
1.80261e+07
1.80268e+07
1.80274e+07
1.80281e+07
1.80288e+07
1.80295e+07
1.80302e+07
1.80309e+07
1.80317e+07
1.80325e+07
1.80332e+07
1.8034e+07
1.80348e+07
1.80357e+07
1.80365e+07
1.80374e+07
1.80383e+07
1.80392e+07
1.80401e+07
1.8041e+07
1.80419e+07
1.80429e+07
1.80438e+07
1.80448e+07
1.80458e+07
1.80468e+07
1.80478e+07
1.80488e+07
1.80499e+07
1.80509e+07
1.8052e+07
1.80531e+07
1.80542e+07
1.80553e+07
1.80564e+07
1.80576e+07
1.80587e+07
1.80599e+07
1.80611e+07
1.80623e+07
1.80635e+07
1.80647e+07
1.8066e+07
1.80672e+07
1.80685e+07
1.80698e+07
1.80711e+07
1.80725e+07
1.8074e+07
1.8076e+07
1.80792e+07
1.80542e+07
1.8045e+07
1.80394e+07
1.80362e+07
1.8034e+07
1.80325e+07
1.80315e+07
1.80309e+07
1.80307e+07
1.80309e+07
1.80313e+07
1.8032e+07
1.80329e+07
1.80342e+07
1.80359e+07
1.80379e+07
1.80404e+07
1.80435e+07
1.80475e+07
1.80524e+07
1.80566e+07
1.80502e+07
1.8046e+07
1.80435e+07
1.80417e+07
1.80406e+07
1.80398e+07
1.80393e+07
1.80391e+07
1.80393e+07
1.80396e+07
1.80402e+07
1.8041e+07
1.80421e+07
1.80435e+07
1.80453e+07
1.80474e+07
1.80501e+07
1.80535e+07
1.80577e+07
1.80592e+07
1.80533e+07
1.80486e+07
1.80454e+07
1.80432e+07
1.80418e+07
1.80408e+07
1.80402e+07
1.804e+07
1.80402e+07
1.80405e+07
1.80411e+07
1.8042e+07
1.80432e+07
1.80447e+07
1.80466e+07
1.80489e+07
1.80518e+07
1.80552e+07
1.80594e+07
1.80678e+07
1.8066e+07
1.80656e+07
1.80661e+07
1.80666e+07
1.80669e+07
1.80672e+07
1.80674e+07
1.80677e+07
1.80678e+07
1.8068e+07
1.80681e+07
1.80682e+07
1.80682e+07
1.80684e+07
1.80686e+07
1.8069e+07
1.80698e+07
1.80709e+07
1.80725e+07
1.80748e+07
1.8074e+07
1.80731e+07
1.80721e+07
1.80713e+07
1.80706e+07
1.80703e+07
1.80702e+07
1.80702e+07
1.80703e+07
1.80705e+07
1.80708e+07
1.80712e+07
1.80716e+07
1.8072e+07
1.80725e+07
1.8073e+07
1.80736e+07
1.80742e+07
1.80751e+07
1.80811e+07
1.8083e+07
1.80845e+07
1.80857e+07
1.80867e+07
1.80875e+07
1.8088e+07
1.80884e+07
1.80886e+07
1.80888e+07
1.80889e+07
1.80889e+07
1.80889e+07
1.80888e+07
1.80886e+07
1.80882e+07
1.80877e+07
1.80871e+07
1.80865e+07
1.80856e+07
1.80847e+07
1.80872e+07
1.80882e+07
1.80886e+07
1.80889e+07
1.80892e+07
1.80895e+07
1.80897e+07
1.80899e+07
1.80901e+07
1.80903e+07
1.80904e+07
1.80906e+07
1.80907e+07
1.80907e+07
1.80906e+07
1.80903e+07
1.80898e+07
1.8089e+07
1.80877e+07
1.80871e+07
1.80913e+07
1.80935e+07
1.80944e+07
1.80948e+07
1.80952e+07
1.80955e+07
1.80958e+07
1.8096e+07
1.80961e+07
1.80963e+07
1.80964e+07
1.80965e+07
1.80966e+07
1.80965e+07
1.80963e+07
1.8096e+07
1.80953e+07
1.80943e+07
1.80924e+07
1.80876e+07
1.80918e+07
1.80938e+07
1.80945e+07
1.80949e+07
1.80953e+07
1.80956e+07
1.80959e+07
1.80961e+07
1.80963e+07
1.80964e+07
1.80966e+07
1.80967e+07
1.80967e+07
1.80967e+07
1.80966e+07
1.80963e+07
1.80957e+07
1.80948e+07
1.80931e+07
1.80883e+07
1.80931e+07
1.80951e+07
1.80958e+07
1.80962e+07
1.80966e+07
1.80969e+07
1.80972e+07
1.80974e+07
1.80975e+07
1.80977e+07
1.80978e+07
1.80979e+07
1.8098e+07
1.8098e+07
1.80978e+07
1.80975e+07
1.8097e+07
1.8096e+07
1.80943e+07
1.80731e+07
1.80801e+07
1.80829e+07
1.80848e+07
1.80864e+07
1.8088e+07
1.80895e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81415e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81604e+07
1.81625e+07
1.81648e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81785e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81954e+07
1.81979e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.82081e+07
1.82107e+07
1.82133e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.86742e+07
1.86784e+07
1.86829e+07
1.8074e+07
1.80803e+07
1.80829e+07
1.80848e+07
1.80864e+07
1.8088e+07
1.80895e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81415e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81604e+07
1.81625e+07
1.81648e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81785e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81954e+07
1.81979e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.82081e+07
1.82107e+07
1.82133e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.86742e+07
1.86784e+07
1.86829e+07
1.80735e+07
1.80799e+07
1.80828e+07
1.80847e+07
1.80864e+07
1.8088e+07
1.80895e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81415e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81604e+07
1.81625e+07
1.81648e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81785e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81954e+07
1.81979e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.82081e+07
1.82107e+07
1.82133e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.86741e+07
1.86784e+07
1.86829e+07
1.80782e+07
1.8082e+07
1.80838e+07
1.80852e+07
1.80866e+07
1.8088e+07
1.80896e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81414e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81603e+07
1.81625e+07
1.81648e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81785e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81954e+07
1.81979e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.82081e+07
1.82106e+07
1.82133e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.86741e+07
1.86784e+07
1.86828e+07
1.8077e+07
1.80798e+07
1.8082e+07
1.80841e+07
1.8086e+07
1.80878e+07
1.80894e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81415e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81603e+07
1.81625e+07
1.81648e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81785e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81954e+07
1.81979e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.8208e+07
1.82106e+07
1.82133e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.86741e+07
1.86783e+07
1.86825e+07
1.80837e+07
1.8084e+07
1.80847e+07
1.80856e+07
1.80867e+07
1.80881e+07
1.80896e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81414e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81603e+07
1.81625e+07
1.81647e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81784e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81954e+07
1.81979e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.8208e+07
1.82106e+07
1.82133e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.86741e+07
1.86781e+07
1.8682e+07
1.80837e+07
1.80824e+07
1.80832e+07
1.80847e+07
1.80863e+07
1.80879e+07
1.80895e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81414e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81603e+07
1.81625e+07
1.81648e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81784e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81953e+07
1.81978e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.8208e+07
1.82106e+07
1.82132e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.8674e+07
1.8678e+07
1.86817e+07
1.80863e+07
1.80837e+07
1.80839e+07
1.8085e+07
1.80865e+07
1.8088e+07
1.80895e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81414e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81603e+07
1.81625e+07
1.81648e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81784e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81953e+07
1.81978e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.8208e+07
1.82106e+07
1.82133e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.8674e+07
1.86779e+07
1.86816e+07
1.80863e+07
1.80835e+07
1.80838e+07
1.8085e+07
1.80864e+07
1.80879e+07
1.80895e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81414e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81603e+07
1.81625e+07
1.81648e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81784e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81953e+07
1.81978e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.8208e+07
1.82106e+07
1.82133e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.8674e+07
1.86779e+07
1.86816e+07
1.80867e+07
1.80836e+07
1.80838e+07
1.8085e+07
1.80864e+07
1.80879e+07
1.80895e+07
1.80911e+07
1.80927e+07
1.80943e+07
1.80959e+07
1.80976e+07
1.80992e+07
1.81009e+07
1.81026e+07
1.81043e+07
1.8106e+07
1.81077e+07
1.81095e+07
1.81112e+07
1.8113e+07
1.81148e+07
1.81166e+07
1.81184e+07
1.81202e+07
1.81221e+07
1.8124e+07
1.81258e+07
1.81277e+07
1.81296e+07
1.81316e+07
1.81335e+07
1.81355e+07
1.81374e+07
1.81394e+07
1.81414e+07
1.81435e+07
1.81455e+07
1.81476e+07
1.81497e+07
1.81518e+07
1.81539e+07
1.8156e+07
1.81582e+07
1.81603e+07
1.81625e+07
1.81648e+07
1.8167e+07
1.81692e+07
1.81715e+07
1.81738e+07
1.81761e+07
1.81784e+07
1.81808e+07
1.81832e+07
1.81856e+07
1.8188e+07
1.81904e+07
1.81929e+07
1.81953e+07
1.81978e+07
1.82004e+07
1.82029e+07
1.82055e+07
1.8208e+07
1.82106e+07
1.82133e+07
1.82159e+07
1.82185e+07
1.82212e+07
1.82239e+07
1.82266e+07
1.82293e+07
1.8232e+07
1.82348e+07
1.82376e+07
1.82404e+07
1.82432e+07
1.8246e+07
1.82489e+07
1.82517e+07
1.82546e+07
1.82575e+07
1.82605e+07
1.82634e+07
1.82664e+07
1.82693e+07
1.82723e+07
1.82754e+07
1.82784e+07
1.82814e+07
1.82845e+07
1.82876e+07
1.82907e+07
1.82938e+07
1.8297e+07
1.83001e+07
1.83033e+07
1.83065e+07
1.83097e+07
1.83129e+07
1.83161e+07
1.83194e+07
1.83226e+07
1.83259e+07
1.83292e+07
1.83325e+07
1.83358e+07
1.83391e+07
1.83425e+07
1.83458e+07
1.83492e+07
1.83526e+07
1.8356e+07
1.83594e+07
1.83628e+07
1.83662e+07
1.83697e+07
1.83731e+07
1.83766e+07
1.838e+07
1.83835e+07
1.8387e+07
1.83905e+07
1.8394e+07
1.83976e+07
1.84011e+07
1.84046e+07
1.84082e+07
1.84118e+07
1.84153e+07
1.84189e+07
1.84225e+07
1.84261e+07
1.84297e+07
1.84333e+07
1.8437e+07
1.84406e+07
1.84442e+07
1.84479e+07
1.84516e+07
1.84552e+07
1.84589e+07
1.84626e+07
1.84663e+07
1.847e+07
1.84737e+07
1.84774e+07
1.84812e+07
1.84849e+07
1.84887e+07
1.84924e+07
1.84962e+07
1.85e+07
1.85038e+07
1.85075e+07
1.85113e+07
1.85152e+07
1.8519e+07
1.85228e+07
1.85266e+07
1.85305e+07
1.85343e+07
1.85382e+07
1.85421e+07
1.8546e+07
1.85498e+07
1.85537e+07
1.85576e+07
1.85616e+07
1.85655e+07
1.85694e+07
1.85733e+07
1.85773e+07
1.85812e+07
1.85852e+07
1.85892e+07
1.85932e+07
1.85971e+07
1.86011e+07
1.86051e+07
1.86091e+07
1.86132e+07
1.86172e+07
1.86212e+07
1.86252e+07
1.86293e+07
1.86333e+07
1.86374e+07
1.86414e+07
1.86455e+07
1.86496e+07
1.86536e+07
1.86577e+07
1.86618e+07
1.86659e+07
1.867e+07
1.8674e+07
1.86779e+07
1.86816e+07
1.86879e+07
1.86903e+07
1.86918e+07
1.86929e+07
1.86939e+07
1.86949e+07
1.86958e+07
1.86968e+07
1.86977e+07
1.86987e+07
1.86997e+07
1.87005e+07
1.87015e+07
1.87023e+07
1.87032e+07
1.8704e+07
1.87048e+07
1.87056e+07
1.87062e+07
1.87067e+07
1.86877e+07
1.86899e+07
1.86914e+07
1.86925e+07
1.86935e+07
1.86945e+07
1.86955e+07
1.86964e+07
1.86974e+07
1.86983e+07
1.86993e+07
1.87002e+07
1.87011e+07
1.8702e+07
1.87028e+07
1.87037e+07
1.87045e+07
1.87052e+07
1.87059e+07
1.87064e+07
1.86875e+07
1.86898e+07
1.86914e+07
1.86925e+07
1.86935e+07
1.86945e+07
1.86955e+07
1.86964e+07
1.86973e+07
1.86983e+07
1.86993e+07
1.87001e+07
1.87011e+07
1.87019e+07
1.87028e+07
1.87036e+07
1.87044e+07
1.87051e+07
1.87057e+07
1.87062e+07
1.86867e+07
1.86883e+07
1.86895e+07
1.86905e+07
1.86915e+07
1.86925e+07
1.86935e+07
1.86945e+07
1.86954e+07
1.86964e+07
1.86974e+07
1.86982e+07
1.86992e+07
1.87001e+07
1.8701e+07
1.87018e+07
1.87026e+07
1.87033e+07
1.8704e+07
1.87045e+07
1.86861e+07
1.86877e+07
1.86891e+07
1.86904e+07
1.86916e+07
1.86926e+07
1.86936e+07
1.86945e+07
1.86955e+07
1.86963e+07
1.86973e+07
1.86981e+07
1.86989e+07
1.86997e+07
1.87006e+07
1.87013e+07
1.87021e+07
1.87028e+07
1.87035e+07
1.87042e+07
1.86839e+07
1.86844e+07
1.86848e+07
1.86853e+07
1.86859e+07
1.86866e+07
1.86874e+07
1.86883e+07
1.86893e+07
1.86902e+07
1.86912e+07
1.86922e+07
1.86932e+07
1.86942e+07
1.86952e+07
1.86962e+07
1.86972e+07
1.86983e+07
1.86993e+07
1.87004e+07
1.86825e+07
1.86829e+07
1.86838e+07
1.86849e+07
1.86859e+07
1.86868e+07
1.86877e+07
1.86886e+07
1.86894e+07
1.86903e+07
1.8691e+07
1.8692e+07
1.86928e+07
1.86937e+07
1.86946e+07
1.86954e+07
1.86964e+07
1.86974e+07
1.86986e+07
1.86998e+07
1.86796e+07
1.86785e+07
1.86777e+07
1.86774e+07
1.86776e+07
1.8678e+07
1.86787e+07
1.86794e+07
1.86803e+07
1.86812e+07
1.86823e+07
1.86835e+07
1.86846e+07
1.86859e+07
1.86872e+07
1.86887e+07
1.86902e+07
1.86919e+07
1.86937e+07
1.86956e+07
1.86788e+07
1.86777e+07
1.86772e+07
1.86772e+07
1.86774e+07
1.8678e+07
1.86786e+07
1.86794e+07
1.86802e+07
1.86812e+07
1.86822e+07
1.86833e+07
1.86844e+07
1.86857e+07
1.8687e+07
1.86883e+07
1.86898e+07
1.86914e+07
1.86932e+07
1.86952e+07
1.8678e+07
1.86759e+07
1.8675e+07
1.86747e+07
1.86749e+07
1.86753e+07
1.86759e+07
1.86767e+07
1.86775e+07
1.86785e+07
1.86796e+07
1.86807e+07
1.86819e+07
1.86832e+07
1.86846e+07
1.86861e+07
1.86877e+07
1.86895e+07
1.86914e+07
1.86936e+07
1.87067e+07
1.87108e+07
1.87158e+07
1.87209e+07
1.87262e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88373e+07
1.88426e+07
1.88479e+07
1.88531e+07
1.88584e+07
1.88636e+07
1.88689e+07
1.88741e+07
1.88794e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89157e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89363e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
1.87066e+07
1.87107e+07
1.87157e+07
1.87209e+07
1.87262e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88373e+07
1.88426e+07
1.88479e+07
1.88531e+07
1.88584e+07
1.88636e+07
1.88689e+07
1.88741e+07
1.88794e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89157e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89363e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
1.87066e+07
1.87108e+07
1.87158e+07
1.87209e+07
1.87262e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88373e+07
1.88426e+07
1.88479e+07
1.88531e+07
1.88584e+07
1.88636e+07
1.88689e+07
1.88741e+07
1.88794e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89157e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89363e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
1.87058e+07
1.87104e+07
1.87156e+07
1.87209e+07
1.87261e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88373e+07
1.88426e+07
1.88479e+07
1.88531e+07
1.88584e+07
1.88636e+07
1.88689e+07
1.88741e+07
1.88794e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89157e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89363e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
1.87062e+07
1.87109e+07
1.87159e+07
1.8721e+07
1.87262e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88373e+07
1.88426e+07
1.88479e+07
1.88531e+07
1.88584e+07
1.88636e+07
1.88689e+07
1.88741e+07
1.88793e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89157e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89363e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
1.87041e+07
1.87099e+07
1.87154e+07
1.87208e+07
1.87261e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88374e+07
1.88426e+07
1.88479e+07
1.88531e+07
1.88584e+07
1.88636e+07
1.88689e+07
1.88741e+07
1.88794e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89158e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89363e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
1.87049e+07
1.87104e+07
1.87157e+07
1.87209e+07
1.87261e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88373e+07
1.88426e+07
1.88479e+07
1.88531e+07
1.88584e+07
1.88636e+07
1.88689e+07
1.88741e+07
1.88794e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89158e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89364e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
1.87037e+07
1.871e+07
1.87155e+07
1.87208e+07
1.87261e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88374e+07
1.88426e+07
1.88479e+07
1.88532e+07
1.88584e+07
1.88637e+07
1.88689e+07
1.88741e+07
1.88794e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89158e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89364e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
1.87038e+07
1.871e+07
1.87155e+07
1.87209e+07
1.87261e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88374e+07
1.88426e+07
1.88479e+07
1.88531e+07
1.88584e+07
1.88637e+07
1.88689e+07
1.88741e+07
1.88794e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89158e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89364e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
1.87036e+07
1.871e+07
1.87155e+07
1.87208e+07
1.87261e+07
1.87314e+07
1.87367e+07
1.8742e+07
1.87473e+07
1.87526e+07
1.87579e+07
1.87632e+07
1.87685e+07
1.87738e+07
1.87791e+07
1.87844e+07
1.87897e+07
1.8795e+07
1.88003e+07
1.88056e+07
1.88109e+07
1.88162e+07
1.88215e+07
1.88268e+07
1.88321e+07
1.88374e+07
1.88426e+07
1.88479e+07
1.88532e+07
1.88584e+07
1.88637e+07
1.88689e+07
1.88741e+07
1.88794e+07
1.88846e+07
1.88898e+07
1.8895e+07
1.89002e+07
1.89054e+07
1.89106e+07
1.89158e+07
1.89209e+07
1.89261e+07
1.89312e+07
1.89364e+07
1.89415e+07
1.89466e+07
1.89517e+07
1.89567e+07
1.89618e+07
1.89668e+07
1.89718e+07
1.89768e+07
1.89818e+07
1.89868e+07
1.89917e+07
1.89967e+07
1.90016e+07
1.90065e+07
1.90114e+07
1.90162e+07
1.90211e+07
1.90259e+07
1.90307e+07
1.90355e+07
1.90403e+07
1.90451e+07
1.90498e+07
1.90545e+07
1.90592e+07
1.90639e+07
1.90686e+07
1.90732e+07
1.90779e+07
1.90825e+07
1.90871e+07
1.90916e+07
1.90962e+07
1.91007e+07
1.91053e+07
1.91097e+07
1.91142e+07
1.91187e+07
1.91231e+07
1.91275e+07
1.91319e+07
1.91363e+07
1.91406e+07
1.91449e+07
1.91492e+07
1.91535e+07
1.91577e+07
1.9162e+07
1.91662e+07
1.91703e+07
1.91745e+07
1.91786e+07
1.91827e+07
1.91868e+07
1.91908e+07
1.91948e+07
1.91988e+07
1.92027e+07
1.92067e+07
1.92106e+07
1.92144e+07
1.92182e+07
1.9222e+07
1.92258e+07
1.92295e+07
1.92332e+07
1.92369e+07
1.92405e+07
1.92441e+07
1.92477e+07
1.92512e+07
1.92547e+07
1.92582e+07
1.92616e+07
1.9265e+07
1.92684e+07
1.92717e+07
1.9275e+07
1.92782e+07
1.92814e+07
1.92846e+07
1.92878e+07
1.92909e+07
1.92939e+07
1.9297e+07
1.93e+07
1.9303e+07
1.93059e+07
1.93088e+07
1.93117e+07
1.93145e+07
1.93173e+07
1.93201e+07
1.93228e+07
1.93256e+07
1.93282e+07
1.93309e+07
1.93335e+07
1.93361e+07
1.93386e+07
1.93412e+07
1.93437e+07
1.93461e+07
1.93485e+07
1.9351e+07
1.93533e+07
1.93557e+07
1.9358e+07
1.93603e+07
1.93625e+07
1.93648e+07
1.9367e+07
1.93691e+07
1.93713e+07
1.93734e+07
1.93755e+07
1.93776e+07
1.93796e+07
1.93816e+07
1.93836e+07
1.93855e+07
1.93874e+07
1.93893e+07
1.93912e+07
1.9393e+07
1.93948e+07
1.93966e+07
1.93984e+07
1.94001e+07
1.94018e+07
1.94035e+07
1.94051e+07
1.94067e+07
1.94083e+07
1.94098e+07
1.94114e+07
1.94129e+07
1.94143e+07
1.94158e+07
1.94172e+07
1.94186e+07
1.94199e+07
1.94212e+07
1.94225e+07
1.94238e+07
1.9425e+07
1.94262e+07
1.94274e+07
1.94285e+07
1.94297e+07
1.94308e+07
1.94318e+07
1.94329e+07
1.94339e+07
1.94348e+07
1.94358e+07
1.94367e+07
1.94376e+07
1.94385e+07
1.94393e+07
1.94401e+07
1.94409e+07
1.94416e+07
1.94424e+07
1.94431e+07
1.94438e+07
1.94444e+07
1.9445e+07
1.94456e+07
1.94462e+07
1.94468e+07
1.94473e+07
1.94478e+07
1.94482e+07
1.94487e+07
1.94491e+07
1.94496e+07
1.94499e+07
1.94503e+07
1.94507e+07
1.9451e+07
1.94513e+07
1.94517e+07
1.94519e+07
1.94522e+07
1.94525e+07
1.94527e+07
1.9453e+07
1.94532e+07
1.94534e+07
1.94536e+07
1.94538e+07
1.9454e+07
1.94542e+07
1.94544e+07
1.94546e+07
1.94547e+07
1.94549e+07
1.94551e+07
1.94552e+07
1.94554e+07
1.94555e+07
1.94557e+07
1.94558e+07
1.94559e+07
1.94561e+07
1.94562e+07
1.94563e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94584e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94585e+07
1.94585e+07
1.94585e+07
1.94584e+07
1.94584e+07
1.94583e+07
1.94583e+07
1.94582e+07
1.94581e+07
1.94581e+07
1.9458e+07
1.94579e+07
1.94579e+07
1.94578e+07
1.94577e+07
1.94576e+07
1.94575e+07
1.94575e+07
1.94574e+07
1.94573e+07
1.94572e+07
1.94572e+07
1.94571e+07
1.9457e+07
1.94569e+07
1.94569e+07
1.94568e+07
1.94567e+07
1.94566e+07
1.94566e+07
1.94565e+07
1.94565e+07
1.94564e+07
1.94564e+07
1.94563e+07
1.94563e+07
1.94562e+07
1.94562e+07
1.94561e+07
1.94561e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94556e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94557e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94558e+07
1.94559e+07
1.94559e+07
1.94559e+07
1.9456e+07
1.9456e+07
1.9456e+07
1.94561e+07
1.94561e+07
1.94562e+07
1.94562e+07
1.94563e+07
1.94563e+07
1.94564e+07
1.94565e+07
1.94565e+07
1.94566e+07
1.94567e+07
1.94567e+07
1.94568e+07
1.94569e+07
1.9457e+07
1.94571e+07
1.94572e+07
1.94573e+07
1.94574e+07
1.94575e+07
1.94576e+07
1.94577e+07
1.94578e+07
1.94579e+07
1.9458e+07
1.94581e+07
1.94582e+07
1.94583e+07
1.94584e+07
1.94585e+07
1.94587e+07
1.94588e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94603e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94601e+07
1.94601e+07
1.946e+07
1.946e+07
1.946e+07
1.946e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94598e+07
1.94598e+07
1.94598e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.94599e+07
1.946e+07
1.946e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94602e+07
1.94602e+07
1.94603e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94608e+07
1.94607e+07
1.94607e+07
1.94607e+07
1.94606e+07
1.94605e+07
1.94605e+07
1.94604e+07
1.94604e+07
1.94603e+07
1.94602e+07
1.94601e+07
1.946e+07
1.946e+07
1.94599e+07
1.94598e+07
1.94597e+07
1.94596e+07
1.94595e+07
1.94594e+07
1.94594e+07
1.94593e+07
1.94592e+07
1.94591e+07
1.9459e+07
1.9459e+07
1.94589e+07
1.94588e+07
1.94588e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94586e+07
1.94587e+07
1.94587e+07
1.94587e+07
1.94588e+07
1.94588e+07
1.94589e+07
1.94589e+07
1.9459e+07
1.94591e+07
1.94591e+07
1.94592e+07
1.94593e+07
1.94594e+07
1.94594e+07
1.94595e+07
1.94596e+07
1.94597e+07
1.94597e+07
1.94598e+07
1.94599e+07
1.946e+07
1.94601e+07
1.94601e+07
1.94602e+07
1.94603e+07
1.94604e+07
1.94604e+07
1.94605e+07
1.94606e+07
1.94606e+07
1.94607e+07
1.94608e+07
1.94608e+07
1.94609e+07
1.94609e+07
1.9461e+07
1.9461e+07
1.94611e+07
1.94611e+07
1.94612e+07
1.94612e+07
1.94612e+07
1.94613e+07
1.94613e+07
1.94614e+07
1.94614e+07
1.94614e+07
1.94615e+07
1.94615e+07
1.94615e+07
1.94616e+07
1.94616e+07
)
;
boundaryField
{
inlet
{
type zeroGradient;
}
outlet
{
type uniformTotalPressure;
rho none;
psi none;
gamma 1.4364;
pressure tableFile;
pressureCoeffs
{
fileName "$FOAM_RUN/SH5_43mps_MFR_newBC/outlet0.2_42.7mps_fromCapture.dat";
}
value nonuniform List<scalar> 10(1.94616e+07 1.94616e+07 1.94616e+07 1.94616e+07 1.94616e+07 1.94616e+07 1.94616e+07 1.94616e+07 1.94616e+07 1.94616e+07);
}
sides
{
type empty;
}
walls
{
type zeroGradient;
}
}
// ************************************************************************* //
| [
"alexmayes@gmail.com"
] | alexmayes@gmail.com | |
2dfee31cd083b26534786af3647d20e2dba8c417 | 16863691d6e9b72a8655621bd2663108d144aadc | /l2-rel-1-2/src/l2maxlib/registry/drivers/textini/src/l2TextIniCategorySerializer.cpp | fb8b8d7567b56069f74a2b9f6e064bb12f8dca79 | [] | no_license | L2-Max/l2ChipTuner | 9ca3b1a435ef0adcf13105e5b56a4553b9bdffd1 | 9c54b6cecec29de3c992ec54adf1223549b5d309 | refs/heads/master | 2020-02-26T13:58:16.082017 | 2012-07-27T17:31:44 | 2012-07-27T17:31:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,074 | cpp | /*
* l2TextIniCategorySerializer.cpp
*
* Created on: 31.03.2009
* Author: L2-Max
*/
#include "l2TextIniCategorySerializer.h"
namespace l2max
{
namespace Registry
{
namespace Driver
{
CTextIniCategorySerializer::CTextIniCategorySerializer( const SCategoryMembers& aMembers, int anIndentation ) :
CBaseCategorySerializer( aMembers, anIndentation )
{
for( TCategorySeq::const_iterator i( aMembers._categories.begin() ); i != aMembers._categories.end(); ++i )
{
if( aMembers._variables.size() || i != aMembers._categories.begin() )
{
_serialized += CBaseSerializer::cr();
}
_serialized += _indentation;
_serialized += "[ " + i->first + " ]" + CBaseSerializer::cr();
_serialized += CTextIniCategorySerializer( i->second.second->members(), anIndentation + 1 ).serialized();
}
}
CTextIniCategorySerializer::~CTextIniCategorySerializer(){}
}
}
}
| [
"fmax@ukr.net"
] | fmax@ukr.net |
46a7ace9f03e75598c4f8b92ca2fc9eb26f10201 | c3e64bccc6edb651e784ff98727ecdf21e1a0f20 | /Laboratorio3/Laboratorio3/Gestor.h | 6d5bbddc9bc7637607adeef8b9fa31756026e8bf | [] | no_license | IsabelGaleano/Laboratorio3ED1 | d8d8feab32511efee8a3e60a7427e4b6add65ccb | dcbebe497633c8dc7e5bb961f2e1f6f0cd9e823f | refs/heads/main | 2023-06-07T04:47:16.565132 | 2021-07-04T19:23:04 | 2021-07-04T19:23:04 | 381,202,612 | 0 | 0 | null | 2021-07-04T19:23:05 | 2021-06-29T01:16:29 | C++ | UTF-8 | C++ | false | false | 230 | h | #pragma once
#ifndef GESTOR_H
#define GESTOR_H
#include "Cola.h"
#include "Pila.h"
#include "Nodo.h"
class Gestor
{
public:
Gestor();
void pilaACola(Pila* pila, Cola* cola);
void colaAPila(Pila* pila, Cola* cola);
};
#endif
| [
"isagaleano9@gmail.com"
] | isagaleano9@gmail.com |
05adc43022c2a3f090d80d1ee68c00d6fe0a4718 | edabe1504402a5690139bde3d825d61661e1ba2f | /mainwindow.cpp | 19a14aa742d7c16a00e699a40a2f6ad4350ac0c0 | [] | no_license | krunix23/mviapreview-ng | 16452e16036e7302c0d2fba7c4f4a9ced721b72f | 07353a3f6e270d630bf272fe05c436e25a1e4872 | refs/heads/master | 2016-09-05T14:24:40.248036 | 2015-05-03T17:28:03 | 2015-05-03T17:28:03 | 34,993,910 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,195 | cpp | #include "mainwindow.h"
#include "ui_mainwindow.h"
//-----------------------------------------------------------------------------
MainWindow::MainWindow(QWidget *parent) :
QMainWindow(parent),
ui(new Ui::MainWindow), pDevMgr(0)
//-----------------------------------------------------------------------------
{
ui->setupUi(this);
setFocus();
setWindowIcon(QIcon(":/mv.ico"));
setWindowTitle(QString("mviaPreview"));
setFixedSize(664,580);
ui->actionLive->setIcon(QIcon(":/playback_play.ico"));
ui->actionLive->setIconText(QString("Live"));
ui->actionWhitBalance->setIcon(QIcon(":/picture.ico"));
ui->actionWhitBalance->setIconText(QString("AWB"));
ui->actionAutoExposure->setIcon(QIcon(":/sun.ico"));
ui->actionAutoExposure->setIconText(QString("AE"));
ui->actionWhitBalance->setEnabled(false);
ui->actionAutoExposure->setEnabled(false);
ComboBoxDevices = new QComboBox();
ui->mainToolBar->setToolButtonStyle(Qt::ToolButtonTextUnderIcon);
ui->mainToolBar->addSeparator();
ui->mainToolBar->addWidget(ComboBoxDevices);
ui->mainToolBar->addSeparator();
ui->mainToolBar->addAction(ui->actionLive);
ui->mainToolBar->addAction(ui->actionWhitBalance);
ui->mainToolBar->addAction(ui->actionAutoExposure);
ui->mainToolBar->addSeparator();
pDevMgr = new DeviceManager();
DetectDevices();
iWidth = 640;
iHeight = 480;
pGLESWidget_ = new GLESWidget(iWidth, iHeight, ui->widget);
pWorker_ = new WorkerThread(pDevMgr, this);
pWorker_->AttachGLWidget(pGLESWidget_);
connect( pWorker_, SIGNAL(DoLoadTexture(unsigned char*)), pGLESWidget_, SLOT(DoLoadTexture(unsigned char*)) );
connect( pWorker_, SIGNAL(DoUpdateGL(int)), pGLESWidget_, SLOT(DoUpdateGL(int)) );
connect( pWorker_, SIGNAL(DoUpdateStatusBar(QString)), this, SLOT(UpdateStatusBar(QString)) );
connect( this, SIGNAL(DoWhiteBalanceIA(bool)), pWorker_, SLOT(DoWhiteBalanceIA(bool)) );
connect( this, SIGNAL(DoAutoExposureIA(bool)), pWorker_, SLOT(DoAutoExposureIA(bool)) );
connect( pWorker_, SIGNAL(EnableMenuActions(bool)), this, SLOT(EnableMenuActions(bool)) );
}
//-----------------------------------------------------------------------------
MainWindow::~MainWindow()
//-----------------------------------------------------------------------------
{
delete pDevMgr;
delete pGLESWidget_;
delete pWorker_;
delete ui;
}
//-----------------------------------------------------------------------------
void MainWindow::DetectDevices(void)
//-----------------------------------------------------------------------------
{
unsigned int devicecount_ = 0;
if(!pDevMgr)
return;
devicecount_ = pDevMgr->deviceCount();
if(!devicecount_)
return;
printf("DeviceManager is detecting devices ...\n");
for( unsigned int i = 0; i < devicecount_; i++ )
{
printf("[%d]: %s\n", i, pDevMgr->getDevice(i)->serial.readS().c_str() );
DeviceSet.insert(i);
QString serial_( pDevMgr->getDevice(i)->serial.readS().c_str() );
ComboBoxDevices->insertItem( i, serial_ );
}
ComboBoxDevices->setCurrentIndex(0);
}
//-----------------------------------------------------------------------------
QWidget* MainWindow::GLWidget(void)
//-----------------------------------------------------------------------------
{
return ui->widget;
}
//-----------------------------------------------------------------------------
void MainWindow::on_actionLive_toggled(bool arg1)
//-----------------------------------------------------------------------------
{
if( arg1 )
{
ComboBoxDevices->setEnabled(false);
pWorker_->OpenDevice( ComboBoxDevices->currentIndex() , iWidth, iHeight );
pWorker_->StartThread();
}
else
{
ComboBoxDevices->setEnabled(true);
pWorker_->StopThread();
}
}
//-----------------------------------------------------------------------------
void MainWindow::on_actionWhitBalance_triggered(bool checked)
//-----------------------------------------------------------------------------
{
emit DoWhiteBalanceIA(checked); // do AWB via mvIA
}
//-----------------------------------------------------------------------------
void MainWindow::on_actionAutoExposure_triggered(bool checked)
//-----------------------------------------------------------------------------
{
emit DoAutoExposureIA(checked); // do AE via mvIA
}
//-----------------------------------------------------------------------------
void MainWindow::DoUpdateGL( int reqNr )
//-----------------------------------------------------------------------------
{
emit UpdateGL( reqNr );
}
//-----------------------------------------------------------------------------
void MainWindow::UpdateStatusBar( QString message )
//-----------------------------------------------------------------------------
{
ui->statusBar->showMessage(message);
}
//-----------------------------------------------------------------------------
void MainWindow::EnableMenuActions( bool arg )
//-----------------------------------------------------------------------------
{
ui->actionWhitBalance->setEnabled(arg);
ui->actionAutoExposure->setEnabled(arg);
}
| [
"stuntman.mike@mail.com"
] | stuntman.mike@mail.com |
ee1477168b0282ebfb029bf943fea660ff804c47 | 295b0fe3ed6729cb9373facb1295c8abb40a815b | /usaco/section_1_4/arithmetic_progressions/arithmetic_progressions.cpp | 072b73f04bbac5c4855d4674ecf238135a4b60e0 | [] | no_license | wbc91/code-practice | f1ec79a3bed5d720d8cfaa154d89e6c7b1225d34 | 23ddd1fd5e52645cd222ef6c373444f4056626a7 | refs/heads/master | 2021-01-24T03:48:17.673811 | 2018-01-14T16:48:40 | 2018-01-14T16:48:40 | 47,622,159 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,109 | cpp | /*
ID: 08300242
LANG: C++
TASK: ariprog
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXN 125010
int cmp(const void *va, const void *vb) {
return *(int*)va - *(int*)vb;
}
int main(void) {
int M,N;
FILE*fin, *fout;
fin = fopen("ariprog.in", "r");
fout = fopen("ariprog.out", "w");
fscanf(fin, "%d", &N);
fscanf(fin, "%d", &M);
int bqArr[MAXN];
memset(bqArr, 0, sizeof(bqArr));
int cnt = 0;
int max = 0;
for (int i = 0; i <= M; i++) {
for (int j = i; j <= M; j++) {
int tmp = i*i+j*j;
bqArr[tmp]=1;
cnt++;
if (tmp > max) {
max = tmp;
}
}
}
int a = 0;
int b = 1;
bool exists = false;
while(true) {
for (int i = 0; i <= max; i++ ){
if (bqArr[i] != 1) continue;
a = i;
bool flag = true;
for (int j = 0; j < N; j++) {
if ((a+j*b > max) || bqArr[a+j*b] == 0) {
flag = false;
break;
}
}
if (flag) {
exists = true;
fprintf(fout, "%d %d\n", a,b);
}
if (a+b*(N-1) >= max) {
break;
}
}
if ((N-1)*b >= max) {
break;
}
b++;
}
if (!exists) {
fprintf(fout, "NONE\n");
}
} | [
"beichen.wang@dena.local"
] | beichen.wang@dena.local |
e333a78d323fd27578138c2c9590029a230834a4 | 88114d91ae87c59fe812a064e02f67376603b3fc | /src/rpcrawtransaction.cpp | 437856706ff5676ff04d6b16d85ff83f7f2fc88e | [
"MIT"
] | permissive | kiwicoinnz/KIWI | 6130ff47137f34e3940854f7018fa8913a67843f | 9648e271827134d85ea21639a7a4d34223e4e5b5 | refs/heads/master | 2020-05-28T07:22:29.130068 | 2015-01-30T08:37:08 | 2015-01-30T08:37:08 | 30,063,347 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 19,229 | cpp | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <boost/assign/list_of.hpp>
#include "base58.h"
#include "bitcoinrpc.h"
#include "db.h"
#include "init.h"
#include "main.h"
#include "net.h"
#include "wallet.h"
using namespace std;
using namespace boost;
using namespace boost::assign;
using namespace json_spirit;
void ScriptPubKeyToJSON(const CScript& scriptPubKey, Object& out)
{
txnouttype type;
vector<CTxDestination> addresses;
int nRequired;
out.push_back(Pair("asm", scriptPubKey.ToString()));
out.push_back(Pair("hex", HexStr(scriptPubKey.begin(), scriptPubKey.end())));
if (!ExtractDestinations(scriptPubKey, type, addresses, nRequired))
{
out.push_back(Pair("type", GetTxnOutputType(TX_NONSTANDARD)));
return;
}
out.push_back(Pair("reqSigs", nRequired));
out.push_back(Pair("type", GetTxnOutputType(type)));
Array a;
BOOST_FOREACH(const CTxDestination& addr, addresses)
a.push_back(CBitcoinAddress(addr).ToString());
out.push_back(Pair("addresses", a));
}
void TxToJSON(const CTransaction& tx, const uint256 hashBlock, Object& entry)
{
entry.push_back(Pair("txid", tx.GetHash().GetHex()));
entry.push_back(Pair("version", tx.nVersion));
entry.push_back(Pair("time", (boost::int64_t)tx.nTime));
entry.push_back(Pair("locktime", (boost::int64_t)tx.nLockTime));
Array vin;
BOOST_FOREACH(const CTxIn& txin, tx.vin)
{
Object in;
if (tx.IsCoinBase())
in.push_back(Pair("coinbase", HexStr(txin.scriptSig.begin(), txin.scriptSig.end())));
else
{
in.push_back(Pair("txid", txin.prevout.hash.GetHex()));
in.push_back(Pair("vout", (boost::int64_t)txin.prevout.n));
Object o;
o.push_back(Pair("asm", txin.scriptSig.ToString()));
o.push_back(Pair("hex", HexStr(txin.scriptSig.begin(), txin.scriptSig.end())));
in.push_back(Pair("scriptSig", o));
}
in.push_back(Pair("sequence", (boost::int64_t)txin.nSequence));
vin.push_back(in);
}
entry.push_back(Pair("vin", vin));
Array vout;
for (unsigned int i = 0; i < tx.vout.size(); i++)
{
const CTxOut& txout = tx.vout[i];
Object out;
out.push_back(Pair("value", ValueFromAmount(txout.nValue)));
out.push_back(Pair("n", (boost::int64_t)i));
Object o;
ScriptPubKeyToJSON(txout.scriptPubKey, o);
out.push_back(Pair("scriptPubKey", o));
vout.push_back(out);
}
entry.push_back(Pair("vout", vout));
if (hashBlock != 0)
{
entry.push_back(Pair("blockhash", hashBlock.GetHex()));
map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
if (mi != mapBlockIndex.end() && (*mi).second)
{
CBlockIndex* pindex = (*mi).second;
if (pindex->IsInMainChain())
{
entry.push_back(Pair("confirmations", 1 + nBestHeight - pindex->nHeight));
entry.push_back(Pair("time", (boost::int64_t)pindex->nTime));
entry.push_back(Pair("blocktime", (boost::int64_t)pindex->nTime));
}
else
entry.push_back(Pair("confirmations", 0));
}
}
}
Value getrawtransaction(const Array& params, bool fHelp)
{
if (fHelp || params.size() < 1 || params.size() > 2)
throw runtime_error(
"getrawtransaction <txid> [verbose=0]\n"
"If verbose=0, returns a string that is\n"
"serialized, hex-encoded data for <txid>.\n"
"If verbose is non-zero, returns an Object\n"
"with information about <txid>.");
uint256 hash;
hash.SetHex(params[0].get_str());
bool fVerbose = false;
if (params.size() > 1)
fVerbose = (params[1].get_int() != 0);
CTransaction tx;
uint256 hashBlock = 0;
if (!GetTransaction(hash, tx, hashBlock))
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "No information available about transaction");
CDataStream ssTx(SER_NETWORK, PROTOCOL_VERSION);
ssTx << tx;
string strHex = HexStr(ssTx.begin(), ssTx.end());
if (!fVerbose)
return strHex;
Object result;
result.push_back(Pair("hex", strHex));
TxToJSON(tx, hashBlock, result);
return result;
}
Value listunspent(const Array& params, bool fHelp)
{
if (fHelp || params.size() > 3)
throw runtime_error(
"listunspent [minconf=1] [maxconf=9999999] [\"address\",...]\n"
"Returns array of unspent transaction outputs\n"
"with between minconf and maxconf (inclusive) confirmations.\n"
"Optionally filtered to only include txouts paid to specified addresses.\n"
"Results are an array of Objects, each of which has:\n"
"{txid, vout, scriptPubKey, amount, confirmations}");
RPCTypeCheck(params, list_of(int_type)(int_type)(array_type));
int nMinDepth = 1;
if (params.size() > 0)
nMinDepth = params[0].get_int();
int nMaxDepth = 9999999;
if (params.size() > 1)
nMaxDepth = params[1].get_int();
set<CBitcoinAddress> setAddress;
if (params.size() > 2)
{
Array inputs = params[2].get_array();
BOOST_FOREACH(Value& input, inputs)
{
CBitcoinAddress address(input.get_str());
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, string("Invalid KiwiCoin address: ")+input.get_str());
if (setAddress.count(address))
throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, duplicated address: ")+input.get_str());
setAddress.insert(address);
}
}
Array results;
vector<COutput> vecOutputs;
pwalletMain->AvailableCoins(vecOutputs, false);
BOOST_FOREACH(const COutput& out, vecOutputs)
{
if (out.nDepth < nMinDepth || out.nDepth > nMaxDepth)
continue;
if(setAddress.size())
{
CTxDestination address;
if(!ExtractDestination(out.tx->vout[out.i].scriptPubKey, address))
continue;
if (!setAddress.count(address))
continue;
}
int64 nValue = out.tx->vout[out.i].nValue;
const CScript& pk = out.tx->vout[out.i].scriptPubKey;
Object entry;
entry.push_back(Pair("txid", out.tx->GetHash().GetHex()));
entry.push_back(Pair("vout", out.i));
entry.push_back(Pair("scriptPubKey", HexStr(pk.begin(), pk.end())));
entry.push_back(Pair("amount",ValueFromAmount(nValue)));
entry.push_back(Pair("confirmations",out.nDepth));
results.push_back(entry);
}
return results;
}
Value createrawtransaction(const Array& params, bool fHelp)
{
if (fHelp || params.size() != 2)
throw runtime_error(
"createrawtransaction [{\"txid\":txid,\"vout\":n},...] {address:amount,...}\n"
"Create a transaction spending given inputs\n"
"(array of objects containing transaction id and output number),\n"
"sending to given address(es).\n"
"Returns hex-encoded raw transaction.\n"
"Note that the transaction's inputs are not signed, and\n"
"it is not stored in the wallet or transmitted to the network.");
RPCTypeCheck(params, list_of(array_type)(obj_type));
Array inputs = params[0].get_array();
Object sendTo = params[1].get_obj();
CTransaction rawTx;
BOOST_FOREACH(Value& input, inputs)
{
const Object& o = input.get_obj();
const Value& txid_v = find_value(o, "txid");
if (txid_v.type() != str_type)
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, missing txid key");
string txid = txid_v.get_str();
if (!IsHex(txid))
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected hex txid");
const Value& vout_v = find_value(o, "vout");
if (vout_v.type() != int_type)
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, missing vout key");
int nOutput = vout_v.get_int();
if (nOutput < 0)
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, vout must be positive");
CTxIn in(COutPoint(uint256(txid), nOutput));
rawTx.vin.push_back(in);
}
set<CBitcoinAddress> setAddress;
BOOST_FOREACH(const Pair& s, sendTo)
{
CBitcoinAddress address(s.name_);
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, string("Invalid KiwiCoin address: ")+s.name_);
if (setAddress.count(address))
throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, duplicated address: ")+s.name_);
setAddress.insert(address);
CScript scriptPubKey;
scriptPubKey.SetDestination(address.Get());
int64 nAmount = AmountFromValue(s.value_);
CTxOut out(nAmount, scriptPubKey);
rawTx.vout.push_back(out);
}
CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
ss << rawTx;
return HexStr(ss.begin(), ss.end());
}
Value decoderawtransaction(const Array& params, bool fHelp)
{
if (fHelp || params.size() != 1)
throw runtime_error(
"decoderawtransaction <hex string>\n"
"Return a JSON object representing the serialized, hex-encoded transaction.");
RPCTypeCheck(params, list_of(str_type));
vector<unsigned char> txData(ParseHex(params[0].get_str()));
CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
CTransaction tx;
try {
ssData >> tx;
}
catch (std::exception &e) {
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX decode failed");
}
Object result;
TxToJSON(tx, 0, result);
return result;
}
Value signrawtransaction(const Array& params, bool fHelp)
{
if (fHelp || params.size() < 1 || params.size() > 4)
throw runtime_error(
"signrawtransaction <hex string> [{\"txid\":txid,\"vout\":n,\"scriptPubKey\":hex},...] [<privatekey1>,...] [sighashtype=\"ALL\"]\n"
"Sign inputs for raw transaction (serialized, hex-encoded).\n"
"Second optional argument (may be null) is an array of previous transaction outputs that\n"
"this transaction depends on but may not yet be in the blockchain.\n"
"Third optional argument (may be null) is an array of base58-encoded private\n"
"keys that, if given, will be the only keys used to sign the transaction.\n"
"Fourth optional argument is a string that is one of six values; ALL, NONE, SINGLE or\n"
"ALL|ANYONECANPAY, NONE|ANYONECANPAY, SINGLE|ANYONECANPAY.\n"
"Returns json object with keys:\n"
" hex : raw transaction with signature(s) (hex-encoded string)\n"
" complete : 1 if transaction has a complete set of signature (0 if not)"
+ HelpRequiringPassphrase());
RPCTypeCheck(params, list_of(str_type)(array_type)(array_type)(str_type), true);
vector<unsigned char> txData(ParseHex(params[0].get_str()));
CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
vector<CTransaction> txVariants;
while (!ssData.empty())
{
try {
CTransaction tx;
ssData >> tx;
txVariants.push_back(tx);
}
catch (std::exception &e) {
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX decode failed");
}
}
if (txVariants.empty())
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "Missing transaction");
// mergedTx will end up with all the signatures; it
// starts as a clone of the rawtx:
CTransaction mergedTx(txVariants[0]);
bool fComplete = true;
// Fetch previous transactions (inputs):
map<COutPoint, CScript> mapPrevOut;
for (unsigned int i = 0; i < mergedTx.vin.size(); i++)
{
CTransaction tempTx;
MapPrevTx mapPrevTx;
CTxDB txdb("r");
map<uint256, CTxIndex> unused;
bool fInvalid;
// FetchInputs aborts on failure, so we go one at a time.
tempTx.vin.push_back(mergedTx.vin[i]);
tempTx.FetchInputs(txdb, unused, false, false, mapPrevTx, fInvalid);
// Copy results into mapPrevOut:
BOOST_FOREACH(const CTxIn& txin, tempTx.vin)
{
const uint256& prevHash = txin.prevout.hash;
if (mapPrevTx.count(prevHash) && mapPrevTx[prevHash].second.vout.size()>txin.prevout.n)
mapPrevOut[txin.prevout] = mapPrevTx[prevHash].second.vout[txin.prevout.n].scriptPubKey;
}
}
// Add previous txouts given in the RPC call:
if (params.size() > 1 && params[1].type() != null_type)
{
Array prevTxs = params[1].get_array();
BOOST_FOREACH(Value& p, prevTxs)
{
if (p.type() != obj_type)
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "expected object with {\"txid'\",\"vout\",\"scriptPubKey\"}");
Object prevOut = p.get_obj();
RPCTypeCheck(prevOut, map_list_of("txid", str_type)("vout", int_type)("scriptPubKey", str_type));
string txidHex = find_value(prevOut, "txid").get_str();
if (!IsHex(txidHex))
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "txid must be hexadecimal");
uint256 txid;
txid.SetHex(txidHex);
int nOut = find_value(prevOut, "vout").get_int();
if (nOut < 0)
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "vout must be positive");
string pkHex = find_value(prevOut, "scriptPubKey").get_str();
if (!IsHex(pkHex))
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "scriptPubKey must be hexadecimal");
vector<unsigned char> pkData(ParseHex(pkHex));
CScript scriptPubKey(pkData.begin(), pkData.end());
COutPoint outpoint(txid, nOut);
if (mapPrevOut.count(outpoint))
{
// Complain if scriptPubKey doesn't match
if (mapPrevOut[outpoint] != scriptPubKey)
{
string err("Previous output scriptPubKey mismatch:\n");
err = err + mapPrevOut[outpoint].ToString() + "\nvs:\n"+
scriptPubKey.ToString();
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, err);
}
}
else
mapPrevOut[outpoint] = scriptPubKey;
}
}
bool fGivenKeys = false;
CBasicKeyStore tempKeystore;
if (params.size() > 2 && params[2].type() != null_type)
{
fGivenKeys = true;
Array keys = params[2].get_array();
BOOST_FOREACH(Value k, keys)
{
CBitcoinSecret vchSecret;
bool fGood = vchSecret.SetString(k.get_str());
if (!fGood)
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY,"Invalid private key");
CKey key;
bool fCompressed;
CSecret secret = vchSecret.GetSecret(fCompressed);
key.SetSecret(secret, fCompressed);
tempKeystore.AddKey(key);
}
}
else
EnsureWalletIsUnlocked();
const CKeyStore& keystore = (fGivenKeys ? tempKeystore : *pwalletMain);
int nHashType = SIGHASH_ALL;
if (params.size() > 3 && params[3].type() != null_type)
{
static map<string, int> mapSigHashValues =
boost::assign::map_list_of
(string("ALL"), int(SIGHASH_ALL))
(string("ALL|ANYONECANPAY"), int(SIGHASH_ALL|SIGHASH_ANYONECANPAY))
(string("NONE"), int(SIGHASH_NONE))
(string("NONE|ANYONECANPAY"), int(SIGHASH_NONE|SIGHASH_ANYONECANPAY))
(string("SINGLE"), int(SIGHASH_SINGLE))
(string("SINGLE|ANYONECANPAY"), int(SIGHASH_SINGLE|SIGHASH_ANYONECANPAY))
;
string strHashType = params[3].get_str();
if (mapSigHashValues.count(strHashType))
nHashType = mapSigHashValues[strHashType];
else
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid sighash param");
}
bool fHashSingle = ((nHashType & ~SIGHASH_ANYONECANPAY) == SIGHASH_SINGLE);
// Sign what we can:
for (unsigned int i = 0; i < mergedTx.vin.size(); i++)
{
CTxIn& txin = mergedTx.vin[i];
if (mapPrevOut.count(txin.prevout) == 0)
{
fComplete = false;
continue;
}
const CScript& prevPubKey = mapPrevOut[txin.prevout];
txin.scriptSig.clear();
// Only sign SIGHASH_SINGLE if there's a corresponding output:
if (!fHashSingle || (i < mergedTx.vout.size()))
SignSignature(keystore, prevPubKey, mergedTx, i, nHashType);
// ... and merge in other signatures:
BOOST_FOREACH(const CTransaction& txv, txVariants)
{
txin.scriptSig = CombineSignatures(prevPubKey, mergedTx, i, txin.scriptSig, txv.vin[i].scriptSig);
}
if (!VerifyScript(txin.scriptSig, prevPubKey, mergedTx, i, true, 0))
fComplete = false;
}
Object result;
CDataStream ssTx(SER_NETWORK, PROTOCOL_VERSION);
ssTx << mergedTx;
result.push_back(Pair("hex", HexStr(ssTx.begin(), ssTx.end())));
result.push_back(Pair("complete", fComplete));
return result;
}
Value sendrawtransaction(const Array& params, bool fHelp)
{
if (fHelp || params.size() < 1 || params.size() > 1)
throw runtime_error(
"sendrawtransaction <hex string>\n"
"Submits raw transaction (serialized, hex-encoded) to local node and network.");
RPCTypeCheck(params, list_of(str_type));
// parse hex string from parameter
vector<unsigned char> txData(ParseHex(params[0].get_str()));
CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
CTransaction tx;
// deserialize binary data stream
try {
ssData >> tx;
}
catch (std::exception &e) {
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX decode failed");
}
uint256 hashTx = tx.GetHash();
// See if the transaction is already in a block
// or in the memory pool:
CTransaction existingTx;
uint256 hashBlock = 0;
if (GetTransaction(hashTx, existingTx, hashBlock))
{
if (hashBlock != 0)
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, string("transaction already in block ")+hashBlock.GetHex());
// Not in block, but already in the memory pool; will drop
// through to re-relay it.
}
else
{
// push to local node
CTxDB txdb("r");
if (!tx.AcceptToMemoryPool(txdb))
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX rejected");
SyncWithWallets(tx, NULL, true);
}
RelayMessage(CInv(MSG_TX, hashTx), tx);
return hashTx.GetHex();
}
| [
"kiwicoinnz@gmail.com"
] | kiwicoinnz@gmail.com |
a42a44f38934c4f23b1e4fcb9842381d1e458427 | e02ffc92c563e842abb2fd23f68bce6688adc2d3 | /caer_my_filter/src/abmof_accel/abmof.h | bbbc1b18fb10024362297c47cf4e4fa971d99e1e | [] | no_license | wzygzlm/nnp_OF_SDx | 8d787617343afc9d5675300f108822b797f6ccf1 | 699b6852114a5d7645cb51d88087c094aefb06ea | refs/heads/master | 2021-06-23T18:50:06.659219 | 2019-07-04T08:33:14 | 2019-07-04T08:33:14 | 144,404,961 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 748 | h | #ifndef ABMOF
#define ABMOF
// libcaer
#include <libcaercpp/devices/davis.hpp>
// socket
#include <iostream>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <sys/ioctl.h>
#include <net/if.h>
#include <unistd.h>
#include <string.h>
#define SLICES_NUMBER 3
#define DVS_WIDTH 240
#define DVS_HEIGHT 180
struct SADResult {
uint16_t dx;
uint16_t dy;
bool validFlg;
uint64_t sadValue;
};
int init_socket(int port);
void abmof_accel(caerPolarityEventPacket eventPkt);
void accumulate(int16_t x, int16_t y, bool pol, int64_t ts);
void sendEventSlice();
void resetSlices();
void resetCurrentSlice();
void rotateSlices();
SADResult calculateOF(int16_t x, int16_t y, int16_t searchDistance, int16_t blockSize);
using namespace std;
#endif
| [
"wzygzlm@gmail.com"
] | wzygzlm@gmail.com |
289b49c191a3473eeb89392376cbff041ad1514e | 0fed3d6c4a6dbdb49029913b6ce96a9ede9eac6c | /Summer2018/Personal01/O.cpp | 9ce15b2faeb39135c97189429bd753594d23a215 | [] | no_license | 87ouo/The-road-to-ACMer | 72df2e834027dcfab04b02ba0ddd350e5078dfc0 | 0a39a9708a0e7fd0e3b2ffff5d1f4a793b031df5 | refs/heads/master | 2021-02-18T17:44:29.937434 | 2019-07-31T11:30:27 | 2019-07-31T11:30:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,742 | cpp | #include <bits/stdc++.h>
using namespace std;
#define clr(a, x) memset(a, x, sizeof(a))
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define X first
#define Y second
#define fastin \
ios_base::sync_with_stdio(0); \
cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-6;
namespace FFT
{
const double PI = acos(-1.0);
struct Complex
{
double x, y;
Complex(double x = 0.0, double y = 0.0) { this->x = x, this->y = y; }
Complex operator-(const Complex& b) const { return Complex(x - b.x, y - b.y); }
Complex operator+(const Complex& b) const { return Complex(x + b.x, y + b.y); }
Complex operator*(const Complex& b) const { return Complex(x * b.x - y * b.y, x * b.y + y * b.x); }
};
void fft(vector<Complex>& y, int len, int on)
{
for (int i = 1, j = len / 2; i < len - 1; i++)
{
if (i < j) swap(y[i], y[j]);
int k = len / 2;
while (j >= k) j -= k, k /= 2;
if (j < k) j += k;
}
for (int h = 2; h <= len; h <<= 1)
{
Complex wn(cos(-on * 2 * PI / h), sin(-on * 2 * PI / h));
for (int j = 0; j < len; j += h)
{
Complex w(1, 0);
for (int k = j; k < j + h / 2; k++)
{
Complex u = y[k];
Complex t = w * y[k + h / 2];
y[k] = u + t, y[k + h / 2] = u - t;
w = w * wn;
}
}
}
if (on == -1)
for (int i = 0; i < len; i++) y[i].x /= len;
}
template <class T>
vector<T> multiply(const vector<T>& a, const vector<T>& b)
{
int n = a.size() + b.size() - 1;
int len = 1;
while (len < n) len <<= 1;
vector<Complex> aa(len), bb(len);
for (int i = 0; i < a.size(); i++) aa[i] = a[i];
for (int i = 0; i < b.size(); i++) bb[i] = b[i];
fft(aa, len, 1), fft(bb, len, 1);
for (int i = 0; i < len; i++) aa[i] = aa[i] * bb[i];
fft(aa, len, -1);
vector<T> ret(n);
for (int i = 0; i < n; i++) ret[i] = (T)(aa[i].x + 0.5);
return ret;
}
}; // namespace FFT
int main()
{
#ifndef ONLINE_JUDGE
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
#endif
fastin
int n, x;
cin >> n >> x;
vector<int> a(n + 1);
for (int i = 0, c; i < n; i++)
{
cin >> c;
a[i] = c < x;
}
for (int i = 1; i < n; i++) a[i] += a[i - 1];
vector<ll> r(n + 1), v(n + 1);
for (int i = 0; i <= n; i++) r[a[i]]++, v[n - a[i]]++;
auto ans = FFT::multiply(r, v);
ans[n] -= (n + 1);
ans[n] >>= 1;
for (int i = n; i <= 2 * n; i++) cout << ans[i] << " ";
return 0;
}
| [
"zbszx040504@126.com"
] | zbszx040504@126.com |
88bd3d2867d54b25cab58f17b0fbd1715abbd9af | 55a2119d2a4abaebded1b7c55a2bd811488286e0 | /Channel.h | f55197e0e9245fe4b9c6a446f4b7855444fe1ef5 | [] | no_license | samuel-olivier/Animation | 859735113542483581a543536baf7d70e92b21fc | 1ef20b1466b44a3a39300e10bb74612a0de7ee67 | refs/heads/master | 2021-05-27T06:09:03.605027 | 2014-05-13T07:55:17 | 2014-05-13T07:55:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,196 | h | #ifndef CHANNEL_H
#define CHANNEL_H
#include <QVector>
class Keyframe;
class Channel
{
public:
enum ExtrapolateType {
Constant,
Linear,
Cycle,
CycleOffset,
Bounce
};
Channel();
virtual ~Channel();
QVector<Keyframe*> const& keys() const;
void setKeys(QVector<Keyframe*> const& keys);
Keyframe* key(int idx) const;
void setKey(int idx, Keyframe* key);
ExtrapolateType extrapolationIn() const;
void setExtrapolationIn(ExtrapolateType extrapolationIn);
ExtrapolateType extrapolationOut() const;
void setExtrapolationOut(ExtrapolateType extrapolationOut);
void preCompute();
float evaluate(float t);
float startTime() const;
float endTime() const;
float minValue() const;
float maxValue() const;
void sortKeys();
void addKey(Keyframe* key);
void deleteKey(Keyframe* key);
private:
QVector<Keyframe*> _keys;
ExtrapolateType _extrapolationIn;
ExtrapolateType _extrapolationOut;
};
#endif // CHANNEL_H
| [
"skanight@hotmail.fr"
] | skanight@hotmail.fr |
b1d1479925cf7354f41b87b78c4b979246b16acc | 09c43e037d720e24e769ef9faa148f1377524c2c | /nil/random.hpp | 5a4c4c6add975050a12d48a68fd1e0cb24329d2e | [] | no_license | goal/qqbot | bf63cf06e4976f16e2f0b8ec7c6cce88782bdf29 | 3a4b5920d5554cc55b6df962d27ebbc499c63474 | refs/heads/master | 2020-07-30T13:57:11.135976 | 2009-06-10T00:13:46 | 2009-06-10T00:13:46 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,838 | hpp | #ifndef NIL_RANDOM_HPP
#define NIL_RANDOM_HPP
#include <vector>
#include <algorithm>
#include <nil/exception.hpp>
#include <nil/types.hpp>
namespace nil
{
namespace random
{
ulong uint();
ulong uint(ulong minimum, ulong maximum);
void seed(std::string const & data);
ulong advanced_uint();
ulong advanced_uint(ulong minimum, ulong maximum);
float sp_float();
float sp_float(float minimum, float maximum);
double dp_float();
double dp_float(double minimum, double maximum);
}
template <class type>
class random_scale
{
public:
struct element
{
type object;
ulong minimum;
ulong maximum;
element()
{
}
element(type object, ulong minimum, ulong maximum):
object(object),
minimum(minimum),
maximum(maximum)
{
}
bool operator==(ulong input) const
{
return input >= minimum && input <= maximum;
}
};
random_scale():
total_weight(0)
{
}
void add(type object, ulong weight)
{
if(weight == 0)
throw exception("Element weight can't be zero");
elements.push_back(element(object, total_weight, total_weight + weight - 1));
total_weight += weight;
}
type random()
{
return make_choice()->object;
}
private:
std::vector<element> elements;
ulong total_weight;
typename std::vector<element>::iterator make_choice()
{
if(total_weight == 0)
throw exception("Random scale object doesn't contain any elements yet");
ulong choice = random::uint(0, total_weight - 1);
typename std::vector<element>::iterator iterator = std::find(elements.begin(), elements.end(), choice);
if(iterator == elements.end())
throw exception("Unable to match weight, code must be broken");
return iterator;
}
};
}
#endif
| [
"akirarat@ba06997c-553f-11de-8ef9-cf35a3c3eb08"
] | akirarat@ba06997c-553f-11de-8ef9-cf35a3c3eb08 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.