前
题目描述
中
1.
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
typedef long long LL;
#define PI acos(-1)
#define fin freopen("data.txt","r",stdin)
#define INF 2147483647
#define eps 1e-7
#define L 100005
#define Fo(i,a,b) for(LL i=(a),_=(b); i<=_; i++)
#define Ro(i,b,a) for(LL i=(b),_=(a); i>=_; i--)
#define Ms(a,b) memset((a),(b),sizeof(a))
#define _ceil(_,__) (_+(__-1))/__
inline LL read() {
LL x = 0, f = 1;char c = getchar();
while (!isdigit(c)) {
if (c == '-')f = -f;c = getchar(); }
while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48ll), c = getchar();
return x * f;
}
class Fraction {
private:
//数据成员，访问控制属性默认是私有
int m_numerator = 0; // 分子默认为0； C++11
int m_denominator = 1; //分母默认为1；
public://公有成员函数
Fraction(int above = 0, int below = 1) :
m_numerator(above), m_denominator(below) {
cout << "Constructor called" << endl;
}
Fraction(const Fraction& rhs) : m_numerator(rhs.m_numerator), \
m_denominator(rhs.m_denominator) {
cout << "Copy constructor called" << endl;
}
int getnumerator() const {
//获取分子
return m_numerator;
}
int getdenominator() const {
//获取分母
return m_denominator;
}
~Fraction() {
//定义析构函数
cout << "Destructor of Fraction" << endl;
}
Fraction simplify() {
//分数的约分
int _gcd = gcd(m_denominator, m_numerator);
m_denominator /= _gcd;
m_numerator /= _gcd;
Fraction result(m_numerator, m_denominator);
return result;
}
};
int gcd(int x, int y) {
return y == 0 ? x : gcd(y, x % y);
}
Fraction divide1(const Fraction& divident, const Fraction& divisor) {
return Fraction(divident.getnumerator() * divisor.getdenominator(), \
divident.getdenominator() * divisor.getnumerator());
}
Fraction divide2(Fraction divident, Fraction divisor) {
Fraction result(divident.getnumerator() * divisor.getdenominator(), \
divident.getdenominator() * divisor.getnumerator());
return result;
}
void tongfen(Fraction& a,Fraction& b) {
//Upd:12.24 19：53
int lcm = (a.getdenominator() * b.getdenominator()) / gcd(a.getdenominator(), b.getdenominator());
Fraction sa(a.getnumerator() * lcm / a.getdenominator(), lcm);
Fraction sb(b.getnumerator() * lcm / b.getdenominator(), lcm);
a = sa;
b = sb;
}
/*Fraction tongfen(const Fraction& a, const Fraction& b) { //分数的通分
Fraction result(a.getnumerator() * b.getdenominator() + a.getdenominator() * b.getdenominator(), a.getdenominator() * b.getdenominator());
return result.simplify();
}*/
Fraction operator / (const Fraction& a, const Fraction& b) {
//重载 / 符号
Fraction result(a.getnumerator() * b.getdenominator(), a.getdenominator() * b.getnumerator());
result.simplify();
return result;
}
int main() {
Fraction a;
Fraction b(a);
Fraction c = Fraction(3, 2);
Fraction d1(2, 3), d2(4, 5);
Fraction e1 = divide1(d1, d2);
Fraction e2 = divide2(d1, d2);
return 0;
}
2.
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
typedef long long LL;
#define PI acos(-1)
#define fin freopen("data.txt","r",stdin)
#define INF 2147483647
#define eps 1e-7
#define L 100005
#define Fo(i,a,b) for(LL i=(a),_=(b); i<=_; i++)
#define Ro(i,b,a) for(LL i=(b),_=(a); i>=_; i--)
#define Ms(a,b) memset((a),(b),sizeof(a))
#define _ceil(_,__) (_+(__-1))/__
inline LL read() {
LL x = 0, f = 1;char c = getchar();
while (!isdigit(c)) {
if (c == '-')f = -f;c = getchar(); }
while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48ll), c = getchar();
return x * f;
}
int a[5] = {
19,67,24,11,17 }, b[5] = {
2,3,9,17,59 } , minn , min_op , sz , vis[1005];
vector<int>c;
int find(int d[]) {
Fo(i, 0, 4)
if (d[i] == 17)
return i;
}
int find_mid(int d[]) {
int l = 0, r = 4;
while (l < r) {
int mid = (l + r) >> 1;
if (d[mid] < 17)
l = mid+1;
else
r = mid-1;
}
return l;
}
int prime(int x) {
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0)
return 0;
return 1;
}
void qsort() {
sz = c.size();
Fo(i, 0, sz - 1) {
minn = c[i];
min_op = i;
Fo(j,i+1,sz-1)
if (minn > c[j]) {
minn = c[j];
min_op = j;
}
swap(c[min_op], c[i]);
}
}
int main() {
cout << find(a) << " " << find_mid(b) << endl;
Fo(i, 0, 4) {
if (prime(a[i]) == 1 && !vis[a[i]]) {
vis[a[i]] = 1;
c.push_back(a[i]);
}
if (prime(b[i]) == 1 && !vis[b[i]]) {
vis[b[i]] = 1;
c.push_back(b[i]);
}
}
qsort();
Fo(i, 0, sz - 1)
cout << c[i] << " ";
return 0;
}
3.
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
typedef long long LL;
#define PI acos(-1)
#define fin freopen("data.txt","r",stdin)
#define INF 2147483647
#define eps 1e-7
#define L 100005
#define Fo(i,a,b) for(LL i=(a),_=(b); i<=_; i++)
#define Ro(i,b,a) for(LL i=(b),_=(a); i>=_; i--)
#define Ms(a,b) memset((a),(b),sizeof(a))
#define _ceil(_,__) (_+(__-1))/__
inline LL read() {
LL x = 0, f = 1;char c = getchar();
while (!isdigit(c)) {
if (c == '-')f = -f;c = getchar(); }
while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48ll), c = getchar();
return x * f;
}
class Point {
double m_x = 0, m_y = 0;
public:
Point(double x = 0, double y = 0) : m_x(x), m_y(y) {
cout << "Constructor of Point" << endl;
}
Point(const Point& p) :m_x(p.m_x), m_y(p.m_y) {
cout << "Copy constructor of Point" << endl;
}
~Point() {
cout << "Destructor of Point" << endl;
}
double getx() const {
//获取横坐标
return m_x;
}
double gety() const {
//获取纵坐标
return m_y;
}
friend double dis(const Point& a, const Point& b);
};
class Circle {
Point m_center; double m_radius = 1.0;
public:
Circle(double r = 1, const Point& p = Point()) :m_center(p), m_radius(r) {
cout << "Constructor of Circle" << endl;
}
~Circle() {
cout << "Destructor of Circle" << endl;
}
double S() const {
//圆的面积
return PI * m_radius * m_radius;
}
double C() const {
//圆的周长
return 2 * PI * m_radius;
}
};
double dis(const Point& a, const Point& b) {
//两点间距离
return sqrt(pow(abs(a.m_x - b.m_x), 2) + pow(abs(a.m_y - b.m_y), 2));
}
int main()
{
Circle a(2, Point(1, 1));
Point b(1, 1); //测试
cout << b.getx() << " " << b.gety() << endl;
cout << "end" << endl;
return 0;
}