- 博客(56)
- 收藏
- 关注
原创 杭电OJ 2055(C++)
An easy problem#include<iostream>using namespace std;#include<string>int main(){ int n,i,y,k; char x; cin>>n; for(i = 0 ; i < n ; i++) { cin>>x>>y; if(x >= 'A' && x <= 'Z') k = x - 64; if(
2021-07-20 08:55:57 232
原创 杭电OJ 2054(C++)
A == B ?#include<iostream>using namespace std;#include<string>int main(){ string a,b; while(cin>>a>>b) { int i,k = 0; int sum = a.size(); if(a.size() < b.size()) sum = b.size(); for(i = 0 ; i < sum ; i++)
2021-07-20 08:55:35 154
原创 杭电OJ 2042(C++)
不容易系列之二#include<iostream>using namespace std;int main(){ int n,i,j,m; cin>>n; for(i = 0 ; i < n ; i++) { cin>>m; int sum = 3; for(j = 0 ; j < m ; j++) sum = (sum - 1) * 2; cout<<sum<<endl; } return
2021-07-20 08:55:02 150
原创 杭电OJ 2040(C++)
亲和数#include<iostream>using namespace std;int ysh(int a){ int i,sum = 0; for(i = 1 ; i < a ; i++) { if(a%i == 0) sum += i; } return sum;}int main(){ int n,a,b,i; cin>>n; for(i = 0 ; i < n ; i++) { cin>>a>
2021-07-20 08:54:35 79
原创 杭电OJ 2032(C++)
杨辉三角#include<iostream>using namespace std;int main(){ int n,j,i; while(cin>>n) { int **a = new int *[n]; for(i = 0 ; i < n ; i++) a[i] = new int[i+1]; for(j = 0 ; j < n ; j++) { a[j][0] = 1; a[j][j] = 1; for(i
2021-07-18 11:39:23 118
原创 杭电OJ 2030(C++)
汉字统计#include<iostream>using namespace std;#include<string>int main(){ int n,j,i; string a; cin>>n; getline(cin,a); for(j = 0 ; j < n ; j++) { int k = 0; getline(cin,a); for(i = 0 ; i < a.size() ; i++) { if(a[i
2021-07-18 11:39:05 152
原创 杭电OJ 2029(C++)
Palindromes _easy version#include<iostream>using namespace std;#include<string>int main(){ int n,j,i; string a; cin>>n; for(j = 0 ; j < n ; j++) { int k = 0; cin>>a; for(i = 0 ; i < a.size()/2 ; i++) { if
2021-07-18 11:38:46 134
原创 杭电OJ 2028(C++)
Lowest Common Multiple Plus#include<iostream>using namespace std;long long gys(long long a,long long b){ long long r; while(r != 0) { r = a%b; a = b ; b = r ; } return a;}long long gbs(long long a,long long b){ return a * b / g
2021-07-18 11:38:34 202
原创 杭电OJ 2027(C++)
统计元音#include<iostream>using namespace std;#include<string>int main(){ int n,i,j; string a; cin>>n; int A=0,E=0,I=0,O=0,U=0; getline(cin,a); for(i = 0 ; i < n ; i++) { getline(cin,a); for(j = 0 ; j < a.size() ; j++)
2021-07-18 11:38:06 93
原创 杭电OJ 2026(C++)
首字母变大写#include<iostream>using namespace std;#include<string>int main(){ int i; string a; while(getline(cin,a)) { if(a[0] != ' ') a[0] = a[0] - 32; for(i = 0 ; i < a.size() ; i++) { if(a[i] == ' ') { a[i+1] = a[i+
2021-07-18 11:37:53 111
原创 杭电OJ 2025(C++)
查找最大元素#include<iostream>using namespace std;#include<string>int main(){ int i; string a; while(cin>>a) { char max = a[0]; for(i = 1 ; i < a.size() ; i++) if(max < a[i]) max = a[i]; for(i = 0 ; i < a.size()
2021-07-18 11:37:38 179
原创 杭电OJ 2024(C++)
C语言合法标识符#include<iostream>using namespace std;#include<string>int main(){ int i,j,n,k=0; string a; while(cin>>n) { getline(cin,a); for(i = 0 ; i < n ; i++) { getline(cin,a); if(a[0] >= '0' && a[0]<=
2021-07-18 11:37:13 176
原创 杭电OJ 2023(C++)
求平均成绩#include<iostream>using namespace std;#include<iomanip>int main(){ int j,i,m,n,k = 0,p = 0; double sum = 0; cout<<setiosflags(ios::fixed); cout.precision(2); while(cin>>m>>n) { double **a = new double *[m];
2021-07-18 11:36:56 263
原创 杭电OJ 2022(C++)
海选女主角#include<iostream>using namespace std;#include<cmath>int main(){ int m,n,i,j; while(cin>>m>>n&&m!=EOF) { int max,x = 1,y = 1; int **a = new int*[m]; for(i = 0 ; i < m ; i++) { a[i] = new int[n];
2021-07-18 11:36:37 147
原创 杭电OJ 2021(C++)
发工资咯:)#include<iostream>using namespace std;#include<cmath>int main(){ int n,i,sum = 0; while(cin>>n) { if(n == 0) break; int *a = new int[n]; for(i = 0 ; i < n ; i++) cin>>a[i]; for(i = 0 ; i < n ; i++)
2021-07-17 08:42:57 238 1
原创 杭电OJ 2020(C++)
绝对值排序#include<iostream>using namespace std;#include<cmath>int main(){ int i,j,temp,n; while(cin>>n) { if(n == 0) break; int *a = new int[n]; for(i = 0 ; i < n ; i++) cin>>a[i]; for(j = 0 ; j < n ; j++)
2021-07-17 08:42:41 175
原创 杭电OJ 2019(C++)
数列有序!#include<iostream>using namespace std;int main(){ int i,j,temp,n,x; while(cin>>n>>x) { if(n == 0 && x == 0) break; int *a = new int[n+1]; for(i = 0 ; i < n ; i++) cin>>a[i]; a[n] = x; for(j =
2021-07-17 08:42:23 143
原创 杭电OJ 2018(C++)
母牛的故事#include<iostream>using namespace std;int main(){ int i,n,m,sum = 1; while(cin>>n) { if(n == 0) break; int *a = new int[n]; for(i = 0 ; i < n && i < 3 ; i++) a[i] = 1; if( i >= 3) for(i = 3 ; i <
2021-07-17 08:41:43 121
原创 杭电OJ 2017(C++)
字符串统计#include<iostream>using namespace std;#include<string>int main(){ int i,n,j,sum = 0; string s; cin>>n; for(i = 0 ; i < n ; i++) { cin>>s; for(j = 0 ; j < s.size() ; j++) { if( s[j] >= '0' &&
2021-07-17 08:41:24 152
原创 杭电OJ 2016(C++)
数据的交换输出#include<iostream>using namespace std;int main(){ int i,n,min,x,temp; while(cin>>n) { if(n == 0) break; int *a = new int[n]; for(i = 0 ; i < n ; i++) cin>>a[i]; min = a[0]; x = 0; for(i = 1 ; i < n ;
2021-07-17 08:41:08 106
原创 杭电OJ 2015(C++)
偶数求和#include<iostream>using namespace std;int main(){ int n,m,i,b=0,sum = 0; while(cin>>n>>m) { int *a = new int[n]; a[0] = 2; for(i = 1 ; i < n ; i++) { a[i] = a[i-1] + 2;
2021-07-17 08:40:29 541
原创 杭电OJ 2014(C++)
青年歌手大奖赛_评委会打分#include<iostream>using namespace std;#include<iomanip>int main(){ int i,n,j; double sum = 0,temp; cout<<setiosflags(ios::fixed); cout.precision(2); while(cin>>n) { double *a = new double[n]; for(i = 0 ;
2021-07-17 08:38:57 70
原创 杭电OJ 2013(C++)
蟠桃记#include<iostream>using namespace std;int main(){ int n,i,sum = 1; while(cin>>n) { for(i = 1 ; i < n ; i++) { sum = ( sum + 1 ) * 2; } cout << sum <<endl; sum = 1; }}
2021-07-17 08:38:40 94
原创 杭电OJ 2012(C++)
素数判定#include<iostream>using namespace std;int gcd(int a, int b){ int r; while(r != 0) { r = a % b; a = b; b = r; } return a;}int zs(int a){ int i; for(i = 2 ; i < a ; i++) { if(gcd(a,i) != 1) break; } if(i == a) ret
2021-07-17 08:38:20 109
原创 杭电OJ 2629(C++)
Identity Card#include<iostream>using namespace std;#include<string>int main(){ string a,b; int i,n,day,month,year; cin>>n; for(i = 0 ; i < n ; i++) { cin>>a; if(a[0] == '3' && a[1] == '3') b = "Zhejiang"
2021-07-16 08:35:54 113
原创 杭电OJ 1197(C++)
Specialized Four-Digit Numbers#include<iostream>using namespace std;#include<cmath>int main(){ int i,a,b,c,d,sum1,sum2,sum3; for(i = 1000 ; i < 10000 ; i++) { a = i / 1000; b = i / 100 % 10; c = i / 10 % 10; d = i % 10; su
2021-07-15 08:41:23 98
原创 杭电OJ 1170(C++)
Balloon Comes!#include<iostream>using namespace std;#include<iomanip>int main(){ int i,n,a,b; char c; cin>>n; cout<<setiosflags(ios::fixed); cout.precision(2); for(i = 0 ; i < n ; i++) { cin>>c>>a>&g
2021-07-15 08:41:02 107
原创 杭电OJ 2734(C++)
Quicksum#include<iostream>using namespace std;#include<string>int main(){ string a; int sum = 0,i; while(getline(cin,a)) { if(a == "#") break; for( i = 0 ; i < a.size() ; i++) { if( a[i] >= 'A' && a[i] <=
2021-07-15 08:40:36 90
原创 杭电OJ 1064(C++)
财务管理#include<iostream>using namespace std;#include<iomanip>int main(){ int i; double x,sum = 0; for(i = 0 ; i < 12 ; i++) { cin>>x; sum += x; } sum = sum / 12; cout<<setiosflags(ios::fixed); cout.precision(2);
2021-07-15 08:39:56 93
原创 杭电OJ 2104(C++)
hide handkerchief#include<iostream>using namespace std;int gcd(int a, int b){ int r; while(r != 0) { r = a % b; a = b; b = r; } return a;}int main(){ int m,n; while(cin>>n>>m) { if(n == -1 && m == -1)
2021-07-15 08:39:17 106
原创 杭电OJ 1062(C++)
Text Reverse#include<iostream>using namespace std;#include<string>int main(){ string a; char temp; int j,i,x = 0 , y = 0 ; int n,k; cin>>n; a="\n"; getline(cin,a); for(k = 0 ; k < n ; k++) { getline(cin,a); for(j =
2021-07-15 08:38:39 183
原创 杭电OJ 1720(C++)
A+B Coming#include<iostream>using namespace std;#include<cmath>#include<string>int ZH(string a){ int i,sum = 0; int *x = new int[a.size()]; for(i = 0 ; i < a.size() ; i++) { if(a[i] >= '0' && a[i] <=
2021-07-15 08:38:11 154
原创 杭电OJ 2039(C++)
三角形#include<iostream>using namespace std;int main(){ int x,i,j,n; double a[3],temp; cin>>n; for(x = 0 ; x < n ; x++) { cin>>a[0]>>a[1]>>a[2]; for(j = 0 ; j < 2 ; j++) for(i = 0 ; i < 2 ; i++) if
2021-07-15 08:37:20 61
原创 杭电OJ 2011(C++)
多项式求和#include<iostream>#include<cmath>#include<iomanip>using namespace std;int main(){ int i,m,n,a; double j,sum = 0; cout<<setiosflags(ios::fixed); cout.precision(2); while(cin>>m) { int *n = new int[m]; fo
2021-07-15 08:36:51 119
原创 杭电OJ 2010(C++)
水仙花数#include<iostream>#include<cmath>#include<iomanip>using namespace std;int main(){ int n,m,a,b,c,i,j=0; while(cin>>n>>m) { if(n>m) break; for( i = n ; i <= m ; i++) { a = i / 100; b = i / 10 %
2021-07-15 08:36:26 93
原创 杭电OJ 2009(C++)
求数列的和#include<iostream>#include<cmath>#include<iomanip>using namespace std;int main(){ int i,m; double n,sum; cout<<setiosflags(ios::fixed); cout.precision(2); while(cin>>n>>m) { sum = n; for(i = 0 ; i &
2021-07-14 08:25:06 104
原创 杭电OJ 2008(C++)
数值统计#include<iostream>using namespace std;int main(){ int i; double n,x=0,y=0,z=0; while(cin>>n) { if( n == 0 ) break; double *a = new double[n]; for(i = 0 ; i < n ; i++) { cin>>a[i]; if(a[i] < 0) x++;
2021-07-14 08:24:47 109
原创 杭电OJ 2007(C++)
平方和与立方和#include<iostream>using namespace std;int main(){ int temp,i,x,y,sum1 = 0 ,sum2 = 0; while(cin>>x>>y) { if(x>y) { temp = x; x = y ; y = temp; } for( i = x ; i <= y ; i++ ) { if( i % 2 == 0 )
2021-07-14 08:24:20 79
原创 杭电OJ 2006(C++)
求奇数的乘积#include<iostream>using namespace std;int main(){ int i , sum = 1 , n; while(cin>>n) { int *a = new int[n]; for(i = 0 ; i < n ; i++ ) { cin>>a[i]; if(a[i] % 2 != 0) sum *= a[i]; } cout<< sum <
2021-07-14 08:24:05 89
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人