算法竞赛入门【码蹄集新手村600题】(MT1551-1600）[通俗易懂]

#include <bits/stdc++.h>
using namespace std;
int find(char s[],int len, char *p[]){ 

char* pos=s;
int cnt=0;
for (int i=0; i<len; i++){ 

if (s[i]=='\0' && s[i-1]!='\0') { 

p[cnt]=pos;
cnt++;
pos=s+i+1;
}
}
return cnt;
}
int main(){ 

char s[] = "1\0love\0my\0mother\0";
int len = sizeof(s);
char *p[100];
int cnt=find(s, len, p);
for (int i=0;i<cnt; i++){ 

printf("%s\n",p[i]);
}
return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main() { 

char s[10][100];
for (int i = 0; i < 10; i++)
cin.getline(s[i],100);
char *sorted [10];
for (int i = 0; i < 10; i++) sorted[i] = s[i];
for (int i = 0; i < 10; i++) { 
 
int pos = i;
for (int j = i; j < 10; j++)
if (strcmp(sorted[pos], sorted[j]) > 0) pos = j;
char *t = sorted [pos];
sorted [pos] = sorted[i];
sorted[i] = t;
}
for (int i=0; i<10;i++)
printf("%s\n", sorted[i]);
return 0;
}

#include <bits/stdc++.h>
using namespace std;
void visitint(void *p){ 

printf("%d",*((int *) p));
}
void visitchar(void *p){ 

printf("%c ", *((char *) p));
}
void visitdouble(void *p) { 

printf("%lf", * ((double *) p)) ;
}
void Traverse(void *p, int n, void(*visit) (void *ep)) { 

for(int i=0;i<n;i++){ 

visit((char*) p + i * (visit == visitchar ? sizeof(char) : (visit ==visitint?sizeof(int):sizeof(double))));
}
}
int main() { 

int a[]={ 
1,2,3,4,5,6,7,8,9} ;
Traverse(a, 9, visitint);
printf("\n");
double b[]={ 
1.,2.,3.,4.,5.,6.,7.,8.,9.};
Traverse(b, 9, visitdouble);
printf("\n");
char s[]="abcdefghi";
Traverse(s, 9, visitchar);
return 0;
}

#include <bits/stdc++.h>
int add(int a, int b) { 

return a+b;
}
int minus(int a, int b) { 

return a-b;
}
int main(){ 

int a, b;
scanf ("%d%d", &a, &b) ;
int (*p) (int a, int b);
p=add;
printf("%d ",p(a, b));
p=minus;
printf("%d ",p(a, b));
}

#include <bits/stdc++.h>
using namespace std;
int getPointer(int a[], int n, int key){ 

for (int i= 0; i < n; i++)
if (key == a[i])
return i;
return -1;
}
int main() { 

int a [100], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int key;
cin >> key;
printf("%d", getPointer(a, n, key)) ;
}

#include <bits/stdc++.h>
using namespace std;
typedef struct Node{ 

int value;
Node *next;
} NODE, *PNODE,*NodeList;
PNODE createNode (int value, PNODE next){ 

PNODE node = (PNODE) malloc(sizeof (NODE)) ;
node->value = value;
node->next = next;
return node;
}
int main(){ 

int n, m;
scanf("%d %d'", &n, &m) ;
NodeList head, last;
for(int i=0; i<n; ++i) { 

PNODE node = createNode(i+1, NULL) ;
if(i == 0){ 

head = node;
last = node;}
else{ 

last->next = node;
last = node;
}
if(i==n-1)
last->next=head;
}
int i=1;
while(head->next!=head){ 

if(i==m){ 

PNODE p=head;
last->next=head->next;
free(p);
i=1;
head=last->next;
}
else{ 

last=head;
head=head->next;
i++;
}
}
printf("%d",head->value);
return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef struct Node{ 

int value;
Node *next;
} NODE, *PNODE,*NodeList;
PNODE createNode (int value, PNODE next){ 

PNODE node = (PNODE) malloc(sizeof (NODE)) ;
node->value = value;
node->next = next;
return node;
}
int main(){ 

int n, m;
scanf("%d %d'", &n, &m) ;
NodeList head, last;
for(int i=0; i<n; ++i) { 

PNODE node = createNode(i+1, NULL) ;
if(i == 0){ 

head = node;
last = node;}
else{ 

last->next = node;
last = node;
}
if(i==n-1)
last->next=head;
}
int i=1;
while(head->next!=head){ 

if(i==m){ 

PNODE p=head;
last->next=head->next;
printf("%d ",head->value);
free(p);
i = 1;
head = last->next;
}
else{ 

last=head;
head=head->next;
i++;
}
}
printf("%d ",head->value);
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Wolf{ 

string name;
int age;
string sex;
}w[1005];
int main( )
{ 

cin>>w[0].name>>w[0].age>>w[0].sex;
cout<<w[0].name<<" "<<w[0].age<<" "<<w[0].sex<<endl;
return 0;
}

#include <bits/stdc++.h>
using namespace std;
struct BABY { 

char name[100];
int age;
char sex;
};
int main()
{ 

BABY a[5];
for(int i=0;i<5;i++)
scanf("%s%d %c", a[i].name, &a[i].age, &a[i].sex);
for (int i=0;i<5;i++)
printf("%s %d %c ", a[i].name, a[i].age, a[i].sex);
return 0;
}

#include <bits/stdc++.h>
using namespace std;
struct DRAGON { 

char race [20];
char color[20];
int power;
};
int main()
{ 

struct DRAGON a[3];
int i;
for (i=0; i<3; i++)
scanf("%s%s%d", a[i].race, a[i].color, &a[i].power) ;
for(i=0; i<3; i++) { 

printf("%s %s %d", a[i].race, a[i].color, a[i].power);
printf("\n");
}
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct shibin{ 

char name[1005],tool[1005];
int force;
}shi[3];
int main( )
{ 

for(int i=0;i<2;i++){ 

cin>>shi[i].name>>shi[i].tool>>shi[i].force;
}
if(shi[0].force>=shi[1].force){ 

cout<<shi[0].name<<" "<<shi[0].tool<<" "<<shi[0].force<<endl;
cout<<shi[1].name<<" "<<shi[1].tool<<" "<<shi[1].force;
}else{ 

cout<<shi[1].name<<" "<<shi[1].tool<<" "<<shi[1].force<<endl;
cout<<shi[0].name<<" "<<shi[0].tool<<" "<<shi[0].force;
} 
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct shibin{ 

char name[1005];
int force;
}shi[5];
int main( )
{ 

for(int i=0;i<4;i++){ 

cin>>shi[i].name>>shi[i].force;
}
int maxx=shi[0].force,index=0;
for(int i=1;i<4;i++){ 

if(shi[i].force>maxx){ 

maxx=shi[i].force;
index = i;
}
}
cout<<shi[index].name<<" "<<shi[index].force<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct shibin{ 

char name[1005];
int force;
}shi[5];
int main( )
{ 

for(int i=0;i<4;i++){ 

cin>>shi[i].name>>shi[i].force;
}
int minn=shi[0].force,index=0;
for(int i=1;i<4;i++){ 

if(shi[i].force<minn){ 

minn=shi[i].force;
index = i;
}
}
cout<<shi[index].name<<" "<<shi[index].force<<endl;
return 0;
}

#include<stdio.h>
struct Book { 

char typical[10];
char book[50];
int page;
};
struct Book bookneed[100];
int main()
{ 

int i,j;
for(i=1;i<=3;i++){ 

scanf("%s",&bookneed[i].typical);
scanf("%s",&bookneed[i].book);
scanf("%d",&bookneed[i].page);
}
for(i=1;i<=3;i++){ 

for(j=1;j<=3-i;j++) { 

if (bookneed[j + 1].page < bookneed[j].page) { 

bookneed[0] = bookneed[j+1];
bookneed[j + 1] = bookneed[j];
bookneed[j] = bookneed[0];
}
}
}
printf("%s %s %d",bookneed[1].typical,bookneed[1].book,bookneed[1].page);
return 0;
}

#include<stdio.h>
struct AgeMan{ 

char name[50];
int age;
};
struct AgeMan Minage[10];
int main()
{ 

int n,j,i;
for(n=1;n<=5;n++) scanf("%s %d",&Minage[n].name,&Minage[n].age);
for(i=0; i<5; i++){ 

for(j=0; j<5-i; j++){ 

if(Minage[j+1].age>Minage[j].age){ 

Minage[0] = Minage[j+1];
Minage[j+1] = Minage[j];
Minage[j] = Minage[0];
}
}
}
printf("%s %d",Minage[0].name,Minage[0].age);
return 0;
}

#include<stdio.h>
struct AgeMan{ 

char name[50];
int age;
};
struct AgeMan Minage[10];
int main()
{ 

int n,j,i;
for(n=1;n<=5;n++) scanf("%s %d",&Minage[n].name,&Minage[n].age);
for(i=0; i<5; i++){ 

for(j=0; j<5-i; j++){ 

if(Minage[j+1].age<Minage[j].age){ 

Minage[0] = Minage[j+1];
Minage[j+1] = Minage[j];
Minage[j] = Minage[0];
}
}
}
printf("%s %d",Minage[0].name,Minage[0].age);
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct yuangong{ 

int id,salary;
string name;
}y[4];
int main( )
{ 

for(int i=0;i<3;i++){ 

cin>>y[i].id>>y[i].name>>y[i].salary;
}
int index=0,maxx=y[0].salary;
for(int i=1;i<3;i++){ 

if(maxx<y[i].salary){ 

maxx = y[i].salary;
index = i;
}
}
cout<<y[index].id<<" "<<y[index].name<<" "<<maxx<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct student{ 

int id;
double source1,source2,source3;
string name;
}s[1005];
int main( )
{ 

double sum[105];
for(int i=0;i<3;i++){ 

cin>>s[i].id>>s[i].name>>s[i].source1>>s[i].source2>>s[i].source3;
sum[i]=s[i].source1+s[i].source2+s[i].source3;
}
int index=0;
double maxx=sum[0];
for(int i=1;i<3;i++){ 

if(maxx<sum[i]){ 

maxx = sum[i];
index = i;
}
}
cout<<s[index].id<<" "<<s[index].name<<" "<<s[index].source1<<" "<<s[index].source2<<" "<<s[index].source3;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct book{ 

string name,kind;
int price;
}b[1005];
int main( )
{ 

for(int i=0;i<3;i++) cin>>b[i].kind>>b[i].name>>b[i].price;
for(int i=0;i<3;i++){ 

if(b[i].kind=="c"){ 

cout<<b[i].kind<<" "<<b[i].name<<" "<<b[i].price<<endl;
}
}
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct cun{ 

string name;
int num,age;
}c[1005];
int main( )
{ 

for(int i=0;i<3;i++) cin>>c[i].name>>c[i].age>>c[i].num;
for(int i=0;i<3;i++){ 

if(c[i].num<3){ 

cout<<c[i].name<<" "<<c[i].age<<" "<<c[i].num<<endl;
}
}
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct STUDENT{ 

int number;
char name[20];
int income;
};
int main( )
{ 

STUDENT stu;
int subsidy;
for(int j=0;j<3;j++){ 

scanf("%d %s %d",&(stu.number),stu.name,&(stu.income));
if(stu.income<10000) subsidy=5000;
else if(stu.income<20000) subsidy=3000;
else if(stu.income<30000) subsidy=1000;
else subsidy=0;
printf("%d %s %d %d\n",stu.number,stu.name,stu.income,subsidy);
}
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Cost{ 

int quarter;
int netFee;
int telFee;
}cost[4];
int main( )
{ 

int ans=0;
for(int i=0;i<4;i++){ 

cin>>cost[i].quarter>>cost[i].netFee>>cost[i].telFee;
}
for(int i=0;i<4;i++){ 

ans+=cost[i].netFee;
ans+=cost[i].telFee;
}
cout<<ans<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Vegetable{ 

char foodName[1005];
double wight,danjia;
}Vegetable[3];
int main( )
{ 

double res;
for(int i=0;i<3;i++){ 

cin>>Vegetable[i].foodName>>Vegetable[i].wight>>Vegetable[i].danjia;
}
for(int i=0;i<3;i++){ 

res+=Vegetable[i].wight * Vegetable[i].danjia;
}
cout<<fixed<<setprecision(6)<<res<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct huarui{ 

char name[1005];
int num,price;
}huarui[4];
int main( )
{ 

int ans=0;
for(int i=0;i<4;i++){ 

cin>>huarui[i].name>>huarui[i].num>>huarui[i].price;
}
for(int i=0;i<4;i++){ 

ans+=huarui[i].num*huarui[i].price;
}
cout<<ans<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Food{ 

char name[1005];
int calorie;
}food[3];
int main( )
{ 

double ans;
for(int i=0;i<3;i++){ 

cin>>food[i].name>>food[i].calorie;
}
for(int i=0;i<3;i++){ 

ans+=food[i].calorie;
}
double res = ans*1.0/50;
cout<<fixed<<setprecision(6)<<res<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct body{ 

char name[50];
int cal;
}body[4];
int main( )
{ 

int ans;
for(int i=0;i<4;i++){ 

cin>>body[i].name>>body[i].cal;
}
for(int i=0;i<4;i++){ 

ans+=body[i].cal;
}
double res = ans*1.0/0.05;
cout<<fixed<<setprecision(6)<<res<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Money{ 

int quarter;
int pay;
}money[3];
int main( )
{ 

for(int i=0;i<4;i++) cin>>money[i].quarter>>money[i].pay;
int temp=0;
for(int i=0;i<4;i++){ 

temp+=money[i].pay-3000*3;
if(temp<0) temp=0;
}
cout<<temp<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct COMPLEX{ 

double r,i;
COMPLEX operator+(const COMPLEX &a){ 

COMPLEX rtn;
rtn.r = this->r+a.r;
rtn.i = this->i+a.i;
return rtn;
}
COMPLEX operator-(const COMPLEX &a){ 

COMPLEX rtn;
rtn.r = this->r-a.r;
rtn.i = this->i-a.i;
return rtn;
}
COMPLEX operator*(const COMPLEX &a){ 

COMPLEX rtn;
rtn.r = this->r*a.r-this->i*a.i;
rtn.i = this->r*a.i+ this->i*a.r;
return rtn;
}
COMPLEX operator/(const COMPLEX &a){ 

COMPLEX rtn;
rtn.r = (this->r*a.r+this->i*a.i)/(a.r*a.r+a.i*a.i);
rtn.i = (this->i*a.r-this->r*a.i)/(a.r*a.r+a.i*a.i);
return rtn;
}
};
int main( )
{ 

COMPLEX a,b,c;
scanf("%lf %lf %lf %lf",&a.r,&a.i,&b.r,&b.i);
c = a+b;
if(c.i>0) printf("%.3lf+%.3lfi\n",c.r,c.i);
else if(c.i<0) printf("%.3lf%.3lfi\n",c.r,c.i);
c = a-b;
if(c.i>0) printf("%.3lf+%.3lfi\n",c.r,c.i);
else if(c.i<0) printf("%.3lf%.3lfi\n",c.r,c.i);
c = a*b;
if(c.i>0) printf("%.3lf+%.3lfi\n",c.r,c.i);
else if(c.i<0) printf("%.3lf%.3lfi\n",c.r,c.i);
c = a/b;
if(c.i>0) printf("%.3lf+%.3lfi\n",c.r,c.i);
else if(c.i<0) printf("%.3lf%.3lfi\n",c.r,c.i);
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Fraction{ 

int fenzi,fenmu;
}fraction[2];
int gcd(int x,int y){ 

return (!y)?x:gcd(y,x%y);
}
void myPrint(int zi,int mu){ 

bool isPositive = true;
if((zi*mu)<0) isPositive = false;
zi = abs(zi);
mu = abs(mu);
if(mu==1){ 

if(isPositive) printf("%d\n",zi);
else printf("-%d\n",zi);
}else{ 

if(isPositive) printf("%d/%d\n",zi,mu);
else printf("-%d/%d\n",zi,mu);
}
}
int main( )
{ 

int zi=0,mu=0;
for(int i=0;i<2;i++){ 

cin>>fraction[i].fenzi>>fraction[i].fenmu;
}
// 加
zi = fraction[0].fenzi*fraction[1].fenmu+fraction[1].fenzi*fraction[0].fenmu;
mu = fraction[0].fenmu*fraction[1].fenmu;
int temp = gcd(zi,mu);
zi /= temp;
mu /= temp;
myPrint(zi, mu);
//减
zi = fraction[0].fenzi*fraction[1].fenmu-fraction[1].fenzi*fraction[0].fenmu;
mu = fraction[0].fenmu*fraction[1].fenmu;
temp = gcd(zi,mu);
zi /= temp;
mu /= temp;
myPrint(zi, mu);
//乘
zi = fraction[0].fenzi*fraction[1].fenzi;
mu = fraction[0].fenmu*fraction[1].fenmu;
temp = gcd(zi,mu);
zi /= temp;
mu /= temp;
myPrint(zi, mu);
//除
zi = fraction[0].fenzi*fraction[1].fenmu;
mu = fraction[0].fenmu*fraction[1].fenzi;
temp = gcd(zi,mu);
zi /= temp;
mu /= temp;
myPrint(zi, mu);
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Student{ 

char name[20];
char tel[15];
char sex[5];
char classID[20];
int grade;
}stduent[1005];
int main( )
{ 

int n,cnt=0;
cin>>n;
for(int i=0;i<n;i++){ 

cin>>stduent[i].name>>stduent[i].tel>>stduent[i].sex>>stduent[i].classID>>stduent[i].grade;
}
for(int i=0;i<n;i++){ 

if(stduent[i].grade<60) cnt++;
}
cout<<cnt<<endl;
return 0;
}

import java.util.Scanner;
import java.util.*;
class Main { 

public static void main(String[] args) { 

Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int count=0;
for(int i=0;i<n;i++){ 

String name = sc.next();
String tel = sc.next();
String sex = sc.next();
String level = sc.next().toLowerCase();
int salary = sc.nextInt();
if(level.contains("jiangshi")) count++;
}
System.out.println(count);
sc.close();
}
}

#include<bits/stdc++.h> 
using namespace std;
struct DATE{ 

int month,day;
};
int main( )
{ 
DATE date;
int tempday,MOD;
cin >> date.month >> date.day;
int a[]={ 
0,31,59,90,120,151,181,212,243,273,304,334,365};
tempday=a[date.month-1]+date.day+5;
MOD = tempday%7;
MOD = MOD+6;
if(MOD>7) MOD = MOD%7;
printf("%d",MOD);
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct DATE{ 

int month,day;
};
int DATEtoDAY(DATE date){ 

int count=0;
int m[]={ 
0,31,28,31,30,31,30,31,31,30,31,30,31};
for(int i=1;i<=date.month;i++)
count += m[i-1];
count += date.day;
return count;
}
DATE DAYtoDATE(int count){ 

DATE date;
int m[]={ 
0,31,28,31,30,31,30,31,31,30,31,30,31};
int i=1;
while(count>m[i]){ 

count -= m[i];
i++;
}
date.month = i;
date.day = count;
return date;
}
int main( )
{ 

DATE date;
scanf("%d %d",&date.month,&date.day);
int n;
scanf("%d",&n);
int count=DATEtoDAY(date);
count += n;
date = DAYtoDATE(count);
printf("%d %d",date.month,date.day);
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct DATE{ 

int month,day;
};
int DATEtoDAY(DATE date){ 

int count=0;
int m[]={ 
0,31,28,31,30,31,30,31,31,30,31,30,31};
for(int i=1;i<=date.month;i++)
count += m[i-1];
count += date.day;
return count;
}
DATE DAYtoDATE(int count){ 

DATE date;
int m[]={ 
0,31,28,31,30,31,30,31,31,30,31,30,31};
int i=1;
while(count>m[i]){ 

count -= m[i];
i++;
}
date.month = i;
date.day = count;
return date;
}
int main( )
{ 

DATE date1,date2;
scanf("%d %d",&date1.month,&date1.day);
scanf("%d %d",&date2.month,&date2.day);
int n=DATEtoDAY(date2)-DATEtoDAY(date1);
printf("%d",n);
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Point{ 

int x,y;
}point[2];
int main( )
{ 

for(int i=0;i<2;i++){ 

cin>>point[i].x>>point[i].y;
}
double dist=0;
dist = sqrt(pow(point[0].x-point[1].x,2.0)+pow(point[0].y-point[1].y,2.0));
cout<<fixed<<setprecision(2)<<dist<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Point{ 

int x,y;
}point[2];
struct Rect{ 

Point lt,rb;
}rect;
int main( )
{ 

int ans;
for(int i=0;i<2;i++){ 

cin>>point[i].x>>point[i].y;
}
rect.lt = point[0],rect.rb = point[1];
int length =0,width=0;
length = abs(rect.lt.x-rect.rb.x);
width = abs(rect.lt.y-rect.rb.y);
ans=length*width;
cout<<ans<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
double res,PI=3.1415926;
struct Point{ 

int x,y;
}point;
struct Rect{ 

Point c;
double r;
}rect;
int main( )
{ 

cin >> point.x >> point.y >>rect.r;
rect.c = point;
res = PI*rect.r*rect.r;
cout<<fixed<<setprecision(2)<<res<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
typedef long long ll;
struct Cuboid{ 

int l,w,h;
}cuboid[1005];
int main( )
{ 

ll n;
int index=0,maxx=0;
cin>>n;
for(int i=1;i<=n;i++){ 

cin>>cuboid[i].l>>cuboid[i].w>>cuboid[i].h;
}
for(int i=1;i<=n;i++){ 

ll temp=0;
temp=(cuboid[i].l*cuboid[i].w+cuboid[i].l*cuboid[i].h+cuboid[i].h*cuboid[i].w)*2;
if(temp>maxx){ 

maxx = temp;
index = i;
}
}
cout<<index<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Point{ 

int x,y;
}point[2];
struct Rect{ 

Point c;
double r;
}rect;
int main( )
{ 

cin>>point[0].x>>point[0].y>>rect.r;
cin>>point[1].x>>point[1].y;
rect.c = point[0];
double dist=0;
dist = sqrt(pow(point[0].x-point[1].x,2.0)+pow(point[0].y-point[1].y,2.0));
if(abs(dist-rect.r)<0.000001) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Point{ 

int x,y;
}point[5];
struct Rect{ 

Point lt,rb;
}rect;
int main( )
{ 

bool flag=false;
for(int i=1;i<=3;i++) cin>>point[i].x>>point[i].y;
rect.lt = point[1];
rect.rb = point[2];
if(point[3].x==rect.lt.x || point[3].x == rect.rb.x){ 

if(point[3].y >= rect.rb.y && point[3].y <=rect.lt.y) 
flag=true;
}
if(point[3].y == rect.lt.y || point[3].y == rect.rb.y){ 

if(point[3].x >= rect.lt.x && point[3].x <= rect.rb.x)
flag=true;
}
if(flag) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct Point{ 

int x,y;
}point[2];
struct Rect{ 

Point c;
double r;
}rect;
int main( )
{ 

cin>>point[0].x>>point[0].y>>rect.r;
cin>>point[1].x>>point[1].y;
rect.c = point[0];
double dist=0;
dist = sqrt(pow(point[0].x-point[1].x,2.0)+pow(point[0].y-point[1].y,2.0));
if(rect.r-dist>0) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}

#include<bits/stdc++.h>
using namespace std;
struct POINT{ 

int x,y;
};
struct RECT{ 

POINT lt,rb;
};
int main(){ 

RECT rect;
POINT point;
scanf("%d %d", &(rect.lt.x), &(rect.lt.y));
scanf("%d %d", &(rect.rb.x), &(rect.rb.y));
scanf("%d %d", &(point.x), &(point.y));
if((point.x > rect.lt.x && point.x<rect.rb.x)&&(point.y > rect.rb.y && point.y < rect.lt.y))
printf("YES\n");
else printf("NO\n");
return 0;
}

#include<bits/stdc++.h>
using namespace std;
struct POINT{ 
 //点
int x,y; //坐标值×和y
};
struct LINE{ 
 //线
POINT s,e; //线的两端
};
int main()
{ 

POINT p;
LINE line;
double s,d,h;
scanf("%d%d", &line.s.x, &line.s.y);
scanf("%d%d", &line.e.x, &line.e.y);
scanf("%d%d", &p.x, &p.y);
s=fabs(line.s.x*(line.e.y-p.y)+line.e.x*(p.y-line.s.y)+p.x*(line.s.y-line.e.y))/2;
d=sqrt((line.e.x-line.s.x)*(line.e.x-line.s.x)+(line.e.y-line.s.y)*(line.e.y-line.s.y));
h=s*2/d;
printf("%.2lf\n",h);
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
double res;
struct Point{ 

int x,y;
}point[2];
struct Circle{ 

Point c;
double r;
}circle;
int main( )
{ 

cin>>point[0].x>>point[0].y>>circle.r;
cin>>point[1].x>>point[1].y;
circle.c = point[0];
double dist = 0;
dist = sqrt(pow(point[1].x - circle.c.x,2.0)+pow(point[1].y-circle.c.y,2.0));
if(dist - circle.r<=0) cout<<0<<endl;
else{ 

res = dist-circle.r;
cout<<fixed<<setprecision(2)<<res<<endl;
}
return 0;
}

#include<bits/stdc++.h>
using namespace std;
struct POINT{ 
 //点
int x,y; //坐标值×和y
};
struct LINE{ 
 //线
POINT s,e; //线的两端
};
struct RECT{ 
 //矩形
POINT lt,rb; //矩形的左上角和右下角
};
double pointToPoint(POINT a,POINT b){ 

double d =sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)); return d;
return d;
}
double pointToLine(POINT p,LINE l){ 

double s=fabs(l.s.x*(l.e.y-p.y)+l.e.x*(p.y-l.s.y)+p.x*(l.s.y-l.e.y))/2;
double d=pointToPoint(l.s,l.e);
double h=s*2/d;
return h;
}
int main()
{ 

POINT plt,plb,prt,prb,point;
LINE lineLeft,lineRight,lineTop,lineBottom;
RECT rect;
scanf("%d %d",&plt.x,&plt.y);
scanf("%d %d",&prb.x,&prb.y);
scanf("%d %d",&point.x,&point.y);
plb.x=plt.x,plb.y=prb.y;
prt.x=prb.x,prt.y=plt.y;
lineLeft.e=plb,lineLeft.s=plt;
lineRight.e=prb,lineRight.s=prt;
lineBottom.e=plb,lineBottom.s=prb;
lineTop.e=plt,lineTop.s=prt;
rect.lt=plt,rect.rb=prb;
if(plt.x<=point.x&point.x<=prt.x&plb.y<=point.y&&point.y<=plt.y)
printf("0");
else{ 

//矩形×范围内上方或下方
if(plt.x<=point.x&point.x<=prt.x){ 

double d1=pointToLine(point,lineTop);double d2=pointToLine(point,lineBottom);printf("%lf",min(d1,d2));
return 0;
}
//矩形y范围内左侧或右侧
if(plb.y<=point.y&&point.y<=plt.y){ 

double d1=pointToLine(point,lineLeft);
double d2=pointToLine(point,lineRight);
printf("%lf",min(d1,d2));
return 0;
}
//其他情况，取最近的顶点距离作为距离
double d1=pointToPoint(point,plt);
double d2=pointToPoint(point,plb);
double d3=pointToPoint(point,prt);
double d4=pointToPoint(point,prb);
printf("%lf",min(min(d1,d2),min(d3,d4)));
return 0;
}
}

#include<bits/stdc++.h>
using namespace std;
struct POINT{ 

int x,y;
};
struct LINE{ 

POINT s,e;
};
struct RECT{ 

POINT lt,rb;
};
bool intersect(LINE AB,LINE CD){ 
//判断线段CD是否与直线AB相交
//直线AB的直线方程为：
// f(x,y)=(y-A.y)*(A.x-B.x)-(x-A.x)*(A.y-B.y)=0
POINT A=AB.e,B=AB.s;
POINT C=CD.e,D=CD.s;
int fc=(C.y-A.y)*(A.x-B.x)-(C.x-A.x)*(A.y-B.y);
int fd=(D.y-A.y)*(A.x-B.x)-(D.x-A.x)*(A.y-B.y);
if(fc*fd<=0) return true;
else return false;
}
//判断两线段是否相交
bool interSegment(LINE AB,LINE CD){ 

if(intersect(AB, CD) && intersect(CD, AB)) return true;
else return false;
}
bool inRect(POINT point,RECT rect){ 

if(point.x<=rect.rb.x&point.x>=rect.lt.x&&point.y<=rect.lt.y&&point.x>=rect.rb.y)return true;
else return false;
}
int main (){ 

int x1,y1,x2,y2,x3,y3,x4,y4; cin >>x1>>y1>>x2>>y2;
cin >>x3>>y3>>x4>>y4;
POINT LT { 
x1,y1}, LB { 
x1,y2}, RT { 
x2,y1}, RB { 
x2,y2}, lineA { 
x3,y3},lineB{ 
x4,y4};
RECT rect { 
 LT , RB };
LINE diag1{ 
 LT , RB },diag2{ 
 LB , RT }, lineAB { 
 lineA , lineB };
bool flag = false ;
if ( inRect ( lineA , rect )|| inRect(lineB, rect ))
flag = true ;
if ( interSegment ( lineAB ,diag1) || interSegment ( lineAB ,diag2))
flag = true ;
if ( flag )  cout <<"YES ";
else  cout <<"NO";
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
struct POINT{ 

int x,y;
};
struct LINE{ 

POINT s,e;
};
bool parallel (LINE AB,LINE CD){ 

POINT A =AB.e,B = AB.s;
POINT C =CD.e,D = CD.s;
if(A.x==B.x||C.x==D.x||A.y==B.y||C.y==D.y)
if(A.x==B.x&&C.x==D.x||A.y==B.y&&C.y==D.y)
return true;
if((B.y-A.y) * (D.x - C.x )==(D.y-C.y)*(B.x-A.x))
return true;
return false;
}
int main( ){ 

POINT A,B,C,D;
cin>>A.x>>A.y>>B.x>>B.y>>C.x>>C.y>>D.x>>D.y; 
bool flag =false;
if(parallel(LINE{ 
A,B},LINE{ 
C,D}))
flag =true;
if(parallel(LINE{ 
A,C},LINE{ 
C,D}))
flag =false;
if(flag)
cout <<"YES";
else cout <<"NO";
return 0;
}

#include <bits/stdc++.h>
using namespace std;
struct POINT { 

int x, y;
};
struct LINE { 

POINT s, e;
};
struct EQUATION{ 
//直线斜截式方程:y=ax+b
LINE line;
double a;
double b;
bool vertical;//是否垂直，即斜率不存在
};
EQUATION get_equa(LINE line){ 

EQUATION equation;
equation.line = line;
if (line.e.x == line.s.x)
equation.vertical = true;
else { 

equation.a =(line.s.y - line.e.y)* 1.0 / (line.s.x - line.e.x);
equation.b = line.s.y - equation.a* line.s.x;
equation.vertical = false;
}
return equation;
}
//判断线的交点是不是在线段两个端点区域内
bool judge_point(LINE l1,LINE l2,double x, double y){ 

if((x-l1.s.x)* (x-l1.e.x)<= 0 && (y-l1.s.y) *(y-l1.e.y)<= 0
&&(x-l2.s.x)* (x-l2.e.x) <= 0 &&(y-l2.s.y) *(y-l2.e.y)<= 0)
return true;
else
return false;
}
//计算交点:存在一个斜率不存在的时候
void vertTrue(EQUATION vert,EQUATION normal){ 

double x = vert.line.e.x;
double y = normal.a*x +normal.b;
if (judge_point(vert.line,normal.line,x,y))
printf( "%.2lf %.2lf\n",x,y);
else
printf("-1\n");
}
//斜率都存在的时候
void vertFalse(EQUATION normal1,EQUATION normal2){ 

double diff_a = normal1.a - normal2.a;
if(diff_a ==0)
printf("-1\n");else { 

double x =-(normal1.b - normal2.b)/(normal1.a - normal2.a);double y = normal1.a*x +normal1.b;
if(judge_point(normal1.line,normal2.line,x,y))
printf("%.2lf %.2lf\n", x,y);
else
printf("-1\n");
}
}
int main(){ 

LINE l1,l2;
scanf("%d%d%d%d",&l1.s.x,&l1.s.y,&l1.e.x,&l1.e.y);
scanf("%d%d%d%d",&l2.s.x,&l2.s.y,&l2.e.x,&l2.e.y);
EQUATION line1 = get_equa(l1);
EQUATION line2 = get_equa(l2);
if (line1.vertical && !line2. vertical)
vertTrue(line1,line2);
else if(!line1.vertical && line2.vertical)
vertTrue(line2,line1);
else if(line1.vertical && line2.vertical)
printf("-1\n");
else
vertFalse(line1,line2);
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
typedef long long ll ;
#define MAX_NUM 10010
#define PI 3.1415926
double res;
int ans, n, m, k,len,cnt = 0,minn = MAX_NUM, maxx = 0;
char ch, s1[MAX_NUM] = "", s2[MAX_NUM] = "";
bool flag = false;
int a[MAX_NUM]= { 
0},b[MAX_NUM]= { 
0};
double x,s,t;
struct Student{ 

string name;
int grade;
}student[ MAX_NUM];
bool cmp(Student s1,Student s2) { 
 //cmp true不用交换位置false需要交换位置
if( s1.grade != s2.grade) { 

if(s1.grade > s2.grade)
return true;
else
return false;
}else { 

if(s1.name > s2.name)
return true;
else
return false;
}
}
int main( ) { 

scanf( "%d\n",&n);
for(int i = 0; i < n; i++) { 

cin >> student[i].name >> student[i].grade;
}
sort(student, student+n,cmp);for( int i = 0; i < n; i++) { 

cout << student[i].name << endl;
}
return 0;
}

#include<bits/stdc++.h> 
using namespace std;
typedef long long ll ;
#define MAX_NUM 10010
#define PI 3.1415926
double res;
int ans, n, m, k,len,cnt = 0,minn = MAX_NUM, maxx = 0;
char ch, s1[MAX_NUM] = "", s2[MAX_NUM] = "";
bool flag = false;
int a[MAX_NUM]= { 
0},b[MAX_NUM]= { 
0};
double x,s,t;
struct Student{ 

string name;
int grade;
int X,S,T;
double zongfen;
}student[ MAX_NUM];
bool cmp(Student s1,Student s2) { 
 //cmp true不用交换位置false需要交换位置
if( s1.zongfen != s2.zongfen) { 

if(s1.zongfen > s2.zongfen)
return true;
else
return false;
}else { 

if(s1.name > s2.name)
return true;
else
return false;
}
}
int main( ) { 

scanf( "%d\n",&n);
scanf("%lf %lf %lf\n", &x,&s,&t);for(int i = 0; i < n; i++) { 

cin >> student[i ].name >> student[i].X >> student[i].S >>
student[i].T;
student[i].zongfen = x*student[i].X + s*student[i].S +t*student[i].T;
}
sort(student, student+n,cmp);for( int i = 0; i < n; i++) { 

cout << student[i ].name << endl;
}
return 0;
}