CodeForces 764A Taymyr is calling you

题目链接：http://codeforces.com/contest/764/problem/A
题意：输入三个整数n，m，z，然后根据n和m生成了两个序列，n,2n,3n……,m,2m,3m，问你这两个序列在不超过z的情况下有多少个数是相同的
解析：直接开个vis数组标记一下即可

#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <cstring>#include <queue>#include <map>using namespace std;const int maxn = 1e5+100;const int inf = 0x7fffffff;int vis[maxn];int main(void){    int n,m,z;    int ans = 0;    scanf("%d %d %d",&n,&m,&z);    for(int i=1;i*n<=z;i++)        vis[i*n] = 1;    for(int i=1;i*m<=z;i++)    {        if(vis[i*m])            ans++;    }    printf("%d\n",ans);    return 0;}