Var K:array[1..2,1..13] of integer; i,j,ind,x,y:integer; MAX:real; function RAST(x1,x2,y1,y2:integer):real; begin RAST:=sqrt(sqr(x2-x1)+sqr(y2-y1)); end; begin MAX:=-2*sqr(-10-1); randomize; writeln('Исходные точки:'); for j:=1 to 13 do begin writeln('Точка № ',j,', с координатами(X,Y)'); for i:=1 to 2 do begin K[i,j]:=random(110) - 10; write(K[i,j],' '); end; writeln; end; for i:=1 to 13 do if RAST(0,K[1,i],0,K[2,i])>MAX then begin MAX:=RAST(0,K[1,i],0,K[2,i]); x:=K[1,i]; y:=K[2,i]; ind:=i; end; writeln('Номер точки: ',ind,' Координаты: ',x,' ; ',y); end.
#include <iostream>
#include <vector>
using namespace std;
bool isLeap(int y){
return (y % 400 == 0 || (y % 4 == 0 && y % 100 != 0));
}
signed main(){
string s, cur;
cin >> s;
vector<int> d;
for(int i = 0; i < s.length(); i++){
if(s[i] == '.'){
d.push_back(stoi(cur));
cur.clear();
}
else
cur += s[i];
}
d.push_back(stoi(cur));
int k = d[0];
d[1]--;
while(d[1] > 0){
if(d[1] == 2) k += 28 + isLeap(d[2]);
else if((d[1] < 8 && d[1] % 2 == 1) || (d[1] >= 8 && d[1] % 2 == 0)) k += 31;
else k += 30;
d[1]--;
}
cout << (365 + isLeap(d[2])) - k + 1;
}