- 进制判断
题解
-
min_element
LV 6
@
2024-4-20 15:49:01
#include <bits/stdc++.h>
using namespace std;
int ans=0;
int n,k;
int sz[20];
bool isPrime(int i) {
if (i==2) return 1;
for (int j = 2; j*j <= i; j++) {
if (i%j == 0) {
__________
}
}
___________
}
void dfs(int start, int count, int sum) {
________________________________________
_____
}
for (_________________________) {
______________________________
}
}
int main() {
int i;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> sz[i];
}
_____________
cout << ans << endl;
return 0;
}
4 条评论
-
huyunyi1 LV 7 @ 2024-4-20 17:57:48gs
-
@ 2024-4-20 16:14:02
#include<bits/stdc++.h> using namespace std; ____________ int main() { __________ _______________ _ _______________ __________ ________________ _ ________________ _ _______ ______ _ __________________ _ ________ _ __________ _________ _ _ } -
@ 2024-4-20 16:02:28
春游题解
#include<iostream> using namespace std; int main() { int ____; cin>>_>>_; _________________; _______________________________ _ ____________ _ for(int i=1;i<=m;i++){ ______ ______ __________ } ____________ for(_______________){ if(____) { ________ __________; } } if(flag) { cout<<n; } }题解禁止抄袭，否则棕名警告
- 1
