結果

問題 No.1915 Addition
ユーザー rianoriano
提出日時 2022-03-28 22:12:41
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 4,331 bytes
コンパイル時間 1,778 ms
コンパイル使用メモリ 173,492 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-25 00:53:18
合計ジャッジ時間 3,096 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)
#define vll(n,i) vector<long long>(n,i)
#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))
#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))
#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))
#define all(v) v.begin(),v.end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//Graph
struct graph {
long long N;
vector<vector<tuple<long long,long long,int>>> G;
vector<long long> par_v;
vector<long long> par_e;
int edge_count = 0;
graph(long long n) {
N = n;
G = vector<vector<tuple<long long,long long,int>>>(N);
par_v = vector<long long>(N,-1);
par_e = vector<long long>(N,-1);
}
void unite(long long a,long long b,long long cost = 1,bool directed = false){
G[a].emplace_back(b,cost,edge_count);
if(!directed) G[b].emplace_back(a,cost,edge_count);
edge_count++;
}
};
const ll mod = 998244353;
template<uint64_t mod>
struct modint{
uint64_t val;
constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}
constexpr modint operator-() const noexcept{
return modint(*this)=mod-val;
}
constexpr modint operator+(const modint rhs) const noexcept{
return modint(*this)+=rhs;
}
constexpr modint operator-(const modint rhs) const noexcept{
return modint(*this)-=rhs;
}
constexpr modint operator*(const modint rhs) const noexcept{
return modint(*this)*=rhs;
}
constexpr modint operator/(const modint rhs) const noexcept{
return modint(*this)/=rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept{
val+=rhs.val;
val-=((val>=mod)?mod:0);
return (*this);
}
constexpr modint &operator-=(const modint rhs) noexcept{
val+=((val<rhs.val)?mod:0);
val-=rhs.val;
return (*this);
}
constexpr modint &operator*=(const modint rhs) noexcept{
val=val*rhs.val%mod;
return (*this);
}
constexpr modint &operator/=(modint rhs) noexcept{
uint64_t ex=mod-2;
modint now=1;
while(ex){
now*=((ex&1)?rhs:1);
rhs*=rhs,ex>>=1;
}
return (*this)*=now;
}
modint & operator++(){
val++;
if (val == mod) val = 0;
return *this;
}
modint operator++(int){
modint<mod> res = *this;
++*this;
return res;
}
constexpr bool operator==(const modint rhs) noexcept{
return val==rhs.val;
}
constexpr bool operator!=(const modint rhs) noexcept{
return val!=rhs.val;
}
friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{
return os<<(x.val);
}
friend constexpr istream &operator>>(istream& is,modint& x) noexcept{
uint64_t t;
is>>t,x=t;
return is;
}
};
typedef modint<mod> mint;
mint pw(long long a,long long b,long long m = mod){
if(a%m==0) return mint(0);
if(b==0) return mint(1);
else if(b%2==0){
long long x = pw(a,b/2,m).val;
return mint(x*x);
}
else{
long long x = pw(a,b-1,m).val;
return mint(a*x);
}
}
mint modinv(long long a, long long m = mod) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
return mint(u);
}
#define vm(n,i) vector<mint>(n,i)
#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))
#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))
#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))
void out(vector<ll> &v){
for(ll x:v) cout << x << " ";
cout << "\n"; return;
}
int main(){
riano_; ll ans = 1;
ll N,M,K,H,W,Q,L,R,T; cin >> T;
rep(ii,T){
cin >> N; cout << 2*N << "\n";
}
//cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0