code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODAD... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | 0 | 50,749,100 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(_) cerr << #_ << ": " << (_) << '\n'
#define _GLIBCXX_DEBUG
#else
#define debug(_) 0
#endif
vector<long long> as(1, 1);
vector<long long> ps(1, 1);
long long solve(long long level, long long x){
if (level == 0) {
return x;
} else ... | #include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
#define ll long long int
int main(){
int n;
cin>>n;
vector<int> v(n+2);
v[0]=0;
rep(i, n) cin>>v[i+1];
v[n+1]=0;
vector<int> diff(n+1);
rep(i, n+1){
diff[i]=abs(v[i+1]-v[i... | 0 | 58,598,886 |
#include <bits/stdc++.h>
#define MAX 200005
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int mn = MAX, ans = 0;
for (int i = 0; i < n; ++i) {
int p;
cin >> p;
if (mn > p) {
mn = p;
++ans;
}
}
cout << ans ... | #include<bits/stdc++.h>
using namespace std;
#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) (x).begin(),(x).end()... | 0 | 47,857,508 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m; cin >> n >> m;
for (int i = 1, j = m + 1; i < j; i++, j--)
cout << i << ' ' << j << '\n';
for (int i = m + 2, j = m + m + 1; i < j; i++, j--)
cout << i << ' ' << j << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 93,997,241 |
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bit... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 95,872,804 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] =... | 0 | 34,014,470 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s,t;
cin >> s >> t;
int ans=0;
rep(i,s.length()){
if(s[i]!=t[i])
ans ++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl... | 0 | 38,854,945 |
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL N;
string S;
cin >> N >> S;
LL R = count(begin(S), end(S), 'R');
LL ans = 0;
for(auto g=0; g<N; ++g) {
for(auto b=0; b<N; ++b) {
if(S[g] != 'G') continue;
if(S[b] != 'B') continue;
ans += R;
auto d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1000000007;
const ll INF = 1e18;
int ctoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
return 0;... | 0 | 92,711,597 |
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define FAST ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define SZ(a) (int)a.size()
#define Flush fflush(stdout);
typedef long long ll ;
using namespace st... | #include <cstdio>
#include <algorithm>
using namespace std;
typedef pair<char,int> pci;
int N;
pci A[100], B[100], C[100];
void print(pci X[]) {
for (int i=0; i<N; i++) {
if (i > 0) putchar(' ');
printf("%c%d", X[i].first, X[i].second);
}
putchar('\n');
}
bool same(pci X[], pci Y[]) {
for (int i=0; i<N;... | 0 | 59,525,298 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,sum=0;
cin >> n;
for(int i=1;i<=n;i++){
sum+=i;
if(sum>=n) break;
}
a=sum-n;
for(int i=1;i<=n;i++){
sum-=i;
if(a==i) continue;
cout << i << endl;
if(sum==0) break;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
map<int, int> e, o;
for (int i = 0; i < n; i += 2) {
if (e.count(v[i]) == 0) e[v[i]] = 0;
... | 0 | 48,942,487 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#... | 0 | 20,565,061 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int cnt[4]={0,0,0,0};
for(int i=0;i<3;i++){
int a,b; cin>>a >>b;
a--; b--;
cnt[a]++; cnt[b]++;
}
for(int i=0;i<4;i++){
if(cnt[i]>2){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int n, m; cin>>n>>m;
vector<int> h(n);
forin(h, n);
vector<boo... | 0 | 83,432,753 |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
/*
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int xdif = abs(x1 - x2), ydif = abs(y1 - y2);
... | #include <iostream>
#include <string>
#include <cmath>
#include <set>
#include <utility>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cstdio>
#include <cstring>
using namespace std;
constexpr long long mod = 1000000007;
constexpr double eps = 0.000... | 0 | 40,855,582 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){... | #include<iostream>
#include<algorithm>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
int main()
{
int a,b,c;
int D;
cin >> a >> b >> c >> D;
if(abs(a - c) <= D)
{
cout << "Yes";
}
else if(abs(b - a) <= D && abs(c - b <= D))
{
cout << "Yes";
... | 0 | 70,653,885 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd(a,b) __gcd(a,b)
#define endl '\n'
const int N=2e5+10;
const int inf=1e9;
const int mod=1e9+7;
vector<int>adj[N];
bool vis[N];
int dis[N];
int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
if (n > m) {
swap(n, m);
}
if (n == 1 && m == 1) {
cout << 1 << '\n';
}
else if (n == 1) {
cout << m - 2 << '\n';
}
else if (n ... | 0 | 58,627,813 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int n=s.size();
if(t.size()!=n+1){
cout<<"No"<<endl;
return 0;
}
for(int i=0;i<n;i++){
if(s[i]!=t[i]){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<en... | #include <iostream>
using namespace std;
class priorityQueue {
private:
long *queueArray;
long size;
public:
priorityQueue() {
this->queueArray = new long[2000001];
this->size = 0;
}
void insert(long num) {
this->queueArray[size+1] = num;
size++;
heapfyInsert(... | 0 | 74,403,763 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:ve... | 0 | 11,868,537 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#define ll long long
#define pb push_back
#define x first
#define ld long double
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... | 0 | 64,105,610 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <cstdlib>
#include <cctype>
#include <ctime>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <utility>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include... | #include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 1 << 18;
vector <pair <int, int> > s;
int a[N];
int n;
void dbg() {
for (int j = 0; j < (int) s.size(); ++ j)
printf("(%d, %d) ", s[j].first, s[j].second);
puts("");
}
bool plus(int lim) {
int i;
for (i = (int) s.size() -... | 0 | 88,926,411 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 20,457,484 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <cstdio>
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
using namespace std;
int main(){
string str;
int size,h;
cin >> str;
size = str.size();
string mozi[size],ans = "";;
for(int i = 0;size > i;i++){mozi[i] = str.substr(i,1);}
for(int i = 1;size >= i;i+... | 0 | 2,404,514 |
#include<iostream>
using namespace std;
int main(void){
int d;
int sum;
int x_now;
cin >> d;
while(!cin.eof()){
sum = 0;
x_now = 0;
for(int i=600;i!=0;){
sum += x_now*x_now*d;
i -= d;
x_now += d;
}
cout << sum << endl;
cin >> d;
}
return 0;
} | #include<cstdio>
#include<cctype>
#include<map>
using namespace std;
int read()
{
int f,c,x;
while(!isdigit(c=getchar())&&c!='-'); c=='-'?(f=1,x=0):(f=0,x=c-'0');
while(isdigit(c=getchar())) x=(x<<3)+(x<<1)+c-'0'; return f?-x:x;
}
int h,w,n,X,Y;
long long ans[11];
map<pair<int,int>,int>ma;
int main()
{
h=read(); w=... | 0 | 69,486,240 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define PB push_back
#define INF 1000000001
#define INFL 1000000000000000001
#define M 1000000007
string s;
ll n,k;
vector<ll>q;
int main(void){
cin>>s>>k;
n=s.size();
ll l=1;
for(int i=1;i<=n;i++){
if(i==n||s[i-1... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define mp make_pair
#define ld long double
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int> > small_heap;
typedef priority_queue<int> big_heap;
const int N = 1e6 + 100... | 0 | 14,169,998 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
ll d;int id;
}c[100005];
bool cmp(node x,node y){return x.d>y.d;}
int fa[100005],siz[100005],deep[100005];
ll d[100005];
vector<int>to[100005];
void dfs(int x){for(auto tar:to[x])deep[tar]=deep[x]+1,dfs(tar);}
int main()
{
int n;
... | 0 | 46,721,767 |
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 33,265,889 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector<int> hill(10);
for(int i=0; i<10; i++) cin >>hill[i];
sort(hill.begin(),hill.end());
for(int i=9; i>6; i--) cout <<hill[i]<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
int main(){
ll n,d,a ;
cin >> n >> d >> a ;
vector<pll> enemy(n) ;
for(int i=0;i<n;i++) cin >> enemy.at(i).fi... | 0 | 56,409,180 |
#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s;
cin>>s;
map<char,int>m;
for(int i=0;i<s.size();++i){
if(m[s[i]]>0){
cout<<"no";
return 0;
}
++m... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)
#define risi (0.05)
using namespace std;
int... | 0 | 52,170,804 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
vector<ll>a(60,1);
vector<ll>p(60,1);
ll f(ll x,ll level){
if(level==0)return (x<=0?0:1);
if(x==1)return 0;
else if... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int k,s;
int ans = 0;
cin >> k >> s;
for(int i=0;i<=k;i++) {
for(int j=0;j<=k;j++) {
int z=s-i-j;
if(0<=z && z<=k) ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 58,381,683 |
#include <cstdio>
typedef long long ll;
const int MAXN = 1000;
ll X[MAXN + 5], Y[MAXN + 5]; int N;
ll abs(ll x) {
return x >= 0 ? x : -x;
}
int main() {
scanf("%d", &N);
for(int i=1;i<=N;i++)
scanf("%lld%lld", &X[i], &Y[i]);
int type = ((X[1] + Y[1]) & 1);
for(int i=1;i<=N;i++) {
if( type != ((X[i] + Y[i]) & 1... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
int main(void){
cin >> s;
lli ans = 0;
rep(i, s.size()-1){
if(s[i] != s[i+1]) ans++;
}
cout << ans << endl;
return 0;
} | 0 | 49,190,418 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,x,t,m,a;
cin >> n >> x >> t;
a = n/x;
if(n%x != 0)a++;
m = a * t;
cout << m << endl;
} | #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;
const int mod = 1e9+7;
int main(){
int n;
cin >> n;
vector<ll> t(n),a(n);
rep(i,n) cin >> t[i];
rep(i,n) cin >> a[i];
vector<ll> l(n,0),r(n,0)... | 0 | 92,947,278 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#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>,int>;
template<typename A, size_t N, typename T>
vo... | #include <iostream>
using namespace std;
#define MAX 100000+5
#define NIL -1
struct Node {
int parent;
int left;
int right;
};
Node T[MAX];
int n, D[MAX];
void Print( int u );
int Rec( int u, int p );
int main() {
cin >> n;
for ( int i = 0; i < n; ++i ) T[i].parent = T[i].left = T[i].right = NIL;
... | 0 | 33,363,358 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return t... | #include <iostream>
#include <string>
using namespace std;
typedef long long LL;
void findzero() {
int ret = 1;
for (int i = 2; 2*i/2 == i; i *= 10) {
cout << "? " << i << endl;
string s;
cin >> s;
if (s == "Y") {
break;
}
else ret *= 10;
}
cou... | 0 | 44,699,060 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | #include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
while (1) {
int m, nmin, nmax;
scanf("%d%d%d", &m, &nmin, &nmax);
if (m == 0 && nmin == 0 && nmax == 0) break;
int P[m];
for (int i = 0; i < m; ++i) {
cin >> P[i];
}
sor... | 0 | 88,896,270 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M;
cin>>A>>B>>M;
vector<int>a(A);
vector<int>b(B);
for(int i=0;i<A;i++){
cin>>a.at(i);
}
for(int i=0;i<B;i++){
cin>>b.at(i);
}
vector<int>x(M);
vector<int>y(M);
vector<int>c(M);
for(int i=0;i<M;i++){
cin>>x.at(i)>>y.a... | #include<bits/stdc++.h>
using namespace std;
#define next Next
#define last Last
#define int long long
const int N=1e6+5;
int n,a[N],sum[N];
#define gc getchar
inline int read()
{
int ret=0,f=0;char c=gc();
while(!isdigit(c)){if(c=='-')f=1;c=gc();}
while(isdigit(c)){ret=ret*10+c-48;c=gc();}
if(f)return -ret;return ... | 0 | 54,597,504 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;... | #include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
ll M = 998244353;
ll modpow(ll a, ll n, ll mod) {
... | 0 | 28,734,086 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using nam... | #pragma GCC target ("avx2")
#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define input(a,n) for(ll i1=0;i1<n;i1++)cin>>a[i1]
#define ll long long
#define pi 2 * acos(0.0)
#define usll unordered_set<ll>
#define sll set<ll>
#define vll vec... | 0 | 38,832,386 |
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
int main()
{
string s,t;
cin>>s; cin>>t;
int inx=0;
for(int i=0;i<s.size();i++)
{
int flg=1;
for(int j=0;j<t.size();j++... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,b)for(long long i=a;i<b;++i)
#define rrep(i,a,b)for(int i=a;i>=b;--i)
#define yesno(flag)if(flag)cout<<"Yes"<<endl; else cout<<"No"<<endl;
using namespace std;
const ll INF=100000000000000LL;
const ll r197=1000000007;
typedef pair<ll,ll>P;
typedef pair<i... | 0 | 44,783,641 |
#include <iostream>
#include <fstream>
#include<bits/stdc++.h>
using namespace std ;
using ll = long long ;
class BBreakNumber {
public:
void solve(std::istream& cin, std::ostream& cout) {
int n ;
cin >> n ;
int ans = 0 ;
for(int i = n ; i>=0 ; --i){
if(i && (!(i & (i - 1)))){
... | #include<iostream>
#include<cstring>
using namespace std;
int H, W;
int grid[105][105], memo[105][105][2];
int findRoute(int row, int col, int black){
if(memo[row][col][black] != -1) return memo[row][col][black];
if(grid[row][col] == 1){
if(row == H && col == W) return black;
if(row == H) return... | 0 | 88,086,597 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int X, A, B; cin >> X >> A >> B;
if (A < B)
cout << (X < B - A ? "dangerous" : "safe") << endl;
else
cout << "delicious" << endl;
} | #include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <cstdio>
using namespace std;
#define prev prev55
long long n, t[50000], v[50000];
long long scale[50000];
int main()
{
fill(scale, scale + 50000, 1000000000000);
ios_base::sync_with_stdio(false);
cin.tie(0);
... | 0 | 57,632,177 |
#include<iostream>
#include<string>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<cmath>
using namespace std;
#define pi 3.141592653589793283462
int main(){
int n;
cin>>n;
int max;
int min;
long sum;
int a[10000];
cin>>a[0];
sum=a[0],max=a[0],min=a[0];
for(int i=1;i<=n-1;i++){
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x=0 ,y=0,m,n,i,j,k;
cin >> n >> m;
string s;
map<int,int>mp,mp1;
for(i = 0 ;i<m ;i++)
{
cin >> k >>s;
if(s == "AC" && mp1[k]==0)
{
x++;y+=mp[k];
mp1[k]=1;
}
else
mp[k]++;
... | 0 | 52,700,990 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<vector<char>> A(N, vector<char>(N));
vector<vector<char>> B(M, vector<char>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) cin >> A.at(i).at(j);
}
for (int i = 0; i < M; i++) {
... | 0 | 77,350,576 |
#include<iostream>
#include<vector>
#include<math.h>
using namespace std;
int main(){
int N,D;
cin>>N>>D;
vector<vector<int>>X(N,vector<int>(D));
for(int i=0;i<=N-1;i++){
for(int j=0;j<=D-1;j++){
cin>>X[i][j];
}
}
int ansint=0;
double ansdouble=0;
int distance=0;
int ans=0;
for(int i=0... | #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | 0 | 80,521,743 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main()
{
int n, k;
cin >> n >> k;
ll ans ... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define s... | 0 | 98,666,872 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | #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<ll, ll>;
const long double PI = acos(... | 0 | 88,335,616 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define mp make_pa... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a.at(i);
long long ans=0, count=0, num;
rep(i,n-1){
for(int j=n-1; j>i; j--) if(a.at(i)>a.at(j)) ans++;
}
... | 0 | 31,101,231 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,k; cin>>a>>b>>k;
vector<int> div(200);
int cnt=1;
for(int i=min(a,b);i>=1;i--) {
if(a%i==0&&b%i==0) {
div[cnt]=i;
cnt++;
}
}
cout<<div[k]<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll k,a,b;
ll ans=1;
cin >> k >> a >> b;
if(b-a > 2){
int kaisu = max((ll)0,(k-(a-1))/2);
int tataku = k - kaisu*2;
ans = kaisu*(b-a) + tataku + 1;
... | 0 | 9,091,213 |
#include<stdio.h>
int main(){
int c,a,b;
scanf("%d%d",&a,&b);
if(a<b){
printf("a < b\n");
}
else if(a>b){
printf("a > b\n");
}
else if(a==b){
printf("a == b\n");
}
return 0;
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | 0 | 42,982,989 |
#include <bits/stdc++.h>
using namespace std;
#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(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
template<class T> inline bool chmax(... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr <... | 0 | 90,937,967 |
#include <climits>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
class NumberString {
public:
static UInt Digits(Int number) {
return to_string(number).length();
}
};
int main(void) {
Int n;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 0 | 82,680,560 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#de... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)==2)
{
if(a<b)
{
cout<<"a < b"<<endl;
}
else if(a>b)
{
cout<<"a > b"<<endl;
}
else
{
cout<<"a == b"<<endl;
}... | 0 | 43,839,813 |
#include<bits
using namespace std;
typedef long long ll;
#define req(i,n) for(int i = 1;i <= n;i++)
#define ALL(a) (a).begin(),(a).end()
ll n,m, ans = 0;
int main() {
cin >> n >> m; priority_queue<int> pq; int a, b,j =0;
vector<pair<int, int>> v;
req(i, n) {
cin >> a >> b;
v.push_back(make_... | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
string S;
cin >> S;
map<char, int> list;
for (int i = 0; i < S.size(); i++)
list[S[i]]++;
bool x = true;
for (auto y = 'a'; y <= 'z'; y++... | 0 | 35,058,515 |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<set>
using namespace std;
int a[10000000];
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(),(a).end()
#define ALL(a,n) (a),(a)+n
#define vi vector<long long>
#define vd vector<long double>
#define vs vector<string>
#define INF 1010000000000000017LL
#define MOD 1000000007LL
#define EPS 1e-12
#define PI 3.14159265... | 0 | 100,175,643 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<pair<int,int>>> data(n+1,vector<pair<int,int>>(0));
for (int i=1;i<=m;i++){
int p,y;
cin>>p>>y;
pair<int,int> tmp=make_pair(y,i);
data.at(p).push_back(tmp);
}
for (int i=1;i<=n;i++){
sort(data.at(... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
const int nmax = 1000;
char table[nmax][nmax];
int bfs(int H,int W){
queue<P> q;
P pos;
int n_x,n_y,x,y,count1,count2,ans;
int direction[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
count1 = 0;
count2 = 0;
ans = 0;
for(int y =... | 0 | 83,944,607 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define int long long
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
#define FOR(i,n) for((i)=(0);(i)<(n);(i)++)
#define RFOR(i,n) for((i)=((n)-1)... | #include <cstdio>
#include <set>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
#define ll long long
const ll N = 1000000000;
int main(){
int h, w;
cin >> h >> w;
vector<vector<int> > ar(h), dp(h);
for (int i = 0; i < h; ++i) {
d... | 0 | 41,350,377 |
#include<bits/stdc++.h>
using namespace std;int n,i,j,k[9999999];main(){scanf("%d",&n);for (i=0; i<n;i++){scanf("%d",&k[i]);}sort(k,k+n);for (i=0;i<n;i++){if(i){printf(" ");}printf("%d",k[i]);}printf("\n");} | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<queue>
#include<map>
#include<functional>
#include<cstring>
using namespace std;
int main() {
int n,k;
int num[100001] = {0};
while(scanf("%d%d",&n,&k),(n|k)){
memset(num,0,sizeof(num));
for(int i = 0; i < n; i++)... | 0 | 36,140,777 |
#define DEBUG
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define IOS { ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#ifdef... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 0 | 83,440,562 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char c;
cin>>c;
string ans = "consonant";
if(c=='a'||c=='i'||c=='u'||c=='e'||c=='o'){
ans = "vowel";
}
cout<<ans<<endl;
} | #include <iostream>
using namespace std;
int main() {
while(true) {
string s;
cin >> s;
if (s == "-")
break;
int count;
cin >> count;
for (int i = 0; i < count; i++) {
unsigned long h;
cin >> h;
s = s.substr(h) + s.subst... | 0 | 93,275,219 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <tuple>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b... | #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | 0 | 81,825,785 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
int main(){
int num,tmp,money=100000;
cin>>num;
for(int i=0;i<num;i++){
money*=1.05;
tmp=money%1000;
if(tmp>0) money=money-tmp+1000;
}
cout<<money<<end... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int S = (1 << 17);
ll k, tab[S], min_p, max_p;
int main(){
cin >> k;
for (int i = 1; i <= k; i ++)
cin >> tab[i];
min_p = max_p = 2;
for (int i = k; i >= 1; i --){
min_p = ((min_p - 1) / tab[i] + 1) * tab[i];
max_p = max_p / tab[i] * ta... | 0 | 26,928,922 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3000 + 50;
const int mod = 1e9 + 7;
int n,k;
int h[N];
ll dp[N][N];
int main()
{
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", h + i);
if (n == k)
{
puts("0");
return 0;
}
... | 0 | 19,612,930 |
#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 <algorithm>
#include <bitset>
#inc... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
ll n;
cin >> n;
int s = sqrt(n) + 1;
while (s--)
{
if (n % s == 0)
{
cout << s + (n / s) - 2 << endl;
re... | 0 | 94,107,981 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int d[26] = { 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 };
while( true ) {
string in;
cin >> in;
if ( in == "#" ) break;
long long int h = d[ in[0] - 'a' ];
long long int ans = 0;
for (... | #include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const... | 0 | 73,833,735 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.sync_with_stdio(false);
cin.tie(0);
long long int n, a1, b;
cin >> n >> a1 >> b;
int flag = 0;
if(n == a1){
if(b == 1){
for(int i = 0; i < n; i++){
cout << i+1 << " ";
}
cout << '\n';
return 0;
}
else{
flag = 1;
}
}
if(n == ... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
ll COM(int n, int k) {
ll res = 1;
if (n < k) return 0;
if... | 0 | 56,901,737 |
#include <iostream>
using namespace std;
int main(void){
int n;
int b, f, r, v;
int count[4][3][10];
for(int i=0;i<4;i++)
for(int j=0;j<3;j++)
for(int k=0;k<10;k++)
count[i][j][k]=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>b>>f>>r>>v;
count[... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
ll n,k,t,d;
cin>>n>>k;
vector<pair<ll,ll>> A,B,C;
int var[200001]={0};
rep(i,n) cin>>t>>d,A.push_back(make_pair(d,t));
sort(A.begin(),A.end(),greater<pair<ll,ll>>());
rep(i,k)... | 0 | 57,951,392 |
#include <iostream>
#include <vector>
#include <unordered_map>
#include <numeric>
using namespace std;
int main() {
long n,x,m;
cin >> n >> x >> m;
int k = log2(n) + 1;
vector tb(k+1, vector(m, -1LL));
vector sum(k+1, vector(m, 0LL));
unordered_map<long,bool> mp;
for (long i=0; i<m; i++) tb[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a,b) for(ll i=(a);i<(b);++i)
#define minv(v) *min_element(... | 0 | 16,449,040 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
bool ok = true;
if (s[0] != 'A') ok = false;
rep(i,26) if (s[1] == 'A' + i || s[n-1] == 'A' + i) ok = false;
string t = s.substr(2,n-3);
int cnt = 0;
rep(i,t.size(... | #include <bits/stdc++.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9+7;
Int INF = 1e18;
double EPS = 0.00000001;
int main() {
Int n;
cin >> n;
string s;
cin >> s;
vector<bool> t(n);
t[0] = true;
if (s[0] == 'o'... | 0 | 73,916,924 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <map>
#include <vector>
#include <iomanip>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
B += A / 2;
A /= 2;
} else {
A += B / 2;... | #include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP_R(i, n) for (long long int i = (n - 1); i >= 0; --i)
#define ALL... | 0 | 22,813,243 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int INF = 100000000;
int main(void) {
map<char, int> key;
key['q'] = 0;
key['w'] = 0;
key['e'] = 0;
key['r'] = 0;
key['t'] = 0;
key['a'] = 0;
key['s'] = 0;
key['d'] = 0;
key['f'] = 0;
key['g'] = 0;
key['z'] = 0;
key['x'] = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void connect(ll n, vector<pair<ll, ll>> &edges, ll total) {
ll cnt = 0;
for (ll i = 1; i < n - 1; i++) {
for (ll j = i + 1; j < n; j++) {
if (cnt == total) return;
edges.push_back(make_pair(i, j));
cnt++;
}
}
}
int main(... | 0 | 53,454,614 |
#include <cstdio>
#include <map>
using namespace std;
int n;
int s;
int main() {
while (1) {
scanf("%d%d", &n, &s);
if (n == 0 && s == 0) return 0;
int lim = 1 << 10;
int ans = 0;
for (int i=0; i<lim; i++) {
int sum = 0;
int cnt = 0;
for (int j=0; j<10; j++) {
if (i >> j ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const ll MOD = 1000000007;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_ve... | 0 | 42,913,386 |
#include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> v... | #include <iostream>
using namespace std;
int main(){
int N, A, B, C, X;
while(cin >> N >> A >> B >> C >> X, N+A+B+C+X){
int Y[N], time = -1, ran = X;
for(int i = 0; i < N; ++i){
cin >> Y[i];
}
int j = 0;
while(time <= 10000 && j != N){
++time;
if(ran == Y[j]) ++j;
ran = (A * ran + B) % C;
}
... | 0 | 22,333,592 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <functional>
#include <set>
#include <numeric>
#define ll long long int
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
ll N, nx, e, ecnt, a, con = 0;
cin >> N;
nx = N;
for (ll i = 2; i*i <... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <ioman... | 0 | 46,394,154 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#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--)
#define FORA(i,I) for(const auto& i:I)
#define ... | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a,... | 0 | 22,970,584 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using pint = pair<int,int>;
int main(){
int H,W; cin>>H>>W;
vector<string> S(H);
rep(i,H)ci... | 0 | 25,851,727 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = int_fast64_t;
using pll = pair<ll,ll>;
constexpr ll INF = 1LL<<60;
constexpr ll MOD = 1e9+7;
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,int>;
const ll INF = 1ll<<60;
int main() {
int n, m; cin >> n >> m;
vector<vector<P>> G(n);
for (int i = 0; i < m; i++) {
int r, l; ll d;
cin >> r >> l >> d;
r--; l--;
G[l].push_back(P(d,r)... | 0 | 4,805,807 |
#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(_... | #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>;
double check_dist(int *x, int *y, int d) {
int root;
double v = 0;
rep(i, d) v += (x[i] - y[i]) * (x[i] - y[i]);
root = int(sqrt(v));
return root * root == v;
}
... | 0 | 27,168,259 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define OUT(x) cout << (x) << endl;
#define OUTA(a, n) \
REP(i, n) { cout << (a[i]) << (i == n - 1 ? "\n" : " "); }
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
using ll = long long;
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define ... | 0 | 2,625,800 |
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void) {
int n, l, i, a[100003], mt;
scanf("%d... | #include <iostream>
using namespace std;
int main(){
string keys[] = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
int n;
string s;
int kind;
int cur;
cin >> n;
for( int lp=0;lp<n;lp++ ){
cin >> s;
cur=-1;
for( unsigned in... | 0 | 19,216,630 |
#include <stdio.h>
int main(void){
int yoko,tate;
int kari1,kari2;
while(1){
scanf("%d %d",&tate,&yoko);
if(yoko == 0 && tate == 0){
break;
}else{
kari1 = 0,kari2 = 0;
for ( kari1 = 0; kari1 < tate; kari1++ ){
for ( kari2 = 0; kari2 < yoko; kari2++ ){
printf("#... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int N;
while(cin>>N,N){
int money[6]={500,100,50,10,5,1},ans=0;
N=1000-N;
for(int i=0;i<6;i++){
while(N-money[i]>=0) N-=money[i],ans++;
}
printf("%d\n",ans);
}
return 0;
} | 0 | 78,580,910 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define pb push_back
const long double PI = acos(-1);
const long long INF = (1 << 30);
ll gcd(ll a,ll b){return b ? gcd(b,a%b... | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
ll a[52];
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = 0;
while(true){
int l = 0;
for(int i = 1; i < n; i++){
if(a[i] > a[l]) l = i;
}
if(a[l] < n) break;
... | 0 | 41,744,334 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll N=1e6+1;
ll gcd(ll a,ll b){
if (a == 0)
return b;
return gcd(b % a, a);
}
ll fact[N];
bool prime[N];
void sieve(){
for(ll i=2;i<N;i++){
if(prime[i]==true){
for(ll j=i*i;j<=N;j+=i){
... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 52,916,245 |
#include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int)n;i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it... | #include <stdio.h>
#define MAX 100001
typedef struct{
int parent;
int left;
int right;
int id;
}Node;
Node T[MAX];
int main(){
int l,k,n,i,j,count=0;
int flag=0;
int id;
for(i=0;i<MAX;i++){
T[i].parent=-1;
T[i].left=MAX;
T[i].right=MAX;
T[i].id=0;
}
scanf("%d",&n);
for(i=0;i<n;i++)... | 0 | 50,744,719 |
#include "iostream"
#include "string"
int main()
{
int n, x;
int val = 0;
while (true) {
std::cin >> n >> x;
if ((n + x) == 0)
break;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
for (int k = j + 1; k <= n; k++) {
if ((i + j + k) == x)
val++;
}
}
}
std::cout... | #pragma GCC optimize("trapv")
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
const int maxn = 1<<20, mod = 924844033;
int n, a[maxn];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for(int i = 1; i <= n; i++) c... | 0 | 95,385,747 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int MOD = 1000000007;
double PI = 3.14159265358979323846;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 110;
char s[N][N];
int n, m;
int dp[N][N];
int main() {
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; ++i)
scanf("%s", s[i] + 1);
dp[1][1] = s[1][1] == '#';
for(int i = 1; i <= n; ++i) {
f... | 0 | 72,010,289 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | 0 | 28,400,605 |
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int a = 0, b = 0, c = 0;
std::cin >> a >> b >> c;
std::set<int> cans = {a, b, c};
std::cout << cans.size() << std::endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lld long double
#define w(x) ll x;cin>>x;while(x--)
#define mod 1000000007
#define speed ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main(){
speed;
ll n; cin>>n;
vector<ll> a(n); for(auto &i:a)... | 0 | 12,598,167 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define rep2(x,from,to) for(int x=(from);x<(to);++(x))
#define rep(x,to) rep2(x,0,to)
int n;
double pi = acos(-1);
void koch(double xl, double yl, double xr, double yr, int depth) {
if(depth == n) {
printf("%.8lf %.8lf\n", xr, yr);
return;... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 18,804,569 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | 0 | 59,191,857 |
#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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define per(i,n) for(int i = (n)-1; i >= 0; --i)
#define rng(i,a,b) for(int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main() {
int... | 0 | 1,867,286 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int n;
cin >> n;
cout << (n-2)*180 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | 0 | 58,255,623 |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include<iostream>
#define _USE_MATH_DEFINES
#include<math.h>
#include<vector>
#include<array>
#include<algorithm>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<d... | 0 | 34,268,362 |
#include <bits/stdc++.h>
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
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) {... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 9,927,290 |
#include <iostream>
#include<vector>
using namespace std;
int main(void){
int n;
cin >> n;
string s;
cin >> s;
vector<int> v(26,1);
for(int i = 0;i < s.size();i++){
v[s[i] - 'a']++;
}
long ans = 1;
for(int i = 0;i < v.size();i++){
ans = ans *... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | 0 | 81,547,163 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1L... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N + 1);
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.at(tmp)++;
}
sort(A.begin(), A.end());
int ans = 0;
for (int i = 0; i < N + 1; i++) {
if (A.at(i) == 0) {
continue;
}
... | 0 | 97,030,739 |
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0;i<ll(n); i++)
int main(){
int A[3][3];
int B[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin >> A[i][j];
B[i][j] = 0;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
long gcd(long a, long b)
{
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main()
{
int a ,b,k;
cin >> a >> b >> k;
int max = gcd(a, b);
int i = max;
int cnt = 0;
while (i > 0... | 0 | 59,170,736 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
int n; cin >> n;
ll H[n];
rep(i,n) cin >> H[i];
if(n==1){
cout << 0 << endl;
return 0;
}
int ans(0),sum(0);
for(i... | 0 | 52,377,956 |
#include <bits/stdc++.h>
using namespace std;
long long func(long long X){
return log10(X)+1;
}
int main() {
long long min_F=100000000;
long long N;
cin >> N;
for(int i=1;i<=sqrt(N);i++){
if(N%i!=0){
continue;
}
long long A=max((long long)i,N/i);
long long F=func(A);
min_F=min(min_F,... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 0 | 17,349,148 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N;
ll l = 0, r = 0;
string L, R;
string S;
cin >> N >> S;
for(ll i = 0;i < S.size();i++) {
ll j = S.size() - i - 1;
if(S[i] == '(') l++;
... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 12,555,766 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#includ... | #include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, cla... | 0 | 63,606,611 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <fstream>
#include <chrono>
#define lint long long int
#define FOR(x, to) for(int x=0; x<(int)(to); x++)
#define DUMP(ar) for(int loop=0; loop<(int)ar.size(); loop++) cout << "[" <... | 0 | 11,598,479 |
#include <bits/stdc++.h>
int N;
std::vector <int> e[110000];
int size[110000];
int magic[110000];
int dfs (int x, int f = -1) {
int d = 0, cnt = 0, cnt_ = 0, del = 1;
for (int i = 0; i < e[x].size (); i++) {
if (e[x][i] == f) continue;
d = std::max (d, dfs (e[x][i], x));
if (magic[e[x][i]] != 1) del = 0;
if (... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define optimize() ios_base::sync_with_stdio(0);
int n;
int arr[100000][3];
int point[100000][3];
int p(int row,int col)
{
if(row == n-1)
{
return arr[n-1][col];
}
if(point[row][col]>0)
{
return point[row][col];
}
... | 0 | 100,240,052 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.