Skip to content

Instantly share code, notes, and snippets.

@masa5555
Last active September 16, 2020 13:48
Show Gist options
  • Save masa5555/d04d90ffb18c406844a2fd25cee62b20 to your computer and use it in GitHub Desktop.
Save masa5555/d04d90ffb18c406844a2fd25cee62b20 to your computer and use it in GitHub Desktop.
競プロ テンプレート
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const ll powll = 1LL<<1;
int main(){
int tt; cin >> tt;
while(tt--){
cout << 1 << "\n";
}
}
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const ll powll = 1LL<<1;
int main(){
int tt: cin >> tt;
while(tt--){
}
}
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD = (int)1e9+7;
const ll INF = MOD*MOD;
const ll powll = 1LL<<1;
int main(){
int tt; cin >> tt;
while(tt--){
cout << 1 << "\n";
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment