JianJ

分类

/ 注册

全部文章（共53篇）

题解 | #整数拆分#

#include<iostream> #include<cstring> #include<algorithm> using namespace std; const int N = 1000010,MOD = 1e9; int n; int f[N]; i...

2024-03-06

0 182

题解 | #神奇的口袋#

#include<iostream> using namespace std; const int N = 30; int arr[N]; int ans = 0; int n; void bag(int sum, int i) { if (sum > 40) ret...

2024-03-06

0 186

题解 | #abc#

#include<iostream> using namespace std; int main(void) { for(int i = 0;i <= 9;i++) { for(int j = 0;j <= 9;j++) { for(int k = 0;k...

2024-03-06

0 159

题解 | #手机键盘#

#include<iostream> using namespace std; string str[] = {"","abc","def","ghi","jkl","mno&...

2024-03-05

0 171

题解 | #skew数#

#include<iostream> #include<math.h> using namespace std; int main(void) { string s; while(cin >> s) { int ans = 0; for(int ...

2024-03-05

0 144

题解 | #反序输出#

#include<iostream> using namespace std; #include<algorithm> int main(void) { string s; while(cin >> s) { reverse(s.begin(),s.e...

2024-03-05

0 123

题解 | #N的阶乘#

#include<iostream> #include<vector> #include<algorithm> using namespace std; vector<int> mul(vector<int> A, int b) { ...

2024-03-04

0 148

题解 | #递推数列#

#include<iostream> using namespace std; typedef long long LL; const int MOD = 10000; const int N = 1e6 + 10; int arr[N]; LL a0,a1,p,q,k; int...

2024-03-03

0 143

题解 | #完数VS盈数#

#include<iostream> using namespace std; const int N = 100; int wan[N]; int yin[N]; //完数返回 1，盈数返回0 int find(int n) { int sum = 0; for(int ...

2024-03-03

0 186

题解 | #今年的第几天？#

#include<iostream> using namespace std; int arr[] = {0,31,28,31,30,31,30,31,31,30,31,30,31}; bool isRun(int year) { if(year % 4 == 0 &&am...

2024-03-02

0 153