SY_Yu的博客

Codeforces Round #395 (Div. 2)简单数学题#include<iostream> using namespace std;int gcd(int a,int b){ if(a%b==0) return b; return gcd(b,a%b); } int main(){ int n,m,z; cin>>n>>m>>z;

传送门#include<stdio.h>#define MAX_N 110int house[MAX_N];int main(){ int n,m,k; scanf("%d%d%d",&n,&m,&k); for(int i=1;i<=n;i++){ scanf("%d",&house[i]); if(house[i]==0)

传送门#include<iostream> using namespace std;#define MAX_N 100010 int main(){ int a[MAX_N]; int n,k; scanf("%d%d",&n,&k); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } int c