Gym 100548A Built with Qinghuai and Ari Factor (水题)
and with 水题 gym Factor built
2023-09-11 14:17:18 时间
题意:给定 n 个数,问是不是全是3的倍数。
析:略。
代码如下:
#pragma comment(linker, "/STACK:1024000000,1024000000") #include <cstdio> #include <string> #include <cstdlib> #include <cmath> #include <iostream> #include <cstring> #include <set> #include <queue> #include <algorithm> #include <vector> #include <map> #include <cctype> #include <cmath> #include <stack> //#include <unordered_map> //#include <tr1/unordered_map> #define freopenr freopen("in.txt", "r", stdin) #define freopenw freopen("out.txt", "w", stdout) using namespace std; //using namespace std :: tr1; typedef long long LL; typedef pair<int, int> P; const int INF = 0x3f3f3f3f; const double inf = 0x3f3f3f3f3f3f; const LL LNF = 0x3f3f3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-8; const int maxn = 10005; const LL mod = 10000000000007; const int N = 1e6 + 5; const int dr[] = {-1, 0, 1, 0, 1, 1, -1, -1}; const int dc[] = {0, 1, 0, -1, 1, -1, 1, -1}; const char *Hex[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"}; inline LL gcd(LL a, LL b){ return b == 0 ? a : gcd(b, a%b); } int n, m; const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; inline int Min(int a, int b){ return a < b ? a : b; } inline int Max(int a, int b){ return a > b ? a : b; } inline LL Min(LL a, LL b){ return a < b ? a : b; } inline LL Max(LL a, LL b){ return a > b ? a : b; } inline bool is_in(int r, int c){ return r >= 0 && r < n && c >= 0 && c < m; } int main(){ int T; cin >> T; for(int kase = 1; kase <= T; ++kase){ scanf("%d", &n); bool ok = true; for(int i = 0; i < n; ++i){ scanf("%d", &m); if(m % 3 != 0) ok = false; } printf("Case #%d: %s\n", kase, ok ? "Yes" : "No"); } return 0; }
相关文章
- Summary: difference between public, default, protected, and private key words
- Summary: Difference between null and empty String
- Kentico lots of log with event code “CREATEOBJ” and “UPDATEOBJ”
- Identifying and Solving Index Scan Problems
- Secure a Web API with Individual Accounts and Local Login in ASP.NET Web API 2.2
- Models and the ServiceManager
- Host key for * has changed and you have requested strict checking.Host key verification failed.
- leetcode-38 Count And Say
- BZOJ3483 : SGU505 Prefixes and suffixes(询问在线版)
- Failed to configure a DataSource: ‘url‘ attribute is not specified and no embedded datasource could
- xtu read problem training 3 A - The Child and Homework
- 11Echarts - 折线图(Rainfall and Water Flow)
- 1119 Pre- and Post-order Traversals (30 分)【难度: 难 / 知识点: 树的构建】
- HOW TO BUILD AND RUN ORACLE DATABASE 19C ON DOCKER
- While installing plugin in eclipse luna, “Unable to acquire PluginConverter service” and “No repository found” errors appear in logs
- CoderForces 518C Anya and Smartphone (模拟)
- 《Access 2007开发指南(修订版)》一一2.14 实例:设计计算机咨询公司的Time and Billing应用程序所要求的表
- 基于人脸识别的考勤系统 — Flask App — With GUI — with source code
- Handling unhandled exceptions and signals
- Playing with coroutines and Qt
- 【HDU 5810多校】Balls and Boxes(打表/数学)
- Getting Started with OWIN and Katana(Console 代替iis 制作 web服务的简单方案)
- [LeetCode] Best Time to Buy and Sell Stock with Transaction Fee 买股票的最佳时间含交易费
- Five ways to maximize Java NIO and NIO.2--reference
- Best Time to Buy and Sell Stock
- Weekly Contest 78-------->811. Subdomain Visit Count (split string with space and hash map)