Code Snippet
swarup
c_cpp
a year ago
883 B
6
Indexable
#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 #define debug(x) cout << #x <<" " << x << endl; #define Faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define MOD 1000000007 vector < bool > is_prime(MX+ 1, true); /*is_prime[0] = false; is_prime[1] = true; for(int i = 2; i<= MX; i++){ if(is_prime[i] == true && i * i <= MX) { 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(); } }
Editor is loading...
Leave a Comment