摘要:
#include#includeusing namespace std;const int AIM=6174;int n;int arr[4];bool NonIncreasingOrder(int a,int b){ return a>b;}bool NonDecreasingOrder(int... 阅读全文
摘要:
#include#includeusing namespace std;const int AIM=6174;int n;int arr[4];bool NonIncreasingOrder(int a,int b){ return a>b;}bool NonDecreasingOrder(int... 阅读全文
摘要:
#includeint main(){ int n,ans=0,now=0; //要停n层,ans是总时间,now代表当前层数 scanf("%d",&n); for(int i=0 ; inow) //上楼,每上一层6秒 { ans+=(tmp... 阅读全文
摘要:
#include#include#includeusing namespace std;struct node{ int address; int data; int next; bool tag;}Node[100066];bool cmp(node a,node b){ re... 阅读全文
摘要:
#include#include#includestruct node{ char data; int next; bool tag;}Node[100066];int main(){ int add1,add2,n; //连表1首地址, scanf("%d%d%d",&... 阅读全文
摘要:
#include#include#include#includeusing namespace std;const int MAX=100010; //int型素数一定在这个范围内int PrimeArr[MAX]; //素数表int cnt=0; //... 阅读全文