SSanYue的博客

InputThe input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represent

题目扯了半天，就一个大写字母加一输出问题，如果是Z就输出A。输入：2HALSWERC输出：String #1IBMString #2TXFSD代码：#include#includeusing namespace std;int main(){ int N,i=1; cin>>N; ch

A Quicksum is the sum of the products of each character's position in the packet times the character's value. A space has a value of zero, while letters have a value equal to their position in the alp

判断给的三个数能不能构成直角三角形。输入：236 77 8540 55 69输出：Scenario #1:yesScenario #2:no代码：#includeusing namespace std;int main(){ int N; int i=1; cin>>N; wh

上一层6s下一层4s每层停5s初始0层输入：1 23 2 3 10输出：1741代码：#includeusing namespace std;int main(){ int N,sum,a,b; while(cin>>N,N){ sum=0;

字符串回文输入：3asdfg ！fgqaztgb~ /aa输出：gf! gfdsazaqaa/ ~bgt#include#includeusing namespace std;int main(){ int N,i; char c[100]; char ch; ci

求平均数代码：#includeusing namespace std;int main(){ int n=12; float m,sum=0; while(n--){ cin>>m; sum+=m; } cout<<"$"<<sum/1

输出输入的数组中1的个数。输入：22 21 10 03 31 0 10 0 11 1 0输出：25代码：#includeusing namespace std;int main(){ int N,c; int n,m; cin>>N; while(N--){

排序Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5914Accepted Submission(s): 1704 Problem Description输入一行数字，如果我们把这行数

Tian Ji -- The Horse RacingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6240Accepted Submission(s): 1518 Problem Des

字符与ascii码转换输入：1372 101 108 108 111 4432 119 111 114 108 100 33输出：Hello, world!代码：#include#includeusing namespace std;int main(){ int N,s[1001]; cin