include <iostream>

using namespace std;

int main() { unsigned int n, nn; cin >> n; if (n == 4) { nn = 12; } if (n < 4) { nn = 1 * 4 + (n - 1) * 3; } if (n > 4) { int z = n / 4; nn = 1 * 12 + (z - 1) * 10; n = n % 4; if (n == 1) { nn = nn + 3; } if (n == 2) { nn = nn + 5; } if (n == 3) { nn = nn + 8; } } cout << nn << endl; return 0; } не пойму, почему он не проходит все проверки

Nikolas9896

Greate!!! Thank you!!!

NATALIA__123

var n,max,s,m,k,i,j: longist; begin readln (n); if trunc(sqrt(n))<>sqrt(n) then begin m:=trunc(sqrt(n))+1; s:=4+(m-2)23+(m-2)*2;end else begin m:=trunc(sqrt(n)); s:=4+(m-1)*32+(m-1)(m-1)*2; writeln(s); halt;end; max:=n-(m-1)*(m-1); k:=1; s:=s+3; for i:=2 to m-1 do begin if k=max then begin writeln (s);halt;end; s:=s+3;inc(k); for i:=2 to m do begin if k=max then begin writeln (s);halt;end; s:=s+2; inc(k);end;writeln (s); end.

DimaGashko

Насколько ж легкая эта задача после 3

luchkivmo

Не можу ніяк до неї взятись...допоможіть =) Python

Parvin02

import math n = int(input()) result = 2 * n + math.floor(math.sqrt(n)) + math.ceil(n/math.floor(math.sqrt(n))) print(result)

ZeynalovAbbas

include <iostream> using namespace std;

int main() { unsigned int n, nn; cin >> n; if (n == 4) { nn = 12; } if (n < 4) { nn = 1 * 4 + (n - 1) * 3; } if (n > 4) { int z = n / 4; nn = 1 * 12 + (z - 1) * 10; n = n % 4; if (n == 1) { nn = nn + 3; } if (n == 2) { nn = nn + 5; } if (n == 3) { nn = nn + 8; } } cout << nn << endl; return 0; } не пойму, почему он не проходит все проверки

nigga____rrrrrrrrrrrrrr

include <iostream>

using namespace std;

long long N, answer, M;

int main() {

cin >> N; M = 0;

while (M * M < N) M++;

M--;

answer += M * (M+1) * 2;

answer += (N - M * M)*2;

answer++;

if (N - M * M > M) answer++;

cout << answer << endl; }

aykhankazimli

include<bits/stdc++.h>

using namespace std; int main() { int n; cin >> n; n*=4; n/=2; cout << n + 4; return 0; }

Isam

include<bits/stdc++.h>

using namespace std; int main(){ long long N,answer,M; cin>>N;M=0; while(M*M<N) M++; M--; answer+=M*(M+1)2; answer+=(N-MM)2; answer++; if(N-MM>M) answer++; cout<<answer; }//QehremanliTuran, thanks for code.

wraith1

x=int(input()) if x<=3: y=1+3*x print(y) else: w=x%2 u=(x-5)/2 z=x-4 u1=(x-4)/2 while w!=0: z-=u y=10+2*z+3*z break while w<0.001: z-=u1 y = 10 + 2 * (z+1) + 3 * z break print(y) Вроде все должно работать, но проверку не проходит.

Qurbanli

include<iostream>

include<cmath>

using namespace std; int main (){ int x,y,m,n,d; cin>>x; y=sqrt(x); m=yy; n=x-m; if(n<=y&&n!=0){ n=n2+1; } else if(n>=y){ n=n2+2; } cout<<m2+y*2+n;

}

yureache32

include<iostream>

include<vector>

include<algorithm>

using namespace std;
int main() {
long long n,s=0,t,f;
cin>>n;
vector<long long> p;
vector<long long> p1;
t=n;
while(t) {
t/=10; s++;
}
f=n;
for(int i=0; i<s; i++) {
p.push_back(f%10);
f/=10;
}
for(int i=0; i<s; i++) {
p1.push_back(n%10);
n/=10;
}
sort(p.begin(),p.end());
for(int i=0; i<s; i++)
{ f=f*10+p[i]%10; } sort(p1.begin(),p1.end());
reverse(p1.begin(),p1.end());
for(int i=0; i<s; i++)
n=n*10+p1[i]%10;
cout<<n+f<<endl;
return 0;
}

El_Xassdylo

using System;

class Program { static int Kvadrat(int k) { int line = Convert.ToInt32(Math.Sqrt(k)); int first_line = 4 + ((line - 1) * 3); int next_line = 3 + ((line - 1) * 2); int result = first_line + next_line * (line - 1);

    return result;
}

static void Main(string[] args)
{
    int k = int.Parse(Console.ReadLine());

    int squareRoot = (int)Math.Sqrt(k);
    if (squareRoot * squareRoot == k)
    {
        Console.WriteLine(Kvadrat(k));
    }
    else
    {
        int temp = 0;
        bool square = true;
        while (square)
        {
            if (squareRoot * squareRoot == k)
            {
                if (temp <= squareRoot)
                {
                    int nonfinish = Kvadrat(k);
                    int plus = 3 + (temp - 1) * 2;
                    Console.WriteLine(nonfinish + plus);
                }
                else
                {
                    int nonfinish = Kvadrat(k);
                    int firstline = 3 + (squareRoot - 1) * 2;
                    temp -= squareRoot;
                    int secondline = 3 + (temp - 1) * 2;

                    Console.WriteLine(nonfinish + firstline + secondline);
                }
                square = false;
            }
            else
            {
                k--;
                temp++;
            }
        }
    }
}

}