题目https://iai.sh.cn/contest/indexT1#include <iostream>using namespace std;int main(){ int n, cnt = 0; while(cin >> n) { cnt++;
题目https://iai.sh.cn/contest/7T1#include <iostream>using namespace std;int main(){ int a, x, y; cin >> a >> x >>
T1#include <bits/stdc++.h>using namespace std;bool isPerfectSquare(int n){ int root = sqrt(n); return root * root == n;}int main(){ int n; cin < n; ret
T1#include <iostream>using namespace std;int main(){ int day = 3, remain = 10; int n; cin >> n; while(remain != n) { day++;
T1#include <iostream>using namespace std;int main(){ int n; cin >> n; int a = 1;//初始化,0刀是一块 for(int i = 1; i <= n; i++) {
解法一一、分析采用二维数组的前缀和来算。二、时间复杂度O(n^4)三、代码#include <iostream>using namespace
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号