code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#define INF 0x3FFFFFFF
#define MN 2005
using namespace std;
int a[MN][MN],len[MN][MN],q[MN];
int n,m,p,ans,tp;
char c[MN];
inline int read()
{
int n=0,f=1; char c=getchar();
while (c<'0' || c>'9') {if(c=='-')f=-1; c=getchar();}
while (c>='0'... | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
const int bound = 1000*1000+10;
bool besucht[bound];
void init(){
for( int i = 0; i < bound; ++i ) besucht[i] = false;
}
int no(){
cout << 0 << endl;
return 0;
}
int main(... | 0 |
#include<stdio.h>
int main() {
int row, col, n;
scanf("%d %d %d", &row, &col, &n);
int bucket;
if (row >= col){
bucket = row;
} else {
bucket = col;
}
int i = 0, j;
int count = 0;
while (i < n){
count++;
i += bucket;
}
printf("%d\n", count);
return 0;
}
| // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vll vector<ll>
#define print(x) for(auto it=x.begin();it!=x.end();it++) cout<<*it<<' '; cout<<'\n';
#define debug(a,b,c) cout << a << " " << b << " " << c << endl;
#de... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define vv(T) std::vector<std::vector<T>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
vector<bool> seen(1'000'000'000);
bool ans = true;
for (int i = ... | 0 |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitse... | #include <bits//stdc++.h>
using namespace std;
int main(void){
while(1){
long long i,j,a,b,c,k,l;
cin>>a>>b;
if(a==0&&b==0)
break;
long long island[a][a];
for(i=0;i<a;i++){
for(j=0;j<a;j++){
if(i==j)
island[i][j]=0;... | 1 |
#include <iostream>
#include <vector>
#include <bitset>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
vector<ll> a(N);
for(ll i=0;i<N;i++) cin ... | #include <iostream>
#include <string>
using namespace std;
int main(){
string ibe;
int n;
int score=0,out=0;
int hit=0;
cin >> n;
for(int i=0;i<n;i++){
while(1){
if(out >= 3)break;
cin >> ibe;
if(ibe=="HIT"){
hit++;
if(hit==4){
score++;
hit--;
}
}
else if(ibe=="HOM... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace... | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 1 |
#include<bits/stdc++.h>
using namespace std;
bool isEven(int x){return x%2==0;}
bool solve(vector<int> a){
int n=a.size();
int oneCnt=count(a.begin(),a.end(),1);
int evenCnt=count_if(a.begin(),a.end(),isEven);
if(oneCnt || evenCnt<n-1){
return !isEven(evenCnt);
}
else{
int g=a[0... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | #include <bits/stdc++.h>
#define rep(i,s,n) for (int i = (s); i < n; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> x(n);
rep(i,0,n) cin >> x[i];
int ans = 1000000000;
rep(i,0,n-k+1) {
int a = x[i], b = x[i+k-1];
if (b < 0) {
ans = min(ans, abs(a));
} else if (... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define pb push_back
#define pll pair<ll, ll>
#define tri pair<pll, ll>
#define vl vector<ll>
#define vvl vector< vector<ll> >
#define vlp vector< pair<ll, ll> >
#de... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int A,B;
cin >> A >> B;
string S;
cin >> S;
for(int i=0;i<(int)S.size();i++){
if(i==A){
if(S[i]!='-'){
cout << "No" << endl;
return 0;
}
}
else{
if(!(S[i]-'0'>=0 && S[i]-'0'<=9)){
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%lld",&x);
int main(){
ll n, a, b;
sc(n) sc(a) sc(b)
ll X[... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
int n,m;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n;
vector<string> s(n);
for(int i=0; i<n; i++){
cin >> s.at(i);
}
cin >> m;
vector<string> t(m);
for(int i=0; i<m; i++){
cin >> t.at(i);
}
vector<int> num(n);
for(int i=0; i<n; i++){
for(int j=i; j<n; j++){
if(s.at(i)==s.at(... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L;
string S;
cin >> L >> S;
if (S.size() <= L) {
cout << S << endl;
} else {
cout << S.erase(L) << "..." << endl;
}
} | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
void trace(int A[], int N)
{
int i;
for (i = 0; i < N; i++) {
if(i > 0) cout << " ";
cout << A[i];
}
cout << endl;
}
int bubbleSort(int A[], int N){
bool flag = 1;
int cnt = 0;
... | /* HARD WORK FOREVER PAYS */
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define turbo(){ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
}
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef unsigned long long int ull;
v... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 50 + 5, mod = 1e9 + 7;
int n, k;
int a[N], dp[N][N][102];
int solve(int l, int r, int left)
{
if (l > r)
return 0;
if (dp[l][r][left] != -1)
return dp[l][r][left];
int ans = 0;
if (a[l] < 0)
{
... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retur... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include<stdio.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,j,n) for(int i = j; i < n; i++)
int main() {
vector<int> result(1000);
for (int i = 0; i < 1000; ++i) {
vector< vector<int> > map(21, vec... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> pipii;
typedef long long ll;
typedef pair<ll,ll> p... | #include <bits/stdc++.h>
using namespace std;
int N,M,Q,m;
const int maxn=600000+5;
int siz;
int C[maxn],a[maxn],ret[maxn];
struct node{
int l,r,id;
bool operator<(const node& other)const{
return other.r > r;
}
}x[maxn],y[maxn];
void add(int x,int v){
for(int i=x;i<=m;i+=i&-i) C[i]+=v;
}
int sum(int x){
int r... | 1 |
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
typedef unsigned long long ull;
#define vvi std::vector<std::vector<int> >
#define vvu std::vector<std::vector<ull> >... | 1 |
/** Created by: Marcos Portales
Codeforces User: marcosportales
Country: Cuba
**/
#include<bits/stdc++.h>
using namespace std;
/// Macros:
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#defi... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<int> A[300];
for(int i=0; i<N; i++){
for(int j=0; j<M; j++){
int a;
cin >> a;
A[i].push_back(a-1);
}
reverse(A[i].begin(), A[i].end());
}
int ans... | 0 |
#include<iostream>
using namespace std;
#include<stdio.h>
class union_find // union find.
{
int* U;
public:
union_find(int n){ U = new int [n + 1]; for(int i = 1; i <= n; i++) U[i] = i; }
int root(int a){ if(U[a] == a){ return a; } U[a] = root(U[a]); return U[a]; }
bool same(int a, int b){ return root... | #include <iostream>
using namespace std;
int main() {
int n, matrix[100][100];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> matrix[i][j];
}
}
bool visit[100] = {
true
};
int sum = 0;
while (1) {
int min = 20... | 1 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sidha(i,a,b) for(int i=a;i<b;i++)
#define vi vector<int>
#define pb push_back
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,m,p;cin>>n>>m>>p;
cout<<min({n+m,m+p,n+p})<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int MAX_N=1e6;
int seg_tree[2*MAX_N+5],n;
void build()
{
for(int i=n-1; i>0; --i)
seg_tree[i]=__gcd(seg_tree[i<<1],seg_tree[i<<1|1]);
}
void modify(int pos,int val)
{
for(seg_tree[pos+=n]=val; pos>1; pos>>=1)
seg_tree[pos>>1]=__gcd(seg_tree[pos],seg_tree[pos^1]);
}
int... | 1 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
int s = accu... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 |
#include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
#define DEBUG 0
#if DEBUG
#define DLOG(...) fprintf(stderr, __VA_ARGS__)
#else
#define DLOG(...)
#endif
void debug(auto f) {
#if DEBUG
f();
#endif
}
ll mPrime = 1000*1000*1000 + 7;
ll n, x;
vector<ll> s;
vector<ll> fact... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <cstdio>
#include <stdio.h>
using namespace std;
int main(){
string str;
while(cin>>str){
int num=0;
vector<int> roman;
for(int i=0;i<str.length();i++){
if(str[i]=='I'){
roman.push_back(1);
}else if(str[i]=='V'){
roman.push_back(5);
... | //Author: Fuadul Hasan(fuadul202@gmail.com)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main(){
int n,k;
cin>>n>>k;
int sum = 0;
if(k < 0){
int last = (n + k - 1);
if(last>=0){
for(int i=k;i<=last;i++)
sum += i;
}else{
for(int i=k;i<last;i++){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
class StronglyConnectedComponentDecomposition
{
private:
int V; // ????????°
vector<vector<int>> G; // ??°???????????£??\???????????¨???
vector<vector<int>> rG; // ?????????????????????????????°??????
vector<int> vs; // ??°?????????????????????
vector<bool> used; // ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, v;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
char d;
char ds[] = "NESW";
while(cin >> n, n) {
int rx = 10, ry = 10, cnt = 0;
int graph[21][21];
memset(graph, 0, sizeof(graph));
f... | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <tuple>
#include <math.h>
#include <set>
#include <map>
using namespace std ;
using ll = long long ;
using ld = long double ;
... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main(){
... | 0 |
//BISMILLAHIR RAHMANIR RAHIM
//SOTO MEAW
//SOTO SONDESH
#include<bits/stdc++.h>
#define ls ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define __ <<" "<<
#define loop(m,n) for(m=0;m<n;m++)
#define rloop(m,n) for(m=n-1;m>=0;m--)
#define case(z) "Case " << z++ << ": "
#define yes cout <... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_... | 1 |
#include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; ++ i)
#define Forr(i, j, k) for (int i = j; i >= k; -- i)
using namespace std;
inline int read() {
int x = 0, p = 1; char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') p = -1;
for (; isdigit(c); c = getchar()) x = (x << 1) + (... | #include<bits/stdc++.h>
#define ll long long
#define inf(x) (ll)(1e##x)
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int n,m;
vector<int> v[3];
int main(){
read(n);read(m);
fo... | 1 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"
using namespace std;
const long long int... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#in... | 1 |
#include <cstdio>
#include <cstring>
#include <algorithm>
const int MOD = 998244353;
const int MAXN = 5e5 + 10;
int n, m;
namespace {
inline int add(int x) { return x >= MOD ? x - MOD : x; }
inline int sub(int x) { return x < 0 ? x + MOD : x; }
inline int mul(int x, int y) { return 1ll * x * y % MOD; }
inline ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int K;
string S;
cin >> K >> S;
if(S.size()<=K){
cout << S << endl;
return 0;
}
string T=S.substr(0,K);
T+="...";
cout << T << endl;
}
| 0 |
#include <bits/stdc++.h>
#define clr(x) memset(x,0,sizeof (x))
#define For(i,a,b) for (int i=(a);i<=(b);i++)
#define Fod(i,b,a) for (int i=(b);i>=(a);i--)
#define fi first
#define se second
#define kill _z_kill
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define outval(x) cerr<<#x" = "<<x<<endl
#define ou... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
const int mod = 998244353;
inline int add(int u, int v) {
return u + v >= mod ? u + v - mod : u + v;
}
inline int sub(int u, int v) {
return u >= v ? u - v : u - v + mod;
}
inline int mul(ll u, i... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;
int dp[88][88][14000];
int main(){
int h, w;
cin >> h >> w;
vector<vector<int>> a(h, vector<int>(w)), b(h, vector<int>(... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#defin... | 1 |
#include<stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
int sum = A + B + 1;
char str[sum];
scanf("%s", &str);
int ctr = 0;
for(int i = 0; i < sum; i++){
if(i == A){
if(str[i] != '-'){
printf("No\n");
return 0;
}
}else{
if(str[i] >= '0' && str[i] <= '9'){
++ctr;
}
}
}
i... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace... | 0 |
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2")
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
const ld eps = 1e-9;
const ll MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template <typename T1, typename T2>
void chmax(T1 &a, const T2 &b) {
if(a < b) a = b;
}
te... | 0 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) f... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair <int , int> pii;
const int MAXN = 4e5 + 10 , INF = 202020;
int ans = 1e9;
vector <pii> v[MAXN];
int x[MAXN] , y[MAXN] , t[MAXN];
int tu(char c){
if(c == 'U') return 0;
else if(c == 'R') return 1;
else if(c == 'D') return 2;
... | 1 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 4e5 + 5;
const ll mod = 998244353;
ll fac[N], inv[N];
ll power(ll x, ll y)
{
ll res = 1;
while (y)
{
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
void... | 0 |
// c
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
//定数
#def... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | 1 |
/************************************************************************
* -> Bismillahir Rahmanir Rahim <- *
* *
* *
* ... | #define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <new>
#include <cstdint>
#include <cctype>
#include <cst... | 1 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
using G = vector<map<int, int>>;
void
dfs(int node, ll count, G &arr, vector<bool> seen, vector<long> &to_K)
{
seen[node] = true;... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<vector<int>> tree(N);
vector<int> n_in(N);
for (int i = 0; i < N - 1 + M; i++)
{
int Ai, Bi;
cin >> Ai >> Bi;
Ai--;
Bi--;
tree.at(Ai).push_back(Bi);
n_in.a... | 0 |
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
using namespace std;
int main(void)
{
int wsd[10], ko[10];
for(int i=0; i<10; i++) cin>>wsd[i];
for(int i=0; i<10; i++) cin>>ko[i];
sort(wsd, wsd+10);
sort(ko, ko+10);
... | #include<stdio.h>
int main(void)
{
int W_t[3];
int K_t[3];
int i,p,l,n,m;
int K_p=0,W_p=0;
for(i=0;i<3;i++){
scanf("%d",&p);
W_t[i]=p;
}
for(i=3;i<10;i++){
for(l=0;l<2;l++)
for(m=l+1;m<3;m++){
if(W_t[l]<W_t[m]){
n=W_t[l];
W_t[l]=W_t[m];
W_t[m]=n;
}
}
scanf("%d",&p)... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n,k;
const LL mof=1e9+7;
LL p=mof;
const LL maxn=200007;
inline LL pow_mod(LL a,LL k,LL mo)
{
LL ans=1;
while(k)
{
if(k%2) ans=ans*a%mo;
a=a*a%mo;
k>>=1;
}
return ans%mo;
}
LL jc[maxn+7];
inline LL inv(LL ... | #include <iostream>
#include <cmath>
#include <iomanip>
int main() {
double x1, y1, x2, y2;
std::cin >> x1 >> y1 >> x2 >> y2;
std::cout << std::fixed << std::setprecision(6)
<< std::sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2))
<< std::endl;
}
| 0 |
#include<iostream>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#include<map>
#include... | #include<bits/stdc++.h>
using namespace std;
int n,m,x[100],y[100],i=0,j,k;
double ans,d[205],P=acos(-1);
main(){
cin>>n;m=n;
while(m--)cin>>x[n-m-1]>>y[n-m-1];
for(i=0;i<n;i++){
k=ans=0;
for(j=0;j<n;j++)if(i-j)d[k++]=atan2(y[j]-y[i],x[j]-x[i]);
sort(d,d+k);
for(j=0;j<k;j++)d[j+k]=d[j]+2*P;
for(j=0;j<k;j++... | 1 |
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
char s1[1001],s2[1001];
int ss[1002][1002],u;
cin>>s1>>s2;
for(int i=0;i<=strlen(s2)+1;i++)ss[i][0]=i;
for(int i=1;i<=strlen(s1)+1;i++)ss[0][i]=i;
for(int i=1;i<=strlen(s2);i++){
for(int j=1;j<=strlen(s1);j++){
if(s1[j-1]=... | #include <bits/stdc++.h>
#define R register
#define ll long long
#define sum(a, b, mod) (((a) + (b)) % mod)
const int mod = 1e9 + 7;
const int MaxN = 3e5 + 10;
char s[MaxN];
ll n, f[MaxN][3][3];
void add(ll &a, ll b) {a += b, ((a > mod) ? (a -= mod) : 0); }
int main()
{
f[0][0][0] = 1;
scanf("%s", s + 1)... | 0 |
#include<bits/stdc++.h>
template< typename G >
struct StronglyConnectedComponents {
using UnWeightedGraph=std::vector<std::vector<int>>;
const G &g;
UnWeightedGraph gg, rg;
std::vector< int > comp, order, used;
StronglyConnectedComponents(G &g) : g(g), gg(g.size()), rg(g.size()), comp(g.size(), -1), used(... | #include <stdio.h>
#include <algorithm>
#include <tuple>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int n, m;
vector<int> e[1010];
int v[1010], last[1010];
vector<int> r(2000, 0);
void bfs(int node) {
queue<int> q;
for (int x : e[node])
q.emplace(x), ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 0;
for(int i = 1; i <= n; i++){
if(i % 3 == 0 && i % 5 == 0) {
//FizzBuzz
} else if(i % 3 == 0) {
//Fizz
} else if(i % 5 == 0) {
//Buzz
} else {
ans = ans + i;
... | #include <bits/stdc++.h>
using namespace std;
long long f(long long n, long long x){
long long y = x / n;
if(x < n){
return 0;
} else {
return y * (n + y * n) / 2;
}
}
int main(void){
long long n;
cin >> n;
cout << f(1,n) - f(3,n) - f(5,n) + f(15,n) << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
/*
提出前に確認!
- setとmultisetを間違えない
*/
/*
26進数で考えればいい
*/
void solve(long long num)
{
if (num == 0) return ;
num--;
solve(num / 26);
cout << (char)(num % 26 + 'a');
}
int main(void)
{
long long n;
cin >> n;
solve(n);
cout << endl;
return (0);
}
| #include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
fo... | 1 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define re... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int m;
cin >> m;
vector<int> nodes;
vector<pair<int, int>> child;
int n = 0;
for (int i = 0; i < m; i++){
string q;
cin >> q;
if (q == "insert"){
int k;
cin >> k;
if (n != 0){
int v = 0;
while (1){
... | #include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
struct node{
int key;
node *parent,*left,*right;
};
node *NIL,*root;
void inorder(struct node *u){
if(u==NIL)return;
inorder(u->left);
printf(" %d",u->key);
inorder(u->right);
}
void preorder(struc... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
double n,m,d,l;cin>>n>>m>>d;
l=2*(n-d);
if(d==0)l/=2;
cout<<fixed<<setprecision(15)<<l*(m-1)/n/n<<endl;
} | // AtCoder template
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < n; ++i)
ll memo[15];
const ll MOD = 1e9+7;
ll fib(ll n){
if(n <= 0) return 1LL;
if(memo[n] > 0) return memo[n];
else return memo[n] = (fib(n-1) + fib(n-2))%MOD;
}
int main(){
... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
long minimum = 1000000, maximum = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++){
long a;
cin >> a;
minimum = min(a, minimum);
maximum = max(a, maximum);
sum += a;
}
cout << minimum << " " << maximum << " " << s... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
constexpr int INF = 1 << 30;
constexpr int MOD = 1000000007;
static vector<int> G;
stati... | 0 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
char s[1000001],ss[1000000];
int suu[1000000],cnt[1000000];
int main(void)
{
int i,j,kazu,max=0,len;
scanf("%s",s);
kazu=0;
cnt[kazu]=1;
ss[kazu]=s[kazu];
len=strlen(s);
for(i=1;i<len;i++) {
if(ss[kazu]==s[i]) cnt[... | #include <iostream>
#include<cmath>
using namespace std;
int main()
{
int n,a;
cin>>n;
for(int i=n;i>=1;i--)
{
a=sqrt(i);
if(i%a==0&&i/a==a)
{
cout<<i<<endl;
return 0;
}
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int64_t m = s.size();
vector a(1, 0L);
i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int,int> pii;
#define x first
#define y second
const int N=310,MOD=998244353;
int dp[N][N][N];
int xxm[N][N][N];
int xmp[N][N][N];
#define get(arr) \
int get_##arr(int pos,int ... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
long n,m,p[1001];
while(cin>>n>>m,n||m){
for(int i=1;i<=n;++i) cin>>p[i];
p[0]=0;
vector<long> s(0),t(0);
for(int i=0;i<=n;++i){
for(int j=0;j<=n;++j) s.push_back(p[i]+p[j]);
}
sort(s.begin(),s... | #include<iostream>
using namespace std;
int getDate(int q,int array[]){
int max=0,key=0;
for(int i=0;i<100000;i++){
if(max<array[i]){
max = array[i];
key = i;
}
}
return (max >= q) ? key : 0;
}
int main(){
int n,q;
int array[100000];
while(1){
cin >> n >> q;
if(n+q==0) break;
for(int i=0;i<10... | 0 |
#include <iostream>
using namespace std;
int main(void){
string s;
cin>>s;
int k=0;
for(int i=0;i<s.size();++i){
if(s[i]=='J'){
int JOI[3]={1,0,0};
while(s[i]=='J'){++JOI[0];++i;}
while(s[i]=='O'){++JOI[1];++i;}
while(s[i]=='I'){++JOI[2];++i;}
if(JOI[0]>=JOI[1] && JOI[2]>=JOI[1]){
if(k<JOI[1]) ... | #include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
char c;
bool zf=0;
while(((c=getchar())<'0'||c>'9')&&c!= '-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
int tot[26];
signed... | 0 |
#include<stdio.h>
int main(void)
{
int n,m;
int a[1001],b[1001];
int c[1001],d;
int max;
int i,j;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
c[i]=0;
}
for(i=0;i<m;i++){
scanf("%d",&b[i]);
}
for(i=0;i<m;i++){
for(j=0;j<n;j++){
if(a[j]<=b[i]){
c[j]++;
break;
}
}
}
ma... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
using namespace std;
#define ALL(co) co.begin(), co.end()
typedef long long LL;
... | 1 |
#include <stdio.h>
int main ()
{
int H, W, N;
scanf ("%d", &H);
scanf ("%d", &W);
scanf ("%d", &N);
if (H < W)
{
H=W;
}
if (N % H == 0){
printf ("%d", N/H);
}
else if (N % H != 0){
printf ("%d", (N/H) + 1);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
double ans = 0;
cin >> N >> K;
vector<double> p(N), E(N), sumE(N, 0);
for(int i = 0; i < N; ++i)cin >> p[i];
double bufe = 0;
for(int i = 0; i < N; ++i){
E[i] = (1/p[i])*(p[i]*(p[i]+1)/2);
}
for(int i = 0; i ... | 0 |
#if 1
#include <bits/stdc++.h>
#else
#include "../../bits/stdc++.h"
#endif
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define REP(i,n) FOR(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
using namespace std;
typedef pair<int, int> P;
#define pb push_back
#define ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int m, n1, n2;
while(cin >> m >> n1 >> n2, m || n1 || n2){
int P[201];
for(int i = 0; i < m; i++) cin >> P[i];
int ans = n1;
for(int i = n1; i <= n2; i++){
if(P[ans-1]-P[ans] <= P[i-1]-P[i]) ans = i;
}
cout << ans << endl;
}
re... | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
// 基本的な演算
namespace BasicMath {
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <iomanip>
#define INF 2147483647
using namespace std;
int main()
{
double x1, y1, x2, y2;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x)... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
int N;
cin >> N;
string a, b, c;
cin >> a >> b >> c;
int ans = 0;
for (int ii = 0; ii < N; ++ii){
map<char, int> m;
m[a[ii]]++;
m[b[ii]]++;
m[c[ii]]++;
int ma... | 1 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<pair<int, int>> red;
ve... | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,i... | 1 |
//https://atcoder.jp/contests/abc160/tasks/abc160_b
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
cin>>x;
ll a;
a=x/500;
ll fin1;
fin1=a*1000;
ll b;
b=x%500;
ll c;
c=b/5;
ll fin2;
fin2=c*5;
ll sum=0;
sum=fin1+fin2;
cou... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll X;
cin>>X;
ll a=X/500;
X-=500*a;
cout<<1000*a+5*(X/5)<<endl;
}
| 1 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
ll N,A,B;
int main(){
scanf("%lld %lld %lld",&N,&A,&B);
ll pre,current;
scanf("%lld",&pre);
... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
// Create a boolean a... | 1 |
#include"bits/stdc++.h"
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
int dx[4... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
string ans;
auto move = [&](int h, int w) {
rep(i, abs(h)) ans += (h > 0 ? 'U' : 'D');
rep(i,... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
//using namespace atcoder;
using namespace std;
string transform(string t, ll x, ll y){
for (ll i = 0; i < t.size(); i++){
if (t[i] == 'R' && x < 0){
t[i]... | 1 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>
using namespace std;
#de... | #include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n, a, b;
bool p[10000] = {false};
for( int i = 2; i < 10000; i++ )
{
bool judge = true;
for( int j = 2; j <= sqrt(i); j++ )
if( i % j == 0 )
judge = false;
if( judge == true )
... | 0 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | //Author: AnandRaj anand873
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
for (int i = 0; i < A; i++) cin >> a.at(i);
vector<int> b(B);
for (int i = 0; i < B; i++) cin >> b.at(i);
int ans = *min_element(a.begin(), a.end()) + *min_element(b.begin(), b.end());
for ... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
string str;
int q;
cin >> str >> q;
for (int i = 0; i < q; i++) {
string inst;
unsigned int a,b;
cin >> inst >> a >> b;
if (inst == "print") {
cout << str.substr(a,b-a+1) << endl;
... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
#define fr(i,a,b) for(ll i=a; i<b; i++)
#define rf(i,a,b) for(ll i=a; i>=b; i--)
typedef std::vector<long long > vi ;
#define F first
#define S second
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mod 1000000007
#define PB push_back
#define MP... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typenam... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define LAR(a, b) ((a)=max((a),(b)))
#define SML(a, b) ((a)=min((a),(b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pair<int, i... | #include <stdio.h>
int n, m, l, g, e;
int a[15], b[15];
int x[15][15], y[15][15];
int ans;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
for (int j = 0; j < a[i]; j++) {
scanf("%d%d", x[i] + j, y[i] + j);
x[i][j]--;
}
}
m = 1;
for (int i = 0; i < n; i++) {
m *= 2;
}... | 0 |
#include<bits/stdc++.h>
#define Rint register int
using namespace std;
typedef unsigned long long LL;
const int N = 100003;
int n;
LL a[N], b[61], sum, res;
inline void insert(LL x){
for(Rint i = 60;~i;-- i)
if((x >> i) & 1)
if(!b[i]){
b[i] = x; return;
} else x ^= b[i];
}
int main(){
scanf("%d", &n);
fo... | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
namespace INPUT{
const int L=1<<15;
char _buf[L],*S,*T,c;
char _gc(){
if(S==T){
T=(S=_buf)+fread(_buf,1,L,stdin);
if(S==T) return EOF;
}
return *S++;
}
void readc(... | 0 |
/*
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
*/
#include<bits/stdc++.h>
#define ALL(x) (x).begin(),(x).end()
#define ll long long
#define db double
#define ull unsigned long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace std;
#define Rep(i,a,b) for(ll i = a; i < b; ++i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int n = s.size();
for (int i=0; i<n-1; i++) {
if (s[i] == s[i+1]) {
cout << i+1 << ' ' << i+2 << endl;
return 0;
}
}
for (int i=0; i<n-2; i++) {
if (s[i] == s[i+2]) {
cout << i... | 1 |
#include <stdio.h>
int main(void){
int n, a[100], i, j;
char c, s[53] = {"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"};
while(1){
scanf("%d",&n);
if(!n) break;
for(i = 0;i < n;i++)
scanf("%d",&a[i]);
getchar();
for(i = 0;(c = getchar()) != '\n';i++){
for(j = 0;j < 52;j++){
if(s[j] == c... | #include<iostream>
int main(){
int e;
while(1){
std::cin >> e;
if(!e)break;
int m = 1000001;
for(int i=0;i*i*i<=e;i++){
for(int ii=0;i*i*i + ii*ii<=e;ii++){
int x = e-i*i*i-ii*ii;
int tmp = i+ii+x;
if(tmp < m) m = tmp;
}
}
std::cout << m << std::endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end... | #include <bits/stdc++.h>
const int INF=1e9;
//const int MOD=1e9+7;
const int MOD=998244353;
const long long LINF=1e18;
using namespace std;
#define int long long
//template
std::vector<int> Factorial(5234567),Finverse(5234567);
int pw(int n,int k){
if(k<0)return pw(n,k+MOD-1);
int res=1;
while(k){
if(k&1)res*... | 0 |
// C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") ... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
ll pow[19];
ll dfs(int k, int i, ll dif, ll dif_org){
// if(k == 4) cout << dif << endl;
if(i < k-i+1) return dif == 0 ? 1:0;
if(i == k-i... | 0 |
#include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
if (n % k > 0) {
ans = 1;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long K) {
N%K==0?cout<<0<<endl:cout<<1<<endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long ... | 1 |
//----------------------------templates
#pragma GCC optimize ("Ofast")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
//----------------------------
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
... | #include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << " is " << x << endl
using namespace std;
typede... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define w cout
#define e '\n'
#define int long long
#define sz(x) (int)x.size()
template<class T> inline istream& operator>>(istream& str, vector<T> &a) { for (auto &i : a) str >> i; return str; }
int mod = 998244353;
void solve() {
int n ; cin >> n;
int v[n + 1] = {};
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
int n, m; cin >> n >> m;
vector<ll>x(n), y(m); for (auto&& xx : x)cin >> xx;for (auto&& yy : y)cin >> yy;
sort(x.begin(), x.end());sort(y.begin(), y.end());
ll a = 0, b = 0;
fo... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <tim... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
int main()
{
string s;
int q;
cin >> s >> q;
cin.ignore();
string buf;
while (q)
{
getline(cin, buf);
//cout << "DEBUG:" << buf << endl;
if (buf.find("replace ")... | #include <iostream>
#include <string>
using namespace std;
string reverse_partial(string str, int s, int e) {
string top = s != 0 ? str.substr(0, s - 1) : "";
string head = str.substr(s, e - s + 1);
string tail = str.substr(e + 1, str.size());
string reverse = "";
for (int i=head.size()-1; i >= 0; ... | 1 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, f, n) for (int i = (f); i < (int)(n); i++)
#define repe(i, f, n) for (int i = (f); i <= (int)(n); i++)
using namespace std;
using ll = long long;
using GraphI = vector<vector<int>>;
using GraphC = ve... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9+7;
signed main() {
int N;
cin >> N;
vector<int>cnt(N+1,1);
for(int i = 2; i <= N; i++) {
int X = i;
for(int j = 2; j*j <= i; j++) {
int Y = j;
if(X%Y == 0) {
while(X%... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
string S;
cin >> A >> B >> S;
for(int i=0;i<S.size();++i){
if(i == A){
if(S.at(i) == '-'){
continue;
}else{
cout << "No" << endl;
return 0;
}
}else{
if(S.at(i) == '-'){
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
for(int i=0;i<A+B+1;i++){
char a;
cin >> a;
if((i==A&&a!='-')||(i!=A&&a=='-')){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int dp[3][100010];
int main(){
rep(i,3){
rep(j,100010){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll mod = 1000000007;
const int MAX = 1000100;
int main(){
int n; cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
ll ans = 1;
vector<ll> num(n);
for(int i = 0; ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
rep(i, n) cin >> x[i] >> y[i];
vector<int> perm(n);
rep(i, n) perm[i] = i;
double sum_d = 0;
int k = 0;
d... | #include <iostream>
#include <cstdio>
#include <climits>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#define MAX 200000
#define INFTY 1<<30
using namespace std;
typedef long long llong;
template <typename T>
class Array
{
private:
llong merge(int l, int m, int r)
{... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
int h, w, a, b;
cin >> h >> w >> a >> b;
rep(i, b)
{
rep(j, a) cout << 0;
for (int j = a; j < w; j++)
cout << 1;... | #include <bits/stdc++.h>
using namespace std;
int main(void){
/*
int a, b;
cin >> a >> b ;
//*/
//*
vector<int> vec(3);
cin >> vec.at(0) >> vec.at(1) >> vec.at(2) ;
sort(vec.begin(), vec.end());
//*/
/*
if( a < 6 ){
cout << 0 << endl;
} else if (a ... | 0 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
constexpr ll INFL = 0x3f3f3f3f3f3f3f3fLL;
int main() {
ll n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
#ifdef LOCAL
freopen("inp.txt", "r", stdin );
freopen("ans.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
if(s=="SUN") cout << 7 << '\n';
if(s=="MON") cout << 6 << '\n';
if(s=="TUE") cout << 5 << '\n';
if(s=="W... | 0 |
#include <bits/stdc++.h>
int main() {
unsigned int firstNumber;
unsigned int lastNumber;
std::cin >> firstNumber >> lastNumber;
unsigned int numOfPalindrome = 0U;
for(unsigned int i = firstNumber; i <= lastNumber; ++i) {
std::string forwardNumber = std::to_string(i);
std::stri... | #include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorit... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int s,i,a,b,c;
while(cin>>s,s){
while(s--){
cin>>a>>b>>c;
if(a==100||b==100||c==100||b+c>179||a+b+c>239)cout<<'A'<<endl;
else if(a+b+c>209||(a+b+c>149&&(a>79||c>79)))cout<<'B'<<endl;
else cout<<'C'<<endl;
}}
} | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
void solve() {
int res = N*100;
int n; cin >> n;
vector<int> X(n), Y(n);
string d(n,'?');
for (int i = 0; i < n; i++) {
cin >> X[i] >> Y[i] >> d[i];
}
auto rotate = [&](){
for (int i = 0; i < n; i++) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i =... | #include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cc... | 0 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string>
#include<tuple>
#include<vector>
#include<cstdlib>
#include<cstdint>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
#include<ctime>
#include<climits>
#include<random>
#include<queue>
#include<map>
using namespace std;
tem... | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string s;cin>>s;
string a[7]={"MON","TUE","WED","THU","FRI","SAT","SUN"};
for(int i=0;i<7;i++){
if( s!="SUN" && a[i]==s){
cout<<(6-i);
}
else if(s=="SUN"){
cout<<7;
break;
}
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.... | 0 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
int n;
cin >> n;
string s,t;
cin >> s >> t;
rep(i,n){
int same=n-i;
bool check=true;
rep(j,same){
if(s.at(n-same+j)!=t.at(j)){check=false; brea... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,n_min,n_max,gap,temp=0;
while(1){
cin >> m >> n_min >> n_max;
if(m==0 && n_min==0 && n_max==0){break;}
int P[m+1];
P[0]=-1;
for(int i=1;i<=m;i++){
cin >> P[i];
}
gap=0;
for(int i=n_min;i<=n_max;i++){
if(P[i]-... | #include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, Q; string S;
cin >> N >> S >> Q;
vector<int> dsum(N + 1), msum(N + 1);
for (int i = 0; i < N; ++i) {
dsum[i + 1] = dsum[i] + (S[i] == 'D' ? 1 : 0);
... | 0 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
int N;
cin >> N;
int sum = 0;
double ave = 0;
double mini = 100;
double aa = 0;
int ans = 0;
vector<int> a(N);
for(int i = 0;i < N;i++){
cin >> a.at(i);
sum += a.a... | 1 |
#include <cstdio>
#include <bitset>
#include <cmath>
#include <complex>
#include <vector>
#include <algorithm>
#include <stack>
#include <iostream>
#include <sstream>
#define EPS 1e-6
using namespace std;
typedef complex<double> coor;
double cross(coor a, coor b)
{
return a.real() * b.imag() - a.imag() * b.real();
... | #include <iostream>
#include <cctype>
#include <string>
using namespace std;
string tar[] = { "the", "this", "that" };
int main()
{
string in;
while (getline(cin, in))
{
string ans;
for (int i=0; i<26; i++)
{
ans = in;
for (int k=0; k<ans.size(); k++)
{
if (islower(ans[k]))
{
int r = i ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define Abigail inline void
typedef long long LL;
const int N=15,INF=(1<<30)-1;
int n,m,e[N+9][N+9],sum;
int a[(1<<N)+9];
void Get_a(){
for (int g=1;g<1<<n;++g)
for (int i=0;i<n;++i){
if (g>>i&1^1) continue;
for (int j=i+1;j<n;++j)
if (g>>j&1) a[g]... | #include<bits/stdc++.h>
using namespace std;
inline int read()
{
char ch=getchar(); int f=1,x=0;
while (ch<'0' || ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
while (ch>='0' && ch<='9') { x=x*10+ch-'0'; ch=getchar(); }
return f*x;
}
int n,m,a,b,c,sum,dis[17][17],v[1<<15],f[1<<15][17];
signed main()
... | 1 |
#include <stdio.h>
int main(){
int H, W, N, res;
scanf("%d", &H);
scanf("%d", &W);
scanf("%d", &N);
if(H>W){
res = N/H;
N%H > 0? res+=1 : res=res;
}
else{
res = N/W;
N%W > 0? res+=1 : res=res;
}
printf("%d\n", res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
ll n, x; cin >> n >> x;
vector<ll> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = 0;
for(int i = 0; i < n-1; i++){
if(a[i] > x){
ll tmp = a[i] - x;
an... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
string s;
cin >> s;
int ans = 0;
bool ok = true;
rep(i, 3)
{
if... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>... | 0 |
#include<iostream>
#include<cctype>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cctype>
#include<cstring>
#include<utility>
const int inf=0x7fffffff;
typedef long long int ll;
using namespace std;
const int N=100+5;
char s[... | #include<string>
#include<iostream>
using namespace std;
class Dice{
int dn[6];
int ori[6];
int up, front;
string qu;
public:
Dice(int d1, int d2, int d3, int d4, int d5, int d6){
dn[0] = d1;
dn[1] = d2;
dn[2] = d3;
dn[3] = d4;
dn[4] = d5;
dn[5] = d6;
ori[0] = d1;
ori[1] = d2;
ori[2] = d3;
... | 1 |
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#define re(c, b) for(ll c=0;c<b;c++)
using namespace std;
int main() {
int h, w;scanf("%d %d", &h, &w);
ve... | #include<bits/stdc++.h>
#define ll int
#define ld long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace :: std;
const ll maxn=2010;
char jad[maxn][maxn];
ll ava[maxn];
ll l[maxn];
ll r[maxn];
ll finds(ll n){
stack<ll> stk;
for(ll i=0;i<n;i++){
while(!stk.empty(... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.