#include<iostream> #include<cstdio> #include<algorithm> using namespace std; bool Descend(int a,int b){     return a>b; } int main(){     int array[10];     while(scanf("%d",&...

#include<iostream> #include<cstdio> #include<algorithm> using namespace std; int main(){     int n;     int array[1000];     while(scanf("%d\n",&n)!=EOF){       &n...

#include<iostream> #include<cstdio> #include<algorithm> #include<string> using namespace std; struct Student{     string name;     int score;     int order; }; bool Compare1(Student...

#include<iostream> #include<cstdio> #include<algorithm> using namespace std; struct Student{     int number;     int score; }; bool Compare(Student a,Student b){     if(a.score==b.sc...

#include<iostream> #include<cstdio> #include<algorithm> using namespace std; int array[100]; int main() {     int n;     while(scanf("%d\n",&n)!=EOF){         for(int&n...

1.蚂蚁之间不能互相穿过，因此各个蚂蚁的相对位置不变。   2.各个蚂蚁除了速度和位置，其余是无差别的，因此两个蚂蚁相撞可以等效为这两个蚂蚁互相穿过，并交换无差别的“躯壳”。   3.可以假设各个蚂蚁相互独立，不会相撞，可以分别得出每个蚂蚁坠落的时间和方向。   4.每当有一个蚂蚁从左边坠落，相当于A蚂蚁左边少了一只蚂蚁。（右边同理）   5.当某一边的蚂蚁已经为0无法减少后，A蚂蚁就会代替本该坠落的蚂蚁而坠落。   #include<iostream> #include<cstdio> using namespace std; int m...

#include<iostream> #include<cstdio> #include<cmath> using namespace std; int get_max(int a,int b,int c){     int max=0;     max=(a>b?a:b);     max=(max>c?max:c);    &...

#include<iostream> #include<cstdio> #include<string> using namespace std; int CountTab[32]={1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,0,1,2,3,4,1,2,3,0,1,2,3,4}; char LetterTab[32]={'a','b','c',' ','d','e','f',' ','g','h','i',' ','j','k','l',  &n...

#include<iostream> #include<cstdio> #include<string> using namespace std; int DayTab[2][13] = { {0,31,28,31,30,31,30,31,31,30,31,30,31}, {0,31,29,31,30,31,30,31,31,30,31,30,31}, }; bool IsLeapYear(int year) { return (year % 4&n...

#include<iostream> #include<cstdio> using namespace std; int DayTab[2][13] = {     {0,31,28,31,30,31,30,31,31,30,31,30,31},     {0,31,29,31,30,31,30,31,31,30,31,30,31}, }; bool IsLeapYear(int year) {     return (year % 4 == 0 && year % 100 != 0) || (...

#include<iostream> #include<cstdio> using namespace std; int DayTab[2][13] = {     {0,31,28,31,30,31,30,31,31,30,31,30,31},     {0,31,29,31,30,31,30,31,31,30,31,30,31} }; bool IsLeapYear(int year) {     return (year % 4 == 0 && year % 10 != 0) || (ye...

#include<iostream> #include<cstdio>  using namespace std; int main() {     char str[81];     while (scanf("%s", &str) != EOF) {         char matrix[80][80];        &nbsp...