LEO的博客

题目链接#include<iostream>#include<algorithm>#include<vector>using namespace std;vector<int> divisors(int n){ vector<int>res; for(int i=1;i<=n/i;i++)//从小到大枚举较小的那个约数即可 { if(n%i==0)//如果i是n的一个约数

#include<iostream>using namespace std;const int maxn=1e6+10;int st[maxn]; int top=-1;//表示栈为空 int main(){ int n; cin>>n; for(int i=0;i<n;i++) { string s; cin>>s; if(s=="push"){ int x; cin>>x; st[++top]=x;.

#include<iostream>using namespace std;const int maxn=1e5+10;int a[maxn],b[maxn];int main(){ //k是最长连续不重复子序列元素的个数 int n,k=0; cin>>n; for(int i=0,j=0;j<n;j++) { cin>>a[j]; b[a[j]]++; while(b[a[j]]>1){ b[a[i]]-=1;.

for(auto count : counts)意思是将 counts 容器中的每一个元素从前往后枚举出来，并用 count 来表示#include<iostream>#include<vector>using namespace std;int main() { int a[] = { 1,2,3,5,2,0 }; vector<int>counts(a,a+6); for (auto count : counts)

862. 三元组排序#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;const int N = 10010;int n;struct three{ int a; double b; string c;};three th[N];bool comp(three x, t

823. 排列#include<iostream>#include<algorithm>#include<vector>using namespace std;int main(){//利用next_permutation()进行元素全排列时,想要得到区间内容的所有排列组合,应从最初的顺序开始 vector<int> a; int n; cin>>n; for(int i=1;i<=n;i++

822. 走方格#include <stdio.h>int n, m;int res; // res 存答案void dfs(int x, int y) // 爆搜函数{ if (x == n && y == m) // 如果搜到了点 (n, m), 那么 res ++ 并返回 { res ++ ; return ; } if (x < n) dfs(x

821. 跳台阶#include <bits/stdc++.h>using namespace std;int n;int dg(int dep){ if (dep == 1) return 1; if (dep == 2) return 2; //终止条件 return dg(dep - 1) + dg(dep - 2);}int main(){ scanf("%d", &n); printf("%d\n", dg(

817. 数组去重

816. 数组翻转#include <iostream>using namespace std;void reverse(int a[], int size){ for(int i=0;i<size/2;i++) { int t=a[i]; a[i]=a[size-i-1]; a[size-i-1]=t; }}int main(){ int n,size; int a[1010]; cin>>n>>size; for(

815. 打印字符串#include <iostream>using namespace std;void print(char str[]){ puts(str);}int main(){ char str[101]; fgets(str,100,stdin); print(str); return 0;}

811. 交换数值#include <iostream>using namespace std;void swap(int &x, int &y)//这里&表示引用 { if(x==y)return ; int t=x; x=y; y=t;}int main(){ int x,y; cin>>x>>y; swap(x,y); cout<<x<<" "<<y.

762. 字符串匹配#include <iostream>#include <cstring>using namespace std;int main(){ double k; cin>>k; string a,b; cin>>a>>b; int count=0; for(int i=0;i<a.size();i++) { if(a[i]==b[i])

772. 只出现一次的字符#include <iostream>#include <cstring>using namespace std;int cnt[26];char str[100010];int main(){ cin >> str; for (int i = 0; str[i]; i ++ ) cnt[str[i] - 'a'] ++ ; for (int i = 0; str[i]; i ++ )

761. 字符串中的数字个数#include <iostream>#include <cstring>using namespace std;int main(){ string a; int count=0; getline(cin,a); for(int i=0;i<a.size();i++) { if(a[i]>='0'&&a[i]<='9') { cou

760. 字符串长度#include<string.h>#include<stdio.h>int main(){ char s[105]; gets(s); printf("%d",strlen(s)); return 0;}方法二#include <iostream>#include <cstring>using namespace std;int main(){ string a

741. 斐波那契数列#include<iostream>using namespace std;int main(){ int T; cin>>T; long long int Fib[61];//防止范围越界 Fib[0]=0; Fib[1]=1; for(int i=2;i<61;i++) Fib[i]=Fib[i-1]+Fib[i-2]; while(T--) { .

749. 数组的上方区域#include <iostream>#include<stdio.h>using namespace std;int main(){ double a[12][12]; char c; cin>>c; for(int i=0;i<12;i++) { for(int j=0;j<12;j++) { cin>>a[i][j]; } } d

747. 数组的左上半部分#include <iostream>#include<stdio.h>using namespace std;int main(){ double a[12][12]; char c; cin>>c; for(int i=0;i<12;i++) { for(int j=0;j<12;j++) { cin>>a[i][j]; } }

745. 数组的右上半部分#include <iostream>#include<stdio.h>using namespace std;int main(){ double a[12][12]; char c; cin>>c; for(int i=0;i<12;i++) { for(int j=0;j<12;j++) { cin>>a[i][j]; } }

743. 数组中的行#include<iostream>#include<cstdio>using namespace std;int main(){ double M[12][12]; int l; char c; cin>>l>>c; for(int i=0;i<12;++i) for(int j=0;j<12;++j) cin>>M[i]

#include <iostream>#include<math.h>using namespace std;int main(){ double a,b; cin>>a>>b; if(fabs(a-b)<1e-6) { cout<<"相等"<<endl; } else{ cout<<"不相等"<<endl; } return.

739. 数组选择#include <iostream>using namespace std;const int maxn=10010;double a[maxn];//注意数据类型是double型 int main(){ for(int i = 0; i < 100; i ++) { cin>>a[i]; } for(int i = 0; i < 100; i ++) { if(a

727. 菱形'思想：曼哈顿距离#include <iostream>using namespace std;int main(){ int n; cin>>n; int cx=n/2,cy=n/2; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if(abs(i-cx)+abs(j-cy)<=n/2) { cout<<"*"; }

725. 完全数#include <iostream>using namespace std;int main(){ int n; cin>>n; while (n--) { int x; int s=1; cin>>x; for(int i = 2; i<= x/i; i++){ if (x % i == 0) {

722. 数字序列和它的和#include<iostream>using namespace std;int main(){ int n,m; while(cin>>n>>m,n>0&&m>0) { if(n>m)swap(n,m); int sum=0; for(int i=n;i<=m;i++) { cout<<i<&lt

717. 简单斐波那契#include <iostream>using namespace std;int main() { int a = 0, b = 1, c = 1, m; cin >> m; while (m -- ) { printf("%d ", a); a = b; b = c; c = a + b; } return 0;}...

710. 六个奇数#include<iostream>using namespace std;int main(){ int x; cin>>x; if(x%2==0) { x++; } for(int i=0;i<6;i++) { cout<<x+i*2<<endl; } return 0;}

723. PUM#include<iostream>using namespace std;int main(){ int n,m; cin>>n>>m; for(int j=1;j<=n*m;j++) { if(j%m==0) cout<<"PUM"<<endl; else cout<<j<<

720. 连续整数相加#include<cstdio>#include<iostream>using namespace std;int main(){ int a,n; cin>>a; while(cin>>n,n<=0); int sum=0; for(int i=0;i<n;i++) { sum+=a+i; } cout<<sum<<endl;

721. 递增序列#include<iostream>using namespace std;int main(){ int i,x; while(1) { cin>>x; if(x==0) break; else{ for(i=1;i<=x;i++) { cout<<i<<" ";

#include<iostream>#include<stdio.h>#include<math.h>using namespace std;int main(){ for(int i=2;i<100;i++) { bool is_prime=true; for(int j=2;j<i;j++) { if(i%j==0) { .

668. 游戏时间2#include<iostream>#include<cstdio>using namespace std;int main(){ int a,b,c,d; cin>>a>>b>>c>>d; int start_time,end_time,dif; //dif表示时间差 start_time=a*60+b; //把时间全部用分钟代替 end_time=c*60

666. 三角形类型#include <iostream>using namespace std;int main(){ double a, b, c; cin >> a >> b >> c; if (a < b) swap(a, b); if (a < c) swap(a, c); if (b < c) swap(b, c); if (a >= b + c) .

AcWing 670. 动物 #include <iostream>using namespace std;int main(){ string a, b, c; cin >> a >> b >> c; if (a == "vertebrado") { if (b == "ave") { if (c == "carnivoro") cout <&.

656. 钞票和硬币#include <stdio.h>int main(){ double number; scanf("%lf", &number); int n = number * 100; printf("NOTAS:\n"); printf("%d nota(s) de R$ 100.00\n", n / 10000); n %= 10000; printf("%d nota(s) de R$ 50.00\n",

617. 距离每行走60分钟，拉开30公里。距离L公里，则行走了2L分钟。#include<iostream>using namespace std;int main(){ int l; cin>>l; cout<<2*l<<" minutos"<<endl; return 0;}刚开始没反应过来，后来一想有点可笑。哈哈。...

614. 最大值#include<iostream>using namespace std;int main(){ int a,b,c; cin>>a>>b>>c; int t=(a+b+abs(a-b))/2; int r=(t+c+abs(t-c))/2; cout<<r<<" eh o maior"; return 0;}

653. 钞票#include<stdio.h>int main(){ int n; scanf("%d",&n); printf("%d\n",n); printf("%d nota(s) de R$ 100,00\n",n/100); n%=100; printf("%d nota(s) de R$ 50,00\n",n/50); n%=50; printf("%d nota(s) de R$ 20,00\n"