<!DOCTYPE html>
<html>
<head>
<script>
function BbIBOD()
{
let n = document.getElementById("BBOD").value;
let BbIBOD = document.getElementById("BbIBOD");
let S = "";
let F = "";
for (let j = 0; j < n; j++)
{
S += '*';
}
for (let i = 0; i < n; i++)
{
F += "<div>" + S + "</div>";
}
BbIBOD.innerHTML = F;
}
</script>
</head>
<body>
<form onSubmit="BbIBOD(); return false;">
<label for="BBOD" >n = </label><input id="BBOD" type="text">
<div id="BbIBOD"></div>
</form>
</body>
</html>
Ответ:
#include <QCoreApplication>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, char *argv[])
{
QCoreApplication ap(argc, argv);
FILE *fp, *fout;
long long a, b, c, m;
fp = fopen ("0","r+");
fscanf (fp, "%lld\n%lld\n%lld", &a, &b, &c);
fclose(fp);
long long sum = 2 * a + 3 * b + 4 * c;
long long cnt = a + b + c;
long long l = 0, r = cnt + 1;
// Алгоритм бинарного поиска
while (l < r)
{
m = (l + r) / 2;
if ((sum + 5.0 * m) / (cnt + m) < 3.5)
l = m + 1;
else
r = m;
}
fout = fopen ("0.a","w+");
fprintf (fout,"%lld",l);
fclose(fout);
return
Объяснение: