weixin_43965572的博客

#include<iostream>using namespace std;#include<iomanip>#define PI 3.1415927int main(){ double array[100][2]; int i = 0; while (cin >> array[i][0]) { array[i][1] = (4.0 / ...

#include<iostream>using namespace std;int main(){ _int64 a, b, s; while (cin >> hex >> a>> b ) { s = a + b; if(s>=0) cout <<uppercase<< hex << ...

#include<iostream>using namespace std;#include<cmath>int main(){ int m, n, nl; while (cin >> m >> n) { int a[4]={0}; nl = 0; int q, w, e; for (int i = m; i <...

#include<iostream>using namespace std;int main(){ int j, a, b, temp; while (cin >> a >> b&&a!=0&&b!=0) { int*p = new int[a + 1]; for (int i = 0; i < a; ...

求数根的方法：与9取余，为0得9，else取结果#include<iostream>using namespace std;#include<sstream>#include<string>int main(){ int nl, ng = 0; string strin(1001,'\0'); stringstream str; whil...

#include<iostream>using namespace std;int main(){ long long c[51] = { 0 }, n; c[1] = 1; c[2] = 2; for (int i = 3; i < 51; i++) { c[i] = c[i - 1] + c[i - 2]; } while (cin >>...

#include<iostream>using namespace std;int main(){ long long a, b, c[50] = {0}, n; cin >> n; c[1] = 1; c[2] = 2; for (int j = 3; j < 50; j++) { c[j] = c[j - 1] + c[j - 2...

#include<iostream>using namespace std;int main(){ long long n, m, a, nl, ng,sum; while (cin >> n >> m >> a) { nl = 0; ng = 0; sum = 0; if (n%a == 0) nl = n / a;...

高精度相加（利用竖式方法，把对位数放进数组，注意满10进1再与10取余） 注意：（输出时把数组前面的0去掉）#include<iostream>using namespace std;#include<cstring>int main(){ char ch[1001], cr[1001]; int a[1001],n,nl,ng,temp; cin &...

个位数不断相乘将产生周期性的数#include<iostream>using namespace std;#include<sstream>#include<string>int main(){ int n, nl, ng, nt, a[10][4] = { 0,0,0,0,1,1,1,1,2,4,8,6,3,9,7,1,4,6,4,6,5,5...

两数的最小公倍数=两数之积 / 两数的最大公因数；注意整型数的取值范围（long long）#include<iostream>using namespace std;long long gys(long long a, long long b){ if (b == 0) return a; return gys(b, a%b);}int main(){ l...

#include<iostream>using namespace std;int main(){ int n, sum,sum1=0; cin >> n >> sum; int *a = new int[n]; for (int i = 0; i < n; i++) { cin >> a[i]; sum1 += a[...

#include<iostream>using namespace std;int main(){ int a[151],sum,sum1=0; cin >> sum; for (int i = 1; i <= 150; i++) { a[i] = (1 + i)*i / 2; sum1 += a[i]; a[i+1]= (2 + i)*(...

#include<iostream>using namespace std;int main(){ int n, nl=0; char ch; while (cin >> ch) { if (ch == '@') return 0; cin >> n; if (nl != 0) cout << endl; nl++;...

#include<iostream>using namespace std;#include<algorithm>int main(){ int T, n, m, a[13][20] = { 0 }, b[13][500] = { 0 }, c[20] = { 0 }, d[500] = {0}; int q = 0, w = 0; cin >>...

#include<iostream>using namespace std;int main(){ double a, b; while (cin >> a >> b) { cout << a + b << endl; } return 0;}

#include<iostream>using namespace std;int main(){ int a, b, i = 0; while (cin >> a >> b) { if ((a + b) % 86 == 0) cout << "yes" << endl; else cout << "no...

#include<iostream>using namespace std;void sort(char[], const int);int main(){ char ch[3]; while (cin >> ch[0] >> ch[1] >> ch[2]) { sort(ch, 3); } return 0;}void ...

#include<iostream>using namespace std;int main(){ int nl, sum=0, array[100][2]; cin >> nl; for (int i = 0; i < nl ; i++) { cin >> array[i][0] >> array[i][1]; if ...

#include<iostream>using namespace std;int main(){ char ch[100] = "\0"; int a[100], nl=0, ng=0; while (cin >> ch[nl]) { nl++; } for (int i = 0; i < nl; i++) { if (ch[i] !=...

#include<iostream>using namespace std;int main(){ int n, sum = 0; cin >> n; char *p = new char[n]; for (int i = 0; i < n; i++) cin >> *(p + i); for (int i = 0; i < n...

#include<iostream>#include<string>#include<algorithm>#include<sstream>using namespace std;int main(){ int lastplace, place, strint[999]; stringstream stream; string s...

#include<iostream>using namespace std;int main(){ int n; cin >> n; if (n % 2 == 0 && n != 2) cout << "Yes" << endl; else cout << "No" << endl; retu...

#include<iostream>#include<cstdio>#include<string>#include<sstream>using namespace std;int main(){ int n, nl[100][5],ng; stringstream stream; string str,strr; getlin...

#include<iostream>using namespace std;struct days{ int a, b, c; char ch;};int main(){ days day; int q[100],j=0; int w[12] = { 31,29,31,30,31,30,31,31,30,31,30,31 }; int e[12] = { 31...

#include<iostream>using namespace std;int main(){ double a[100][3]; size_t n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i][0]>> a[i][1] >> a[i][2]; ...

#include<iostream>using namespace std;#include<cmath>int main(){ int a, b, s; cin >> a >> b >> s; if (s >= abs(a) + abs(b) && (s - abs(a) - abs(b))%2==...

#include<iostream>using namespace std;long long ll=1;int main(){ int a, b; cin >> a >> b; if (a > b) a = b; for (int i = 2; i <= a; i++) ll *= i; cout << ll &...

#include<iostream>using namespace std;const int maxn = 1000000 + 5;int gcd(int n, int m) { if (m == 0) return n; return gcd(m, n%m);}int main() { int num; cin >> num; while (nu...

分析：递推题1、我们先来看看增加直线的 不添加直线时，只有 1 个面；添加一条直线时，有 2 个面； 添加两条直线时，有 4 个面；再往后添加直线时，为使分隔面尽可能的多，则第 n 条直线需与前 n - 1 条直线相交且不存在三线或三线以上交于一点的情况。这样的话，在平面中，增加第 n 条直线就会增加 n - 1 个交点。也不难发现，平面中增加 i 个点就会增加 i + 1 个面。...

#include<iostream>using namespace std;int main(){ int a, b,work=0; cin >> a >> b; int *p = new int[a]; for (int i = 1; i < a; i++) { cin >> p[i]; } for (int i =...

#include<iostream>#include<string>#include <set>using namespace std;int main(){ string s; set<char> t; int nl; while (cin >> s) { nl = s.length(); for (int...

#include <iostream>using namespace std;double C(int m, int n){ double i, cn = 1, cm = 1, cc = 1; for (i = 1; i <= n; i++) cn *= i; for (i = 1; i <= m; i++) cm *= i; for (i = 1;...

#include <iostream>using namespace std;double C(int m, int n){ double i, cn = 1, cm = 1, cc = 1; for (i = 1; i <= n; i++) cn *= i; for (i = 1; i <= m; i++) cm *= i; for (i = 1;...

#include<iostream>using namespace std;char a[101][101];int m, n;void dfs(int i, int j){ if (a[i][j] != '@'|| i < 0 || j < 0 || i >= m || j >= n) return; else { a[i][j] = '...

#include<iostream>using namespace std;long long dp[40][40]; int main(){ int n; int k = 1; dp[1][-1] = 1; for (int i = 0; i < 40; i++) { for (int j = 0; j <= i; ...

#include<iostream>using namespace std;int main(){ long long a[21], b[21],n,m,nl; a[0] = 1; a[1] = 1; b[0] = 0; b[1] = 0; b[2] = 1; b[3] = 2; for (int i = 2; i < 21; i++) { a[i] = a[...

#include<iostream>using namespace std;int gcd(int a, int b){ if (b == 0) return a; return gcd(b, a%b);}int main(){ int work,a,b,n; while (cin>>a>>b>>n) { while (n...

#include<iostream>using namespace std;int main(){ int a[35][2],n,cnt; while (cin >> n) { cnt = 0; for (int i = 0; i < n; i++) { cin >> a[i][0] >> a[i][1]; ...

#include<iostream>using namespace std;int main(){ int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (i % 2 == 1) cout &lt...