Articolele lui Bacain Octavian-Tiberiu (Octavian2007)

#include
#include
#include
#define N 100000
#define M 44780

using namespace std;

ifstream cin(“forta.in”);
ofstream cout(“forta.out”);

short task;
int n, maxi, x, maxi2;
int v[N + 1];
int d[N + 1];
int fr[N + 1];
vector prime;
bitset e;

void read(){

cin >> task >> n; for(int i = 1; i <= n; i++) cin >> v[i];

}

void ciur(){

e⁰ = e¹ = 1; for(int i = 2; i <= M; i++){ if(!e[i]){ for(int j = i * 2; j <= M; j += i) e[j] = 1; } } for(int i = 2; i <= M; i++) if(!e[i]) prime.push_back(i);

}

int nr_divizori(int x){

int d = 1; int k = 0; while(x > 1){ int putere = 0; while(x % prime[k] == 0) x /= prime[k], putere++; d *= (putere + 1); k++; if(x > 1 && prime[k] * prime[k] > x){ d *= 2; break; } } return d;

}

void solve(){

for(int i = 1; i <= n; i++){ d[i] = nr_divizori(v[i]); fr[d[i]]++; if(d[i] > maxi){ maxi = d[i]; x = v[i]; }else if(d[i] == maxi) x = min(x, v[i]); } for(int i = 1; i <= N; i++) maxi2 = max(maxi2, fr[i]); if(task % 2) cout << x; else cout << maxi2; }

int main(){

read(); ciur(); solve();

}

#include
using namespace std;

ifstream fin(“ciocolata.in”);
ofstream fout(“ciocolata.out”);

using VI = vector;
using VVI = vector;

int is = 501, js = 501, iif = 501, jf = 501;
int p1, p2, p3, p4;
long long v = 0, c;

int main()
{ int n, m; fin >> n >> m; VVI a = VVI); for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { fin >> a[i][j]; a[i][j] += a[i – 1][j]; }

for (int i = 1; i <= n; ++i) { p1 = i; for (int j = i; j <= n; ++j) { p2 = j; p3 = 1; c = 0; for (int h = 1; h <= m; ++h) { c += a[j][h] – a[i – 1][h]; if (c > v) { v = c; is = p1; js = p3; iif = p2; jf = h; } else if (c <= 0) {p3 = h + 1; c = 0;} } } } fout << v << ‘\n’; fout << is << ‘ ‘ << js << ‘ ‘ << is << ‘ ‘ << jf << ‘\n’; fout << iif << ‘ ‘ << js << ‘ ‘ << iif << ‘ ‘ << jf << ‘\n’; return 0; }