code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
map<pair<int, int>, bool> r;
rep(i, 3) {
int a, b; cin >> a >> b;
a--; b--;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(ll (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
ll mod = 1e9+7;
ll pow_mod(ll x, ll n){
ll res = 1;
w... | 0 | 25,714,799 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
string ans = "keyence";
cin >> s;
int n1 = s.size... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> b(n-1);
rep(i,n-1) cin >> b[i];
vector<int> a(n);
a[0] = b[0];
for(... | 0 | 51,038,212 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | #include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<l... | 0 | 87,333,507 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
int main()
{
long N,K;
std::cin >> N >> K;
(N%K==0)? std::cout << 0 << std::endl : std::cout << 1 << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n, p;
cin >> n >> p;
string s;
cin >> s;
reverse(all(s));
if (p % 2 == 0 || p... | 0 | 7,201,342 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,t... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) \
for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_A... | 0 | 15,457,572 |
#include <bits/stdc++.h>
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main()
{
int n; cin >> n;
vector<ll> a(n);
vector<ll> dp(n,LLINF);
REP(i,n) cin >> a[i];
REP(i,n) *lower_bound(dp.begin(),dp.end(),a[i]) = a[i];
cout << lower_bound(dp.begin(... | #include <iostream>
int *parents;
int *ranks;
int find(int x) {
if (parents[x] == x)
return x;
else
return parents[x] = find( parents[x] );
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if ( ranks[x] < ranks[y] ) {
parents[x] = y;
}
else if ( ranks[y] < ranks... | 0 | 15,074,550 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (ll i = (ll)(start); i < (ll)(n); ++i)
static const ll INFTY = 1L << 62L;
ll solver()
{
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
ll v[n + 1] = {};
ll a, b;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 0 | 46,734,139 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <u... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
ll a[n], b[n], c[m], d[m];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < m; i++) {
cin >> c[i] >> d[i];
}
int ans[n];
for (int i = 0; i < n; i++) {
ll dist_m... | 0 | 46,381,999 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int N, M, V, P;
vector<ll> A;
bool check(int idx) {
ll big = 0, les = 0;
REP(i, 0, N) {
if (A[idx] + M < A[i]) big++;
... | #include <stdio.h>
#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>
#incl... | 0 | 64,443,487 |
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int num, max = 0;
vector<int> cnt(101);
while(cin >> num)
cnt[num]++;
for(int i=0; i<101; i++)
if(max < cnt[i]) max=cnt[i];
for(int i=0; i<101; i++)
if... | #include <stdio.h>
int main() {
int n;
scanf("%d",&n);
int res = 0;
for (int i = 1; i <= n; i++)
{
res += i;
}
printf("%d",res);
return 0;
} | 0 | 67,682,723 |
#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
int main(){
int n;cin >> n;
for(int t = 1;t<=n;t++)
{
char mcxi[10];
for(int j = 0;j <=9;j++)mcxi[j]='\0';
cin >> mcxi;
int num1 = 0,num2 = 0,prenum = 1;
int i = 0;
while(mcxi[i]!='\0'){
switch(mcxi[i]){
case 'm':num1+=prenum * 1000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
using ll = long long;
int digits(ll n) {
int cnt = 0;
while (n) {
cnt++;
n /= 10;
}
return cnt;
}
int main() {
ll N;
cin >> N;
ll an... | 0 | 96,727,588 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using ld = long double; using pll = pair<ll... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = (int)(n)-1; 0 <= i; i--)
#define rrep1(i, n) for (int i = (int)(n); 1 <= i; i--)
#define each(it, c) \
for (__typ... | 0 | 73,224,850 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | #include <iostream>
#include <vector>
#include <bitset>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n, 0);
rep(i, n) cin >> a[i];
ll ans = 1e15;
rep (bit, (1 << n)) {
if (bitset<32>(bit).count() != k) contin... | 0 | 70,143,242 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
vector<int> jobs[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (m - a + 1 > 0)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
ll gcd(ll a, ll b){
ll r,temp;
if (a < b){
temp = a;
a = b;
b = temp;
}
whi... | 0 | 100,166,326 |
#include<bits/stdc++.h>
const long long INF = INT_MAX / 2;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) RFOR(i,0,n... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<unordered_map>
#include<utility>
#include<vector>
constexpr int IINF = (1 << 30) - 1;
constexpr long long... | 0 | 56,515,227 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<unordered_map>
using namespace std;
int main() {
int N;
cin >> N;
long long res = 0;
int former = -1;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (i == 0) {
former = a;
}
else {
if (former > a) {
res += form... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE(v... | 0 | 47,461,312 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a = 0;
while (1)
{
int e = 1000000;
cin >> a;
if (a == 0)
{
break;
}
int d[1000];
for (int i = 0; i < a; i++)
{
cin >> d[i];
}
sort(d, d + a);
for (int i = 0; i < (a - 1); i++)
{
if (e > d[i + 1] - d[i])
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
map<int,int> mp;
int ans=0;
for(int i=0;i<n;i++){
cin >> a[i];
if(a[i]<=n)mp[a[i]]++;
else ans++;
}
for(int i=1;i<=n;i++){
if(mp[i]>i)ans+=(mp[i]-i);
else if(mp[i]<... | 0 | 39,258,954 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <cstdio>
#include <algorithm>
#include <complex>
using namespace std;
int main() {
int tc; scanf("%d", &tc);
for(int tci = 0; tci < tc; tci++) {
complex<double> p1, p2, p3, p4;
scanf("%lf%lf%lf%lf%lf%lf%lf%lf",
&p1.real(), &p1.imag(),
&p2.real(), &p2.imag(),
&p3.real(), &p3.... | 0 | 87,357,990 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxx = 110;
const int INF = 2e9 + 10;
int n,q;
int d[maxx][maxx];
void floyd() {
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
if (d[i][k] == INF)
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 0 | 35,029,801 |
#include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int r, p, s;
int c (char x){
if(x == 'r') retur... | #include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < (ll)(r); i++)
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
string S; cin >> S;
ll ans = 0;
FOR(i,0,10){
int indi = 0;
while(indi <= N-1 && S[indi] != ('0'+i)) indi++;
if(indi > N-3) contin... | 0 | 54,514,362 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <bits/stdc++.h>
#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::vector<T>& v) ... | 0 | 78,742,224 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;
using P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;
const int INF=1<<30,MOD=1000000007;const ll LINF=1ll<<60;
#define _ol3(_1,_2,_3,name,...) name
#define _rep(i,n) _repi(i,0,n)
#d... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
#include <complex>
using namespace std;
#define Rep(b, e, i) for(... | 0 | 59,311,395 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
const int MAX=INT_MAX;
int main(){
int h,w;
std::cin >> h>>w;
std::vector<std::vector<char> > area(h,std::vector<char>(w));
rep(i,h)rep(j,w)std::cin >> area[i][j];
bool ok=true;
int dh[4]={1,-... | 0 | 69,544,713 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define mod 200003
#define pub(a) push_back(a)
#define mp(a,b) make_pair(a,b)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
char c;
cin>>c;
if((int(c))>=65 &... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
bool can = false;
for (int j = 0; j <= 10000; j++)
{
if (int(j * 0.08) == A && int(j * 0.1) == B)
{
cout << j << endl;
can = true;
break;
}
}
if... | 0 | 86,516,689 |
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include <stdio.h>
#include <string.h>
int n;
char com[15];
char str[15];
int C[1777771];
int g(char ch){
if(ch=='A')return 1;
if(ch=='G')return 2;
if(ch=='T')return 3;
return 4;
}
int f(){
int res=0;
for(int i=0;str[i]!='\0';i++){
res=res*4+g(str[i... | #include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
long long N;
int main() {
cin >> N;
vector<long long> A(N);
long long sum = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
}
if (sum % (N *... | 0 | 40,361,844 |
#include<iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, g;
cin >> a >> b >> c;
if (a <= b) {
d = a;
e = b;
} else {
d = b;
e = a;
}
if (e <= c) {
f = c;
} else {
f = e;
e = c;
}
if (d > e) {
g = d;
... | #pragma once
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
using namespace std;
typedef long long ... | 0 | 75,940,021 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
#define int long
#def... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<set>
using namespace std;
typedef long long ll;
#define N 100010
set<int> s;
set<int>::iterator it,tmp;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c... | 0 | 94,669,255 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll d,t,s;
cin>>d>>t>>s;
ll x=t*s;
if(x>=d)
{
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 78,464,036 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, C;
string B;
cin >> A >> B >> C;
if (B == "+") {
cout << A + C << endl;
} else {
cout << A - C << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
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--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 10000... | 0 | 54,068,042 |
#include <bits/stdc++.h>
#include<cmath>
using namespace std;
#define int long long int
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define F first
#define S second
#define all(a) a.begin(),a.end()
#define endl '\n'
#define boost ios::sync_with_stdio(false);cin.tie(0);cout.ti... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
using namespace std;
typedef long... | 0 | 29,224,756 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n; cin >> n;
long long ans=0;
for(long long i=1;i<=n;i++){
ans+=i;
}
ans-=n;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool ok = true;
int k = S.size() - 1;
while (k > 0) {
if (S.at(k) == 'm') {
if (k > 3) {
if (S.at(k - 1) == 'a' && S.at(k - 2) == 'e' && S.at(k - 3) == 'r' && S.at(k - 4) == 'd') {
k -= 5;
}
... | 0 | 24,598,666 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
ll H,W,N;
cin >> H >> W >> N;
map<P,int> mp;
rep(i,0,N){
int a,b;
cin >> a >> b;
a--,b... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | 0 | 23,052,739 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char x,y;
cin>>x>>y;
if(x<y){
cout<<"<"<<'\n';
}
else if(x > y){
cout<<">"<<'\n';
}
else{
cout<<"="<<'\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> adjList[10005], ts;
bool vis[10005];
void toposort(int u){
vis[u] = true;
for (int i=0; i<adjList[u].size(); i++){
int v = adjList[u][i];
if (!vis[v]) toposort(v);
}
ts.push_back(u);
}
int main(){
ios_base::sync_with_stdio(0);... | 0 | 71,936,965 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,point;
scanf("%d%d",&a,&point);
b=point*2-a;
printf("%d\n",b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5 + 5;
long long a[NMAX], sol, b[NMAX];
int n;
int main()
{
cin >> n;
for(int i = 1; i <= n + 1; i++) {
cin >> b[i];
}
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
for(int i = 1; i <= n; i++) {
long long min... | 0 | 43,007,131 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = 1e9+7;... | 0 | 51,351,800 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
int N, K;
ll A[1000];
ll ruisekiwa[1001];
vector<ll> candidate;
vector<ll> tmp;
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)cin >> A[i], ruisekiwa[i + 1] = ruisekiwa[i] + A[i];
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int N;cin>>N;
vector<int>W(N);
rep(i,N)cin>>W.at(i);
... | 0 | 89,035,165 |
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
int m... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 9999999999;
const int INFI = 2147483647;
template<class T> inline bool chmin(T& a, T b){if (... | 0 | 100,636,414 |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<int> viHeight(n);
for(int i = 0; i < n; i++){
scanf("%d", &viHeight[i]);
}
int nCount = 0;
while(true){
int nSeg... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 | 92,492,356 |
#include<bits/stdc++.h>
#define ll long long
const int inf = 1e9+7;
const ll INF = 1e18+7;
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int M = 0, m = 1e9+7;
for(int i =0; i < n; ++i){
int tmp;
cin >>tmp;
M = max(M,tmp);
m = min(m,tmp);
}
co... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
using... | 0 | 8,387,896 |
#include<bits/stdc++.h>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
int y,m,d;
void input(){
cin>>y>>m>>d;
}
int days(int y,int m){
if(y%3==0)return 20;
if(m%2==1)return 20;
return 19;
}
int solve(){
int sum = 1;
sum += days(y,m)-d;
m++;
while(1){
... | #include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl... | 0 | 20,379,607 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << ((a == b && b == c) ? 1 : (a == b || b == c || c == a) ? 2 : 3) << endl;
return 0;
} | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 0 | 86,324,546 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 14,685,592 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(ll i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(... | 0 | 59,191,650 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n+1); ++i)
using namespace std;
using ll = long long;
const int INF = +100100100;
typedef pair<ll,ll> P;
const ll MO = 1000000007;
int main(){
int n;
cin >> n;
vector<ll> a... | #include <iostream>
#include <queue>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
vector<long long> a;
vector<long long> b;
bool comp(long long i, long long j) {
if (a[i] == a[j])
return b[i] < b[j];
else
return a[i] > a[j];
}
int main(int argc, char* argv[]) {
long long N,... | 0 | 54,663,989 |
#include <iostream>
int main(){
int H,W;
while(true){
std::cin >> H >> W;
if(0 == H&&0 == W)break;
for(int a = 0;a < H;a++){
for(int b = 0;b < W;b++){
std::cout << "#";
}
std::cout <<std::endl;
}
std::cout <<std::endl; }
} | #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) ... | 0 | 98,964,522 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int k, s;
cin >> k >> s;
int ans = 0;
for(int i = 0; i <= k; i++){
... | #include <cstring>
#include <algorithm>
#include <iostream>
struct Card {
char suit;
unsigned int rank;
bool operator<(const Card& rhs) { return rank < rhs.rank; }
};
std::ostream& operator<<(std::ostream& os, const Card& card)
{
return os << card.suit << card.rank;
}
std::istream& operator>>(std::istream& is, ... | 0 | 95,456,115 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> groups;
char key = '1';
int cnt_key = 0;
for(int i=0;i<N;i++){
if(S.at(i)==key){
cnt_key++;
}
else{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
int main(){
double a,b,x;
cin>>a>>b>>x;
double l=a*a*b/2;
double dd;
if(a*a*b==x){
cout<<"0"<<endl;return 0;
}
if(l==x){
dd=a... | 0 | 72,770,954 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 0 | 70,019,659 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static const int MAX = 200000;
void trace(int data[], int n) {
cout << data[0];
for (int i = 1; i < n; i++) {
cout << " " << data[i];
}
cout << endl;
}
class Dtree {
public:
vector<int> rank, parent;
Dtree(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vs> vvs;
typedef vector<vc> vvc;
typedef vector<vb> vvb;
using P = pair<ll,ll>;
#defin... | 0 | 81,995,605 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,d,x;
cin>>n>>d>>x;
int total=0;
while(n--)
{
int a;
cin>>a;
int temp=1;
for(int i=1;(i*a+1)<=d;i++)
{
temp++;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2... | 0 | 9,547,883 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N,K;
cin >> N >> K;
K = min(100,K);
vector<int> A(N+1);
rep(i,N)cin >> A[i+1];
for(int i=0;i<K;i++){
vector<ll> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
if (s.size() + 1 == t.size()) {
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s.at(i) == t.at(i)) {
count++;
}
else {
cout << "No" << endl;
return 0;
}
}
... | 0 | 78,404,173 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
ll INF = 1000000000000 ;
ll n,A,B,C ;
vll l ;
ll DFS(ll a,ll b,ll c,ll cnt){
if(cnt==n) return (a*b*c==0?INF:abs(a-A)+abs(b-B)+abs(c-C)-30) ;
ll r1 = DFS(a,b,c,cnt+1) ;
ll r2 = DFS(a+l.at(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define debug(x) cerr << #x << ": " << x << '\n'
int main()
{
string S;
int w;
cin >> S >> w;
for (int i = 0; i < S.size(); ++i)
{
if (i % w == 0)
{
co... | 0 | 14,245,194 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
#define MOD (ll) (1e9+7)
int main()
{
ll n;
cin>>n;
ll ar[n];
ll su = 0;
for(int i=0;i<n;i++)
{
cin>>ar[i];
su+=ar[i];
}
ll avg = su/n;
ll avg1 = avg+1;
ll avg2 = avg-1;
ll ans1 = 0,... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int n,m;
int main()
{
cin >>n>>m;
if(n%2==1){
for(int i=1;i<=m;i++){
cout<<i<<" "<<n+1-i<<endl;
}
}
else{
for(int i=1;i<=m&&i<=n/4;i++){
cout<<i<<" "<<n+1-i<<endl;
}
if(m>n/4) {
for(int i=n/4+1;i<=m;i++... | 0 | 88,171,162 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
ll gcd(ll a, ll b){
if(b==0) return a;
return gcd(b, a%b);
}
int main(){
ios_bas... | 0 | 18,817,952 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
bool ok=false;
for(int i=a;i<a*b;i+=a){
if(i%b==c){
ok=true;
break;
}
}
if(ok)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
} | #include <iostream>
#include <vector>
const int INF = 1 << 30;
using Edge = std::pair<int, int>;
using Graph = std::vector<std::vector<Edge>>;
Graph G;
std::vector<bool> visited;
std::vector<int> X;
void dfs(const int v, bool &res) {
visited[v] = true;
for (auto e : G[v]) {
int nv = e.first;
int d = e.secon... | 0 | 74,136,868 |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, k;
while (~scanf("%d %d", &n, &k)) {
if ((n|k) == 0)
break;
vector<int> a(n);
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
for (int i = 1; i < n; ++i)
a[i] += a[i-1];
int ans = ... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<en... | 0 | 44,884,102 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i,l,r) for(i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
signed main(){
ll N,i,j;cin>>N;ll C[N-1],S[N-1],F[N-1];
REP(i,N-1)cin>>C[i]>>S[i]>>F[i];
R... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9+7;
int main() {
int n, T;
cin >> n >> T;
int t[n];
rep(i, ... | 0 | 248,190 |
#include <iostream>
#include <string>
#include <algorithm>
#include <ctime>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cassert>
#include <bitset>
#include <list>
#include <cstdio>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define endl '\n'
#define loop(i, m, n) for (ll i = m; i < n; i++)
#define loope(i, m, n) for (ll i = m; i <= n; i++)
#define epool(i, m, n) for (ll i = m; i >= n; i--)
#define mod 1000000007
#define mod2 9982... | 0 | 49,923,548 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
#define ll long long
#define pi (acos(-1))
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int main()
{
int a, b, m;
... | 0 | 54,064,558 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#define ll long long
#define rep(i,s,n) for(ll i = (ll)(s); i < (ll)(n); i++)
#define all(a) (a).begin(),a.... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#define ll long long int
#define eb emplace_back
#define fatafat ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MOD 1000000007
#define ft first
#define sd second
#define m... | 0 | 1,204,074 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | #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 ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | 0 | 32,849,943 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | #include <iostream>
#include <vector>
#include <bitset>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
int chmax(pair<int, vector<int> >& t0, pair<int, vector<int> > t1){
if(t0.first<t1.first) {
t0=t1; return 0;
... | 0 | 85,396,250 |
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define show(x) cerr<<(#x)<<" : "<<x<<endl;
#define ll long long
#define ld long double
#define fill(a,val) memset(a,val,sizeof(a))
#define mp make_p... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<queue>
using namespace std;
int main(){
for(int se = 0; se<5; se++){
int n,k,B[100001],t = -999999;
cin >> n >> k;
if(n == 0 && k == 0)break;
B[0] = 0;
for(int i=0; i<n; i++){
int a;
cin >> a;
B[i+1] ... | 0 | 28,228,602 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int n, m;
cin >> n >> m;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
int main(){
int n, a;
cin >> n >> a;
if (n >= a)
cout << "1";
cout << "0";
} | 0 | 46,694,814 |
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x... | #include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | 0 | 82,329,340 |
#include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template<class T> void chmax(T& a, T b){ if (a < b) { a = b; } }
te... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector<int> a;
for(int i = 0; i < 5; i++){
int n; cin >> n;
a.push_back(n);
}
sort(a.begin(), a.end(), greater<int>());
for(int i = 0; i < 4; i++)
cout << a[i] << " ";
cout << a[4] << endl;
return 0;
} | 0 | 64,971,128 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int64_t N;
cin >> N;
vector<int64_t>vec(N);
for (int i=0; i < N; i++) {
cin >> vec.at(i);
}
int right = 0;
int64_t sum = 0;
int64_t count = 0;
for (int left=0; left < N; left++) {... | #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, 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 | 18,254,275 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h, w; cin >> h >> w;
char a[h][w];
int row[h]={}, col[w]={};
for(int i=0; i<h; i++) {
for(int j=0; j<w; j++) {
cin >> a[i][j];
if(a[i][j]=='#') {
row[i] = 1;
col[j] = 1;
}
}
}
for(int i=0; i<h; i++) {
... | #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>
#incl... | 0 | 46,671,441 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const int N = 300005;
int a[N], b[N];
vector<int> c, d;
int main() {
int n, m, g;
scanf("%d%d%d", &n, &m, &g);
set<pair<int, int> > se;
for (int i = 0; i < g; i++) {
int x, y;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const ll INF = ll(1e18);
int main(){
ll n;
cin >> n;
ll ans = INF;
for(ll i = 1; i * i <= n;i++){
if(n % i == 0){
ll j = n / i;
ans = min(ans,i+j-2);
... | 0 | 93,394,792 |
#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... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 40,141,057 |
# include <bits/stdc++.h>
# define rep(i, n) for (ll i = 0; i < (n); i++)
# define reps(i, n) for (ll i = 1; i <= (n); i++)
# define foreps(i, m, n) for (ll i = (m); i < (n); i++)
# define len(x) ((int)(x).size())
# define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 53,955,478 |
#include <iostream>
#include <cstdio>
#include <cctype>
using namespace std;
int main()
{
char c;
while(1) {
scanf("%c", &c);
if ( c == '\n' ) break;
if (islower(c))
c = toupper(c);
else if (isupper(c))
c = tolower(c);
printf("%c", c);
}
printf("\n");
return (0);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long double eps = 1.0E-14;
#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 FORV(i,v) for(auto i=v.begin(); i!=v.end... | 0 | 62,985,891 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int,int>
#define ppl pair<ll,ll>
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) \
cerr << #x << "=" << x << "," << #y << "=" << y <<... | 0 | 84,091,914 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long ans = 0;
int N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
vector<char> T(N);
for(int i = 0; i < N; i++) {
cin >> T.at(i);
}
map<char, int> Points{{'r', R}, {'s', S}, {'p', P}};
map<char, char> my_hands{{'r', 'p'... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define all(c) (c).begin(), (c).end()
#define sz(x) ((int)(x).size(... | 0 | 19,490,688 |
#include <iostream>
#include <cstdio>
#include <list>
using namespace std;
typedef pair<int,int> P;
enum{IN,OUT};
int tosec(int h,int m,int s){
int t=0;
t+=s;
t+=m*60;
t+=h*60*60;
return t;
}
int main(){
int N;
while(cin>>N,N){
list<P> hyou;
for(int i=0;i<N;i++){
int h1,... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdlib.h>
#include <cmath>
#include <numeric>
#include <functional>
#include <stack>
#include <iomanip>
#include <map>
#include <cstdio>
int main() {
long long n;
std::cin >> n;
std::vector<long long> v(n);
for (long long i = 0; ... | 0 | 81,887,225 |
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define max(a, b) (a > b ? a : b)
#defi... | 0 | 4,075,647 |
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
long long l,r,mid;
long long e(long long x)
{
long long ans=1;
for(int i=1;i<x;++i)
ans*=10;
return ans;
}
bool check(long long x)
{
char ch='0';
cout<<'?'<<' '<<x<<endl;
while(ch!='Y'&&ch!='N') cin>>ch;
if(ch=... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int64_t H, W;
cin >> H >> W;
int64_t dif = H * W;
for (int i = 1; i < H; i++) {
int64_t a, b, c, x;
a = i * W;
if ((H - i) % 2 == 0) {
b = (H - i) / 2 * W;
x = abs(a - b);
i... | 0 | 28,420,899 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rem(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<... | #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... | 0 | 69,121,012 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <bits/stdc++.h>
#define ll long long
int main() {
std::ios::sync_with_stdio(false);
using namespace std;
ll n;
cin >> n;
vector<int> A(n + 2);
A[0] = n + 1;
A[n + 1] = n + 2;
for(int i = 1; i < n + 1; i++)
cin >> A[i];
vector<int> next(n + 2),
nnext(n... | 0 | 10,991,034 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int g = __gcd(a, b);
int d = b / g;
if (c % g != 0 || c / g >= d)
cout << "NO";
else
cout << "YES";
return 0;
} | #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
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 37,968,165 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();+... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 0 | 92,210,914 |
#include<cstdio>
#include<iostream>
using namespace std;
int prime[1000000];
int main(){
int n,ans=0;
for(int i=0;i<1000000;i++)
prime[i]=1;
prime[1]=0;
prime[2]=1;
for(int i=1;i<1001;i++){
if(prime[i]==1){
for(int j=i+1;j<1000000;j++){
if(j%i==0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, N; cin >> W >> H >> N;
bool table[H][W]; int ans = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
table[i][j] = true;
}
}
for (int i = 0; i < N; i++) {
int x, y, a; cin >> x >> y >> a;
for (int j = 0; j ... | 0 | 10,058,104 |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef struct _data {
int x;
int y;
} data;
int main()
{
string s;
cin >> s;
std::ifstream in("in10.txt");
std::cin.rdbuf(in.rdbuf());
ll ite = 0;
ll ans = 0;
for (long i = 0; i < s.size()... | 0 | 29,974,759 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,m,p;
while(cin >> n >> m >> p,n | m | p){
vector<int> vec(n,0);
for(int i = 0;i < n;i++){
cin >> vec[i];
}
int sum = 0;
for(int i = 0;i < n;i++){
sum += vec[i];
}
sum = sum*(100 - p);
if(vec[m-1]... | #include <vector>
#include <cstdint>
using namespace std;
using lint=int64_t;
using uint=uint32_t;
using ulint=uint64_t;
template<class T>
using vector2d=vector<vector<T>>;
template<class T>
struct CumulativeSum2D{
vector2d<T> cum;
CumulativeSum2D(const vector2d<T>& data):cum(data.size(), vector<T>(data[0].size(),0... | 0 | 83,466,110 |
#include<bits/stdc++.h>
using namespace std;
#define uniq(x) x.erase(unique(x.begin(),x.end()), x.end())
#define upper(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr
#define lower(arr,n,fixed) upper_bound(arr,arr+n,fixed)-arr
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define rep(i, n)... | #include <bits/stdc++.h>
#define rep(i, n) \
for (int64_t i = 0; i < (int64_t)(n); i++) \
;
using namespace std;
using vi = vector<int64_t>;
using vvi = vector<vi>;
using namespace std;
int main() {
cin.tie(0);
... | 0 | 29,345,509 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
a=b=0;
cin>>c;
for(int d=0;d<c;d++){
string e,f;
cin>>e>>f;
if(e==f){a++;b++;}
else {
vector<string>g(2);
g[0]=e;g[1]=f;
sort(g.begin(),g.end());
if(e==g[0])b+=3;
else a+=3;
}
}
cout<<a<<" "<<b<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n;
cin >> n;
rep(i, n, 1000){
if(i % 111 == 0) {
cout << i << endl;
return 0;
}
}
return 0;
} | 0 | 36,617,667 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
using namespace std;
int main(){
string str1,str2;
int n,m;
while(1){
str1="";
str2="";
cin>>str1;
if(str1[0]=='-'){
break;
}
cin>>n;
for(int i=0;i<n;i++){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S; cin >> S;
long long result=0;
long long l=0, r=0;
for(int i=0; i<S.size(); i++){
(S[i]=='>'?l:r)++;
if(i==S.size()-1){
if(S[i]=='<'){
result+=(r*(r+1)/2);
}else{
result+=(l*(l+1)/2);
result-=min(l,r);... | 0 | 37,608,179 |
#include <iostream>
#include <vector>
#include <string>
#include <numeric>
#include <tuple>
#include <algorithm>
#include <array>
using namespace std;
using ll = long long;
#define rep(i,n) for(decltype(n) i=0; i<n; ++i)
inline constexpr ll Inf = (1ULL << 62) -1;
template <class T>
void updatemax(T& a, T b) { if (b > a... | #include <cstdio>
struct UnionFind {
int *par;
int *rank;
UnionFind(int n) {
par=new int[n];
rank=new int[n];
for(int i=0;i<n;i++) {
par[i]=i;
rank[i]=0;
}
}
int find(int x) {
if(par[x]==x) {
return x;
}else {
... | 0 | 41,481,058 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> d(N);
for (int i=0;i<N;i++){
cin >> d.at(i);
}
int ans=0;
for (int i=0;i<N;i++){
for (int j=0;j<N;j++){
if(i==j){
continue;
}
else{
ans+=d.at(i)*d.at(j);
}
}
}
cou... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 0 | 54,277,183 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin >> N >> M;
int num[10]={2,5,5,4,5,6,3,7,6};
int a[M];
for(int i=0;i<M;i++) cin >> a[i];
string dp[11000];
for(int i=0;i<=N;i++) dp[i]="-";
dp[0]="";
for(int i=0;i<=N;i++){
for(int j=0;j<M;j++){
if(d... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define int long long
#define pb push_back
#define For(i,n) f... | 0 | 44,088,747 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n;
cin >> n;
vector<pll> a(n+1);
for(ll i=1;i<=n;i++) {
cin >> a[i].first;
a[i].second=i;
}
sort(a.be... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define repin(a,n) vector<ll> a(n);rep(i,n){cin>>a[i];}
#define repins(a,n) vector<string> a(n);rep(i,n){cin>>a[i];}
#define repind(a,n) vector<double> a(n);rep(i,n){cin>>a[i];}
#define in(a) ll... | 0 | 21,751,364 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, Z, W;
cin >> N >> Z >> W;
vector<int> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
if (N == 1) cout << abs(W-a[0]) << endl;
else cout << max(abs(W-a[N-1]), abs(a[N-2]-a[N-1]));
} | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | 0 | 66,489,545 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,X,Y,Z;
cin >> N >> A;
Y = N / 500;
X = N % 500;
if(X <= A){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include<iostream>
#include<vector>
using namespace std;
int selectionSort(vector<int> &v){
int cnt = 0, size = v.size(), i, j, min;
for(i = 0; i < size; i++){
min = i;
for(j = i; j < size; j++){
min = v[j] < v[min] ? j : min;
}
if(i != min){
int tmp = v[i... | 0 | 96,526,948 |
#include<stdio.h>
int main(void){
int a[3],i,j,s,w,l;
scanf("%d",&s);
for(w=0;w<s;w++){
scanf("%d %d %d",&a[0],&a[1],&a[2]);
for(i=0;i<2;i++){
for(j=i+1;j<3;j++){
if(a[i]<a[j]){
a[i] = a[i] ^ a[j];
a[j] = a[i] ^ a[j];
a[i] = a[i] ^ ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
int n;
typedef pair<int, int> P;
int main(){
cin >> n;
P pr[n], pb[n];
for(int i=0 ; i<n ; i++){
cin >> pr[i].fi >> pr[i].se;
}
for(int i=0 ; i<n ; i++){
cin >> pb[i].fi >> pb[i].se;
}
sort(pr, p... | 0 | 97,417,309 |
#include<bits/stdc++.h>
using namespace std;
#define nl cout<<'\n';
int main()
{
int p,q,r;
cin>>p>>q>>r;
cout<<min((p+q),min((p+r),(q+r)));
nl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef... | 0 | 80,160,873 |
#include<iostream>
using namespace std;
int main(){
long long a, b;
cin >> a >> b;
if(b%2!=0)
{
if((b+1)%4!=0)
{
b = 1;
}
else
{
b = 0;
}
}
else
{
if(b%4!=0)
{
b = b ^ 1;
}
el... | #include<iostream>
#include<cmath>
using namespace std;
int main()
{
int x;
while(cin >> x){
if(x==0){
break;
}
int cnt=0;
int a=1000-x;
cnt+=a/500;
a%=500;
cnt+=a/100;
a%=100;
cnt+=a/50;
a%=50;
cnt+=a/10;
... | 0 | 30,870,810 |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | 0 | 38,604,856 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,a,b) for (int i = (a); i < (b); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 100000000;
const double PI=3.14159265358979323846;
int main () {
ll N ;
cin >> N ;
ll A[N],B[N];
rep(i,0,N) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | 0 | 25,538,380 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <functional>
#includ... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#def... | 0 | 82,489,270 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l;
l.push_back(1);
l.push_back(1);
for (int i = 2; i <= n; i++) {
l.push_back(l[i-2] + l[i-1]);
}
cout << l[n] << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll mod=1e9+7;
ll n,m;
cin>>n>>m;
int a[n],b[m];
for(int i=1;i<=n;i++)
cin>>a[i];
for(int j=1;j<=m;j++)
cin>>b[j];
int dp[n+1][m+1];
memset(dp,0,siz... | 0 | 35,300,813 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.