Dosth_Magic

模仿外国人发声 1.不挤压很放松 2很厚端位置很深 3还有共鸣 打哈欠 不要漏气，胸口要有气压 headvoice 真声上不去假声下不来 1，自然过渡 2.嘴唇布鲁 3鼻 咽音 N 喵 nei nai 高音 卷舌 水滴 开s 嗯。。。 唇颤音 断音啊 卷舌音 从低到高

Analysis 分析 算法很简单，给你一组煎饼，用笔在纸上一画就知道该怎么办了。还是动态规划的思想，从底至上，保持已经遍例过的煎饼都是最大且有序的。比如输入的数据为： 2 4 1 3 5 按题目要求，4在顶5在底。5已经是最大的了，则移动到上一个煎饼3。3之上（含）最大的是4，先将4翻转到最顶，形成： 4 2 1 3 5 然后将4到3的子叠翻转，形成： 3 1 2 4 5 移动到

#include using namespace std; class A{ public: int a_; A() { cout<<"A++\n"; } };; class B1: virtual public A{ public: int b1_; B1() { cout<<"B1++\n"; } };; class B2: virtual public A{ public: int b2

建模软件StarUML

1 #include using namespace std; int main() { ios::sync_with_stdio(0); int t,c=1; cin>>t; while(t--){ set s1; set s2; set s3; set s4; int n,x;ci

#include using namespace std; class Time { private: int h_,m_,s_; public: Time():h_(0),m_(0),s_(0) { } Time(int h,int m,int s):h_(h),m_(m),s_(s) { } Time(const Time& rhs){ h_=rhs.h_;

1 #include using namespace std; class Date{ private: int y_,m_,d_; public: Date(){} Date(int a,int b,int c) {y_=a;m_=b;d_=c;} void showDate(){ cout<<setw(4)<<setfill('0')<<y_<<

#include using namespace std; class Point{ private: double x_,y_; public: Point():x_(0),y_(0) {} Point(double x,double y):x_(x),y_(y) {} double setx() { return x_; } double sety()

Fibonacci Numbers Time Limit: 2 Seconds Memory Limit: 65536 KB A Fibonacci sequence is calculated by adding the previous two members of the sequence, with the first two members being both 1. f(

// Linklist.h: interface for the Linklist class. // ////////////////////////////////////////////////////////////////////// #if !defined(AFX_LINKLIST_H__4E62685D_4A8F_4C66_BAE4_54E8354E8F01__INCLUDED_

#include using namespace std; template class Point{ private : T a_,b_; public: Point():a_(0),b_(0) {} Point(Point& rhs){ *this=rhs; } friend istream& operator >> (istream& in,Point& rh

1 #include using namespace std; class Array{ private: int *s_; int size_; public: Array():s_(NULL),size_(0) {} ~Array(){ delete []s_; } int size() { return size_; } void get(i

#include using namespace std; class Time{ private: int h_,m_,s_; public: Time():h_(0),m_(0),s_(0) {} Time(int h,int m,int s):h_(h),m_(m),s_(s) {} Time(const Time& rhs){ h_=rhs.h_; m_=r

#include #include using namespace std; #define abs(a) ((a)>0?(a):-(a)) #define max(a,b) ((a)<(b)?(b):(a)) int foo(int x,int y){ if(x==0&&y==0) return 1; int t=max(abs(x),abs(y)); i