-
-
Save Neilblaze/dcf6113fa5e63fc938502f1d742365c4 to your computer and use it in GitHub Desktop.
| #include <bits/stdc++.h> | |
| using namespace std; | |
| /* clang-format off */ | |
| /* TYPES */ | |
| #define ll long long | |
| #define pii pair<int, int> | |
| #define pll pair<long long, long long> | |
| #define vi vector<int> | |
| #define vll vector<long long> | |
| #define mii map<int, int> | |
| #define si set<int> | |
| #define sc set<char> | |
| /* FUNCTIONS */ | |
| #define f(i,s,e) for(long long int i=s;i<e;i++) | |
| #define cf(i,s,e) for(long long int i=s;i<=e;i++) | |
| #define rf(i,e,s) for(long long int i=e-1;i>=s;i--) | |
| #define pb push_back | |
| #define eb emplace_back | |
| /* PRINTS */ | |
| template <class T> | |
| void print_v(vector<T> &v) { cout << "{"; for (auto x : v) cout << x << ","; cout << "\b}"; } | |
| /* UTILS */ | |
| #define MOD 1000000007 | |
| #define PI 3.1415926535897932384626433832795 | |
| #define read(type) readInt<type>() | |
| ll min(ll a,int b) { if (a<b) return a; return b; } | |
| ll min(int a,ll b) { if (a<b) return a; return b; } | |
| ll max(ll a,int b) { if (a>b) return a; return b; } | |
| ll max(int a,ll b) { if (a>b) return a; return b; } | |
| ll gcd(ll a,ll b) { if (b==0) return a; return gcd(b, a%b); } | |
| ll lcm(ll a,ll b) { return a/gcd(a,b)*b; } | |
| string to_upper(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A'; return a; } | |
| string to_lower(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A'; return a; } | |
| bool prime(ll a) { if (a==1) return 0; for (int i=2;i<=round(sqrt(a));++i) if (a%i==0) return 0; return 1; } | |
| void yes() { cout<<"YES\n"; } | |
| void no() { cout<<"NO\n"; } | |
| /* All Required define Pre-Processors and typedef Constants */ | |
| typedef long int int32; | |
| typedef unsigned long int uint32; | |
| typedef long long int int64; | |
| typedef unsigned long long int uint64; | |
| /* clang-format on */ | |
| /* Main() function */ | |
| int main() | |
| { | |
| #ifndef ONLINE_JUDGE | |
| freopen("input.txt","r",stdin); | |
| //freopen("output.txt","w",stdout); | |
| #endif | |
| int tc; | |
| tc = read(int); | |
| while(tc--){ | |
| write(tc); | |
| } | |
| return 0; | |
| } | |
| /* Main() Ends Here */ |
its pretty helpful when creating your first template, although i removed most of the stuff, it was still a great reference, thank you!
thanks
pretty helpful.
what is the write(tc); ?
Thanks
W
thanks. but i think there's an issue at line 25
When I copied the code, it's showing that readInt is undefined, and write—could you please help?
When I copied the code, it's showing that readInt is undefined, and write—could you please help?
bro how did you solve this issue?
Thank you :)
thanks pal ;)
Hi , did use but i m not able to see the output in output.txt , no issue in the build
#include <bits/stdc++.h>
using namespace std;
/* clang-format off */
/* TYPES */
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector
#define vll vector
#define mii map<int, int>
#define si set
#define sc set
/* FUNCTIONS */
#define f(i,s,e) for(long long int i=s;i<e;i++)
#define cf(i,s,e) for(long long int i=s;i<=e;i++)
#define rf(i,e,s) for(long long int i=e-1;i>=s;i--)
#define pb push_back
#define eb emplace_back
/* PRINTS */
template
void print_v(vector &v) { cout << "{"; for (auto x : v) cout << x << ","; cout << "\b}"; }
/* UTILS */
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define read(type) readInt()
ll min(ll a,int b) { if (a<b) return a; return b; }
ll min(int a,ll b) { if (a<b) return a; return b; }
ll max(ll a,int b) { if (a>b) return a; return b; }
ll max(int a,ll b) { if (a>b) return a; return b; }
ll gcd(ll a,ll b) { if (b==0) return a; return gcd(b, a%b); }
ll lcm(ll a,ll b) { return a/gcd(a,b)*b; }
string to_upper(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A'; return a; }
string to_lower(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A'; return a; }
bool prime(ll a) { if (a==1) return 0; for (int i=2;i<=round(sqrt(a));++i) if (a%i==0) return 0; return 1; }
void yes() { cout<<"YES\n"; }
void no() { cout<<"NO\n"; }
/* All Required define Pre-Processors and typedef Constants */
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
/* clang-format on */
template
T readInt() {
T x;
cin >> x;
return x;
}
template
void write(T x) {
cout << x << "\n";
}
/* Main() function */
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
freopen("error.txt","w",stdout);
#endif
// int tc;
// tc = readInt<int>();
//
// while(tc--){
// write(tc);
// }
write(3);
return 0;
}
/* Main() Ends Here */
this is what i did
Extras