2.2.2017 9:35~11:35
直接模拟
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> #include <cmath> using namespace std; typedef long long ll; const int N=1e4+5; inline int read(){ char c=getchar();int x=0,f=1; while(c<'0'||c>'9'){if(c=='-')f=-1; c=getchar();} while(c>='0'&&c<='9'){x=x*10+c-'0'; c=getchar();} return x*f; } int n,m,z,ans; int vis[N]; int main(int argc, const char * argv[]) { n=read();m=read();z=read(); for(int i=n;i<=z;i+=n) vis[i]=1; for(int i=m;i<=z;i+=m) ans+=vis[i]; printf("%d",ans); return 0; }