Gym101194A-Number Theory Problem

来源:互联网 发布:java 邮箱匹配 编辑:程序博客网 时间:2024/03/29 14:29

题意:给你一个n,问1~n之间,有多少2^i-1是7的倍数

解题思路:找规律发现n/3即可


#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int main(){    int t, cas = 1, n;    scanf("%d", &t);    while(t--)    {        scanf("%d", &n);        printf("Case #%d: %d\n", cas++, n / 3);    }    return 0;}

原创粉丝点击