点击这里更换您喜欢的皮肤wtboj 首页
请点击这里登入noios   首页 入门 c++讲义 入门教程视频 其他页面 入门视频 站务 公告 | 题库 记录 竞测 测试 闯关 作业 排名 团队 讨论 | 换肤 | 登入 注册  
News >>   新增功能:各团队管理员可以发布本团队作业了 ()

From sina002
A+B Problem
讨论 Discussion
 
79

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

vector<int> primeFactors(int n) {
  vector<int> factors;
  for (int i = 2; i <= sqrt(n); i++) {
    while (n % i == 0) {
      factors.push_back(i);
      n /= i;
    }
  }
  if (n > 1) {
    factors.push_back(n);
  }
  return factors;
}

int main() {
  int N;
  cin >> N;
  vector<int> factors = primeFactors(N);
  cout << N << " = ";
  for (int i = 0; i < factors.size(); i++) {
    if (i > 0) cout << " × ";
    cout << factors[i];
  }
  cout << endl;
  return 0;
}

( )

#include <iostream>
#include <iomanip>
using namespace std;
int main() {
freopen("p1728.in","r",stdin);
freopen("p1728.out","w",stdout);
int N;
cin >> N;
for(int i = 1; i <= N; ++i) {
for(int j = 1; j <= N; ++j) {
if(j <= N - i + 1)
cout << setw(3) << i;
else
cout << setw(3) << N - j + 1;
}
cout << endl;
}
fclose(stdin);
fclose(stdout);
return 0;
}
( )
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
freopen("p1124.in","r",stdin);
freopen("p1124.out","w",stdout);
int n;
cin >> n;
vector<int> gems(n);
for (int i = 0; i < n; ++i) {
cin >> gems[i];
}
int max_current = gems[0];
int max_global = gems[0];
for (int i = 1; i < n; ++i) {
max_current = max(gems[i], max_current + gems[i]);
if (max_current > max_global) {
max_global = max_current;
}
}
cout << max_global << endl;
fclose(stdin);
fclose(stdout);
return 0;
}
( )
发布讨论主题 回复讨论主题
Flag
  
题号
  P1000
  其它
通过
  400人
提交
  3319次
通过率
  12%
难度
  0
提交 讨论 题解
 Copyright wtboj © 2005-2006. www.wutuobang.date Powered by wtboj 关于 联系 帮助
 wtboj Information ---- Total Users : 1368 | Online Users / Processes : 0 / 103 | Processed Time : 502 ms | Server Time : 2026/3/16 6:06:54