ACM-ICPC 2018 南京网络赛
A 1 /* Huyyt */ 2 #include<bits/stdc++.h> 3 using namespace std; 4 typedef long long ll; 5 const int mod = 998244353 ; 6 const int maxn = 1e3 + 5 ; 7 int main() 8 { 9 int T; 10 cin >> T; 11 while (T-- ) 12 { 13 ll x; 14 scanf( " %lld " ,& x); 15 printf( " %lld\n " ,x- 1 ); 16 } 17 return 0 ; 18 } //A B #include<bits/stdc++.h> #define lc(x) (2*x) #define rc(x) (2*x+1) #define fi first #define se second using namespace std; typedef long long ll; const ll mod = 998244353 ; const int maxn = 1e5+ 5 ; const int maxm = 1e2+ 5 ; int n,m,k; vector < int > v[maxm]; int lit[maxn]; int near[maxm]; int