Code Snippet
update date 24-04-24swarup
c_cpp
12 days ago
1.0 kB
4
Indexable
Never
#include<bits/stdc++.h> using namespace std; #define ll long long #define test cout<<"ok"<<endl; #define check(n) for(auto x:n)cout<<x<<" " #define MX 1e9+7 // p.push_back(make_pair(a,b)); // pr.push_back({1,3}); //factor and divisor are same which is limited & multiple are unlimited // lcm = (a /__gcd(a,b)) * b; //vector < vector < int > > board(n,vector < int > (n)); //2d vector #define debug(x) cout << #x <<" " << x << endl; #define Faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define MOD 1000000007 #define setpre(x,y) fixed<<setprecision(y)<<x /*vector < bool > is_prime(MX+1, true); is_prime[0] = is_prime[1] = false; for(int i = 2; i*i<= MX; i++){ if(is_prime[i] == true) { for(int j = i * i ; j <= MX ;j+= i) { is_prime[j] = false; } } }*/ void solve(){ ll n; cin >> n; } int main(){ Faster; int t; cin >> t; while(t --){ solve(); } }
Leave a Comment