SYITwin的博客

Description:Peppa has been learning math recently, he is trapped by a easy problem. He is given a sequence of n numbers, what he need to do is finding the number ai which have the largest number f(ai)...

A Live Love上取整，下取整函数：ceil() 向上取整，floor()向下取整。#include<iostream>#include<cstdio>#include<cmath>using namespace std;int main(){ int t,n,m; scanf("%d",&t); whil...

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]...

Problem F. The Chosen OneWelcome to the 2017 ACM-ICPC Asia Nanning Regional Contest.Here is a breaking news. Now you have a chance to meet alone with the Asia Director through a game.All boys and g...

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...

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...

1.来源：https://blog.youkuaiyun.com/qq_38749759/article/details/800425272.算数检测法介绍：https://blog.youkuaiyun.com/zengaming/article/details/518672403.米勒 罗宾算法原理介绍：https://blog.youkuaiyun.com/fisher_jiang/article/details/98...

Input:Input consists of several test cases. Each test case begins with an integer n. Then it's followed by n integers a[i]. 0<n<=10000000<=a[i]<=10000There are 100 ...

Description:There is a positive integer X, X's reversion count is Y. For example, X=123, Y=321; X=1234, Y=4321. Z=(X-Y)/9, Judge if Z is made up of only one number(0,1,2...9), ...

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...