Easy problem

https://ac.nowcoder.com/acm/contest/338/E

C++版本一

题解：

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <bitset>
using namespace std;#define LL long long
const int maxn = 20;
int T;
LL x, k, ans;
int num[maxn];int main() {#ifdef Dmaxiyafreopen("test.txt", "r", stdin);#endif // Dmaxiyaios::sync_with_stdio(false);scanf("%d", &T);while(T--) {ans = 987654321000000000LL;scanf("%lld%lld", &x, &k);for(int i = 0; i < k; ++i) {scanf("%d", &num[i]);}printf("%lld\n", ans + (x - ans % x));}return 0;
}

C++版本二

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int a;
char str;
int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endifscanf("%d",&t);while(t--){scanf("%d%d",&n,&k);ll N=123456789000000000;for(int i=1;i<=k;i++)scanf("%d",&m);cout<<N+(n-N%n)<<endl;}//cout << "Hello world!" << endl;return 0;
}

C++版本三

题解：

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int a;
char str;
int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endifscanf("%d",&t);while(t--){scanf("%d%d",&n,&k);ll N=102345678900000000;for(int i=1;i<=k;i++)scanf("%d",&m);if(N%n)cout<<N+(n-N%n)<<endl;elsecout<<N<<endl;}//cout << "Hello world!" << endl;return 0;
}

Easy problem相关推荐

POJ 2826 An Easy Problem?! 叉积求多边形面积【计算几何】
ACM博客_kuangbin POJ 2826 An Easy Problem?! An Easy Problem?! Time Limit: 1000MS Memory Limit: 65536 ...
2019年ICPC银川区域赛 Easy Problem（简单莫比乌斯函数 + 欧拉降幂）
Easy Problem ∑a1=1m∑a2=1m∑a3=1m⋯∑an−1m∑anm[gcd(a1,a2,a3,-,an−1,an)==d](a1,a2,a3,-,an−1,an)k=dkd∑a1=1 ...
数论六之计算几何——An Easy Problem，Ancient Berland Circus，Open-air shopping malls
可检验模板正确度 An Easy Problem?! Ancient Berland Circus Open-air shopping malls An Easy Problem?! problem ...
信息学奥赛一本通 1223：An Easy Problem | OpenJudge NOI 4.6 1455:An Easy Problem
[题目链接] ybt 1223:An Easy Problem OpenJudge NOI 4.6 1455:An Easy Problem [题目考点] 1. 数制 2. 枚举 [解题思路] 解法1 ...
信息学奥赛一本通（1223：An Easy Problem）
1223:An Easy Problem 时间限制: 1000 ms 内存限制: 65536 KB 提交数: 5835 通过数: 4111 [题目描述] 给定一个正整数N,求最 ...
【UVA】11991 Easy Problem from Rujia Liu? （整数v第k次出现在什么位置）
https://vjudge.net/problem/UVA-11991 题目大意:就是给你一个序列,然后给出k和v,看整数v第k次出现在该序列的什么位置,没有的话就输出0 结构体(略复杂): #in ...
数学--数论-- HDU 2601 An easy problem（约束和）
Problem Description When Teddy was a child , he was always thinking about some simple math problems ...
CodeForces - 1058A. In Search of an Easy Problem
这题,全零是esay有1是hard,真难呀. #include<bits/stdc++.h> using namespace std; int main(){int n,i,x,flag= ...
leetcode easy problem set
*勿以浮沙筑高台* 持续更新........ 题目网址:https://leetcode.com/problemset/all/?difficulty=Easy 1. Two Sum [4m ...
HDOJ(HDU) 2123 An easy problem(简单题...)
Problem Description In this problem you need to make a multiply table of N * N ,just like the sample ...

Easy problem

Easy problem相关推荐

最新文章

热门文章