首页 > 其他 > 详细

Codeforces Round #395 A

时间:2017-07-20 16:46:30      阅读:256      评论:0      收藏:0      [点我收藏+]

 Taymyr is calling you

题意:给你n,m求不超过z的即是n的倍数又是m的倍数的树有多少个

思路:z/(n*m) *gcd(n,m)小学奥数题,或者直接暴力也可以

AC代码:

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#define ll long long
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a) memset(a,0,sizeof(a))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e5+100;
const ll mod=1e9+7;

int n,m,z,ans;
int main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>m>>z;
    cout<<z*__gcd(n,m)/(n*m)<<endl;
    return 0;
}

 

Codeforces Round #395 A

原文:http://www.cnblogs.com/max88888888/p/7211922.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!