摘要: #include <iostream> using namespace std; int main() { int n,a=0,b=0,x1,x2,y1,y2; cin>>n; for(int i=0;i<n;i++) { cin>>x1>>x2>>y1>>y2; if(x2!=y2) { if(x 阅读全文
posted @ 2020-02-03 11:59 QRain 阅读(92) 评论(0) 推荐(0)
摘要: #include <string.h> #include <iostream> using namespace std; int main() { char str[10005]; int c_p=0,c_a=0,c_T=0,c_e=0,c_s=0,c_t=0; cin>>str; for(int 阅读全文
posted @ 2020-02-02 16:32 QRain 阅读(134) 评论(0) 推荐(0)
摘要: #include <string.h> #include <iostream> using namespace std; int main() { char str[1005]; int big[27]={0}; int max=0; char max_s; fgets(str,1005,stdin 阅读全文
posted @ 2020-02-02 16:10 QRain 阅读(104) 评论(0) 推荐(0)
摘要: #include <string.h> #include <iostream> using namespace std; struct STU { char stu_no[18]; int test_seat; int seat; }; int main() { int n,m; struct ST 阅读全文
posted @ 2020-02-02 16:00 QRain 阅读(178) 评论(0) 推荐(0)
摘要: #include <string.h> #include <iostream> using namespace std; int main() { long int num=1000000007,count=0,count_p=0,count_t=0; char * str=new char[100 阅读全文
posted @ 2020-02-02 15:51 QRain 阅读(119) 评论(0) 推荐(0)
摘要: #include <string.h> #include <iostream> using namespace std; int main() { char sell[1005],want[1005]; int s[1005]={0}; int j,n=0; cin>>sell>>want; for 阅读全文
posted @ 2020-02-02 12:59 QRain 阅读(120) 评论(0) 推荐(0)
摘要: #include <iostream> using namespace std; int main() { int n,k,g; int grade[101]={0}; cin>>n; int *k_grade=new int[100005];//稍微大一点 for(int i=0;i<n;i++) 阅读全文
posted @ 2020-02-02 12:47 QRain 阅读(138) 评论(0) 推荐(0)
摘要: #include <stdio.h> int main() { int g1,s1,k1,g2,s2,k2,g,s,k,g3,g4,s3,s4,k3,k4; scanf("%d.%d.%d %d.%d.%d",&g1,&s1,&k1,&g2,&s2,&k2); g3=g1;g4=g2;s3=s1;s 阅读全文
posted @ 2020-02-02 12:29 QRain 阅读(110) 评论(0) 推荐(0)
摘要: #include <iostream> using namespace std; int main() { int n,t; char c; cin>>n>>c; for(int i=0;i<n;i++) cout<<c; t=n/2+n%2;//计算行数 for(int i=0;i<t-2;i++ 阅读全文
posted @ 2020-02-02 11:21 QRain 阅读(93) 评论(0) 推荐(0)
摘要: #include <string.h> #include <iostream> using namespace std; int main() { char damage[70]; char *word=new char[100005];//不超过10^5 //char word[10005];一开 阅读全文
posted @ 2020-02-02 09:06 QRain 阅读(162) 评论(0) 推荐(0)