fork download
  1. #include <bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4.  
  5. using namespace std;
  6. using namespace __gnu_pbds;
  7.  
  8. // #pragma GCCoptimize("O3")
  9. // #pragma GCCtarget("sse4")
  10. // #pragma GCCoptimize("unroll-loops")
  11.  
  12. #define vi vector<int>
  13. #define PB push_back
  14. #define vll vector<long long>
  15. #define ll long long
  16. #define all(x) x.begin(), x.end()
  17. #define F first
  18. #define S second
  19. #define ld long double
  20. #define vld vector<long double>
  21. #define pll pair<ll, ll>
  22. #define pii pair<int, int>
  23. #define vpii vector<pair<int, int>>
  24. #define GCD __gcd
  25. #define INT __int128
  26.  
  27. #define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
  28.  
  29. const ll mod = 998244353;
  30. const ll MOD = 1e9 + 7;
  31. const ll INF = 1e18;
  32. const int inf = 1e9;
  33.  
  34. void solve(int tst){
  35.  
  36. unsigned long long n;
  37. cin >> n;
  38.  
  39. INT N = n;
  40.  
  41. INT ANS = ((N * N) + 2) / 4ll;
  42.  
  43. unsigned long long ans = ANS;
  44. cout << ans << "\n";
  45.  
  46.  
  47.  
  48. }
  49.  
  50. int main(){
  51. ios_base::sync_with_stdio(0);
  52. cin.tie(0);
  53. // pre();
  54. int tc = 1;
  55. cin >> tc;
  56. for (int i = 1; i <= tc; i++){
  57. solve(i);
  58. }
  59. return 0;
  60. }
Success #stdin #stdout 0.01s 5320KB
stdin
Standard input is empty
stdout
0