(^-^) --------比赛 -----(^-^)
SY_Pistachio
低调的前行,越努力越幸运!
展开
-
Problem E. Balanced Game (The 2016 ACM-ICPC Asia Qingdao Regional Contest, Online)
Problem E. Balanced GameTime limit: 1sColor of balloons: 32768KRock-paper-scissors is a zero-sum hand game usually played between two people, in which each player simultane-ously forms one of thre...原创 2018-08-14 16:16:55 · 265 阅读 · 0 评论 -
CCCC天梯赛习题练习
天梯赛练习网址原创 2018-11-09 20:36:53 · 1006 阅读 · 0 评论 -
山东省第八届ACM题(部分赛题整理)
3893 - Return of the Nim 118 / 221 53.39% “浪潮杯”山东省第八届ACM大学生程序设计竞赛(感谢青岛科技大学) 3894 - Quadrat 34 / 73 46.58% “浪潮杯”山东省第八届ACM大学生程序设计竞赛(感谢青岛科技大学) 3895 - fireworks 195 / 63...原创 2018-10-23 16:31:48 · 415 阅读 · 0 评论 -
ACM-ICPC 2017 Asia Qingdao (现场赛)
ACM-ICPC 2017 Asia Qingdao 常见问题题目列表 排名:- 问答 A. Battle in Two Pairs of Heroes 题库链接 通过率: 33.33 % 通过人数: 1 B. Chenchen, Tangtang and ZengZeng 题库链接 通过率: 97.3 % 通过人数: 36 C. Coll...原创 2018-10-25 18:12:30 · 622 阅读 · 0 评论 -
2017青岛区域赛 (部分题解)
vjudge上 题目链接:VJH Chinese Zodiac//垃圾#include<bits/stdc++.h>using namespace std;int judge(char s[]){ if(strcmp(s,"rat")==0) return 1; else if(strcmp(s,"ox")==0) return 2; else ...原创 2018-10-15 21:09:34 · 801 阅读 · 0 评论 -
Tr A 矩阵快速幂 (HDU 1575)
题目链接 Tr A Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7362 Accepted Submission(s): 5404 Problem Description A为一个方...原创 2018-09-29 16:07:59 · 197 阅读 · 0 评论 -
2016ACM/ICPC亚洲区沈阳站(区域赛练习)(C 矩阵快速幂)
A - Thickest Burger #include<bits/stdc++.h>using namespace std;int main(){ int t; cin>>t; while(t--) { int a,b; cin>>a>>b; cout<<2*max(a,b)+min(a,b)<&l...原创 2018-09-28 21:33:48 · 455 阅读 · 0 评论 -
51Nod 1284 2 3 5 7的倍数 (容斥定理,容斥取反)
点击转到1284 2 3 5 7的倍数 基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 收藏 关注给出一个数N,求1至N中,有多少个数不是2 3 5 7的倍数。 例如N = 10,只有1不是2 3 5 7的倍数。Input输入1个数N(1 <= N <= 10^18)。Output输出不是2 3 5 7的倍数的数...原创 2018-10-13 16:31:54 · 220 阅读 · 0 评论 -
“浪潮杯”第九届山东省ACM大学生程序设计竞赛重现赛 题解
点击转到(牛客网)A. Anagram1.思路: 给定两个字符串,假设是ELLY与KRIS,E到K是6,L到R是6,当第二个L到I时,L是比I大的,此时L就要绕到Z,从Z到A,再从A开始到I,这样长度就是23,Y到S同理,长度是20;这样找完之后序列长度之和就是6 +6+23+20=55.这是题目中给出的一种解答。但是题目要求我们找字符间最小的长度,我就把第一个字符串中的每一...原创 2018-10-13 11:31:27 · 838 阅读 · 0 评论 -
The 2018 ACM-ICPC Asia Qingdao Regional Contest, Online
A Live Love上取整,下取整函数:ceil() 向上取整,floor()向下取整。#include<iostream>#include<cstdio>#include<cmath>using namespace std;int main(){ int t,n,m; scanf("%d",&t); whil...原创 2018-09-23 10:34:03 · 206 阅读 · 0 评论 -
Codeforces Round #511 (Div. 2) (CF 2018.9.21)
A. Little C Loves 3 I#include<iostream>int main(){ int n; scanf("%d",&n); //if(n==3) // printf("1 1 1\n"); //else //{ int num=n/3; if(n%3==0) { if(num%3!=0) printf(...原创 2018-09-22 19:16:09 · 239 阅读 · 0 评论 -
ACM-ICPC 2018 焦作赛区网络预赛
A Magic Mirror最开始提交的时候,忘记判断strlen(s)>6的情况,考虑不周到,以后一定考虑全面再提交。#include<bits/stdc++.h>using namespace std;int main(){ int t; scanf("%d",&t); while(t--){ char s[20]...原创 2018-09-23 11:48:55 · 245 阅读 · 0 评论 -
“浪潮杯”第九届山东省ACM大学生程序设计竞赛重现赛 G game (尼姆博弈)
链接:https://www.nowcoder.com/acm/contest/123/G来源:牛客网 题目描述Alice and Bob are playing a stone game. There are n piles of stones. In each turn, a player can remove some stones from a pile (the number...原创 2018-09-07 17:07:19 · 366 阅读 · 0 评论 -
Problem B. Cure(The 2016 ACM-ICPC Asia Qingdao Regional Contest, Online)
Problem B. CureTime limit: 1sColor of balloons: 32768KGiven an integer n, we only want to know the sum of 1/k2 where k from 1 to n.InputThere are multiple cases. For each test case, there is a si...原创 2018-08-14 19:04:15 · 344 阅读 · 0 评论 -
Problem A. I Count Two Three(The 2016 ACM-ICPC Asia Qingdao Regional Contest, Online)
Problem A. I Count Two Three(点击转到)Time limit: 1sColor of balloons: 32768KI will show you the most popular board game in the Shanghai Ingress Resistance Team. It all started severalmonths ago. We f...原创 2018-08-14 18:52:57 · 266 阅读 · 0 评论 -
2018天梯赛(关于字符串的问题)
PINTIA1.关于字符或字符串,前面有数值的一定用getchar()读走。2.string类型的可以用getline()读一行 string s[111]; cin>>c>>n; getchar(); for(int i=0;i<n;i++) { getline(cin,s[i]); }3.带...原创 2019-03-22 16:53:24 · 338 阅读 · 0 评论