星云·忒弥斯

分类

题解(8)

/ 注册

全部文章（共8篇）

题解 | #1到n中1的出现次数#

include include using namespace std;int mm = 1e9 + 7; vector<vector<long long="">> matriMulti(vector<vector<long long=&quo...

2021-08-23

2 353

题解 | #约数的个数#

include int main(){ int a0, a1, a2, p, q, k; scanf("%d%d%d%d%d",&a0,&a1,&p,&q,&k); // a1 %= 10000; //如果读入数据...

2021-08-19

3 431

题解 | #删除元素#

class Solution {public: int removeElement(int A[], int n, int elem) { for(int i = 0; i < n; i++){ if(A[i] == elem){ ...

2021-08-18

3 307

题解 | #枪打出头鸟#

include class Solution {public: /** * * @param n int整型 * @param k int整型 * @param card int整型vector<vector<>> * @ret...

2021-08-16

3 569

题解 | #矩阵元素查找#

class Solution {public: vector<int> findElement(vector<vector<int> > mat, int n, int m, int x) { // write code here ...

2021-08-16

2 364

题解 | #整除问题#

const int M = 1e5+7; class Solution { public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * ...

2021-08-16

2 405

题解 | #椭圆曲线#

/** struct Point { int x; int y; }; */ class Solution{ uint64_t Modp = 1000000007; uint32_t Inv(uint64_t num) { uint32_t...

2021-08-15

2 326

题解 | #数组中的逆序对#

class Solution {public: int InversePairs(vector<int> data) { int length=data.size(); if(length<=0) return 0; ...

2021-08-15

2 333