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;
typedef long long ll;
#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 FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vld vector<ld>
#define vvi vector<vecto... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))... | 0 | 54,570,320 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).be... | #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 <limits>
#include <climits... | 0 | 32,404,413 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <iomanip>
#include <cmath>
#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ()... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 51,771,658 |
#include <bits/stdc++.h>
using namespace std;
void bfs(vector<vector<int>> &G, vector<int> &dist, vector<int> &prev, int start) {
dist[start] = 0;
queue<int> q;
q.push(start);
while (!q.empty()) {
int v = q.front();
q.pop();
for (int next_v : G[v]) {
if (dist[next_v] ... | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < n; i++)
#define RREP(i, a, b) for (int i = a; i < (b); i++)
#define FOR(i, n) for (int i = n; i >= 0; i--)
using namespace std;
typedef long long ll;
vector<pair<ll, ll> > pack;
ll w, h;
int main(){
cin >> w >> h;
ll wholescore = 0;
REP(i, w){
... | 0 | 52,348,032 |
#include<stdio.h>
#pragma GCC optimize("O2")
static inline int comp(const int a,const int b,int desc){return a<b?(!desc?a:b):(!desc?b:a);}
int main(void)
{
int N,i=scanf("%d",&N)-1,u,v;long x=1l*N*(N+1)*(N+2)/6;
while(i<N-1){i+=scanf("%d %d",&u,&v)>>1;x=x-1l*comp(u,v,0)*(N-comp(u,v,1)+1);}
return printf("%ld",x),... | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sq... | 0 | 99,416,861 |
#include <stdio.h>
int main(){
int a;
while(1){
int n=0;
scanf("%d",&a);
if(!a) break;
a=1000-a;
while(a>0){
if(a>=500) a-=500;
else if(a>=100) a-=100;
else if(a>=50) a-=50;
else if(a>=10) a-=10;
else if(a>=5) a-=5;
else if(a>=1) a-=1;
n++;
}
printf("%d\n",n);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main() {
int x;
cin>>x;
if(x>=2400)... | 0 | 58,048,255 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) cin >> A[i];
for (int i = 0; i < N; i++) cin >> B[i];
unordered_set<int> determined;
{
int prevH = 0;
for (int i = 0; i < N; i++) {
if (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll x, ll y) {
if (y == 0) return x;
return gcd(y, x % y);
}
ll solve(ll n, ll m, vector<ll> &nums) {
while (nums[0] % 2 == 0) {
for (int i = 0; i < n; i++) {
if (nums[i] % 2 != 0) return 0;
nums[i] /= ... | 0 | 18,411,859 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int i, N, count=0;
vector<bool> num(26);
string S;
cin >> S;
rep(i,26) num[i] =false;
rep(i,S.size()){
num[S[i]-'a'] = true;
}
rep(i,26) {
if(n... | #include <iostream>
using namespace std;
int main() {
int p[201], ans, t;
int m, n_min, n_max;
while (cin >> m >> n_min >> n_max) {
if (m == 0 && n_min == 0 && n_max == 0) { break; }
for (int i = 0; i < m; i++) {
cin >> p[i];
}
ans = 0; t = 0;
for (int i ... | 0 | 89,597,821 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<int> a(N);
ll L... | #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>
#inclu... | 0 | 76,678,203 |
#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... | #include<iostream>
#include<math.h>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<queue>
#include<string>
#include<stdlib.h>
#include<stack>
using namespace std;
#define PI 3.14159265358979
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#include<set>
int main(void)
{
int n,m,k;
c... | 0 | 84,266,899 |
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <stack>
#include <map>
#define rep(i,n) for(long long i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll MOD = 1000000007;
int m, n1, n2;
int p[200];
void solve(){
rep(i,m) cin >... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main()
{
string s;
cin >> s;
... | 0 | 56,431,762 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define OrderSetTree tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define pi 2*acos(0.0)
#... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long int h = 0;
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (h > a[i]) {
ans+= h - a[i] ;
}
else h = a[i];
}
cout << an... | 0 | 95,490,625 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
using namespace std;
typedef long long ll;
const int maxN=1e5+7;
int N;
int p[maxN];
int pos[maxN];
int leftFirstMaxPos[maxN];
int rightFirstMaxPos[maxN];
ll ans=0;
int main(){
cin>>N;
for(int i=1;i<=N;i++){
cin>>p[i];
po... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=*b... | 0 | 78,472,580 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, ss, ee) for (int i = ss; i < (ee); ++i)
const int INF = 1e9;
vector<vector<int>> to(100001);
void solve() {
int N;
int M;
cin >> N >> M;
rep(i, 0, M) {
int u, v;
cin >> u >> v;
--u;
--v;
to[u].push_back(v);
to[v].push_back(u);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int h,w;
cin >> h >> w;
string s;
vector<string> ans;
rep(i,h){
cin >> s;
rep(j,2) ans.push_back(s);
... | 0 | 12,175,544 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n, t;
cin>>n >>t;
long long x=t;
vector<long long> s(n);
for(int i=0;i<n;i++)cin>>s[i];
for(int i=0;i<n-1;i++){
x+=min(s[i+1]-s[i], t);
}
cout<<x<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include<list>
#include <algorithm>
#include <string>
#include <math.h>
#include<map>
#include <utility>
#include<queue>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define INF (1e10)
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (sizeof(array)/si... | 0 | 84,207,235 |
#include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int p... | #include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename ... | 0 | 51,474,899 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int a[n];
for(int i=0;i<n;i++)cin >> a[i];
sort(a,a+n);
int d=0;
for(int i=0;i<k;i++){
d+=a[n-i-1];
}
cout << d;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define MAX_V 100
#define INF LONG_MAX / 4
using namespace std;
typedef struct {
int to, cost;
} edge;
vector<edge> G[MAX_V];
long long d[MAX_V][MAX_V];
bool find_negative_cycle(int v) {
for (int i = 0; i < v; i++) {
if (d[i][i] < 0) ... | 0 | 80,343,550 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int a, b;
cin >> a >> b;
char m = '0' + min(a, b);
string ans(max(a, b), m);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x...) cerr << "[" << #x << "]: " << x << "\n";
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ... | 0 | 28,822,273 |
#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 long double ld;
typedef pair<int,int> P;
constexpr int INF = 2e9;
int main() {
int n, m, k;
cin >> n >> m >> k;
int ok = 0;
for (int i = 0; i <= n; i++) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 2006
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout<<(a)<<endl
#define VECIN(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define MOD 1000000007
ll dp[N][N]... | 0 | 95,070,366 |
#include <iostream>
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N = 0;
std::cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
if (i % 2 == 0) {
continue;
}
int f = 0;
for (int j = 1; j <= i; j++) {
if (i % j == 0) {
f++;
}
}
if (f... | #include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define rrep(i,a,b) for(int i = a; i >=b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a)*(a)
#define nl "\n"
#define all(x) (x).begin(),(x).e... | 0 | 45,664,986 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main()
{
vector<int> v(3);
for (int i = 0; i < 3; ++i) cin >> v[i];
set<int> s(v.begin(), v.end());
cout << s.size() << "\n";
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, b, n) for (int i = b; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve(int N, string S) {
auto itr = S.begin();
int l(0), r(0);
REP(i, N) {
if (S[i] == '(')
l++;
else
... | 0 | 243,948 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
if (n == 2) {
int a, b;
cin >> a >> b;
if (a == b) {
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b;
cin>>n>>a>>b;
if(n==2)
cout<<"Borys"<<endl;
else{
int diff=abs(a-b)+1;
if(diff%2==0)
cout<<"Borys"<<endl;
else
cout<<"Alice"<<endl;
}
return 0;
} | 0 | 29,958,287 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i) ++)
typedef pair<int, int> pint;
#define INF 1e9
struct w_union_find{
vector<int> d_ws;
vector<int> ps;
w_union_find(int n = 1) : ps(n, -1), d_ws(n, 0){}
int r... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 1e7 + 7;
ll par[mx];
ll find_parent(ll x) {
if(x == par[x]) return x;
return par[x] = find_parent(par[x]);
}
void join(ll u, ll v) {
ll p_u = find_parent(u);
ll p_v = find_parent(v);
if(p_u == p_v) return;
par[p_u... | 0 | 73,231,044 |
#include<bits/stdc++.h>
#include<numeric>
#include<cassert>
#define ll long long int
#define CON 100010
const long long mod=1e9+7;
const int INF=1001001001;
using namespace std;
ll gcd(ll a,ll b)
{
ll r=a%b;
if(r==0)
{
return b;
}
return gcd(b,r);
}
ll lcm(ll num,ll gcd)
{
return num/gcd;
}
int main()
{
ll a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int n;
cin >> n;
int a[n];
rep(i,n) cin >> a[i];
sort(a,a+n);
if(a[n-1] <= 0) {
int ans = a[n-1];
rep(i,n-1) ans -= a[i];
cout << ans << endl;
rep(i,n-1) {
c... | 0 | 281,376 |
#include <queue>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <time.h>
#include <functional>
using namespace std;
typedef long long int ll;
#define EPS (1e-9)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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; }
int main(){
const ll inf = 1LL<<59;
ll W, H;... | 0 | 44,390,714 |
#include <iostream>
#include <string>
using namespace std;
const string keys = "qwertasdfgzxcvb";
int main() {
for (;;) {
string s;
cin >> s;
if (s == "#") break;
int res = 0;
bool cur = keys.find(s.substr(0, 1)) != string::npos;
for (int i = 1; i < s.size(); i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | 0 | 88,417,104 |
#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 <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void)
{
int n;
cin >> n;
rep(i, (n + 3) / 4)
{
int x = 4 * i;
if (n % 4 == 0)
{
cout << "Yes" << endl;
... | 0 | 74,933,450 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
long long ptn0=0;
long long ptn1=0;
for (long long i=0; i<S.size(); i++) {
if (i%2==0) {
if (S.at(i)!='0') ptn0++;
else ptn1++;
}
else {
if (S.at(i)!='1') ptn0+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort(ALL((c)))
#define debug(x) \
do { \
... | 0 | 58,547,677 |
#include <bits/stdc++.h>
using namespace std;
int n, a[200005];
map<int, int> mp;
bool check(int lmt) {
mp.clear();
int now = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] > now) now = a[i];
else {
now = a[i];
while (!mp.empty()) {
int last = (--mp.end())->first;
if (last >= now) ... | #include<vector>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<bits/stdc++.h>
#include<cstring>
#include<map>
#include<cmath>
#include<set>
using namespace std;
#define ll long long int... | 0 | 40,557,411 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 0 | 56,733,257 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
char a,b; cin >> a >> b;
if (a == 'D')
{
if (b == 'D') cout << 'H';
... | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define int long long
#define sz(v) (int)(v).size()
#define mod 1000000007
void solve() {
string str; cin >> str;
bool b1= 1, b2= 1;
int n= str.size();
for (int i= 0; i< n/ 2; i++) {
if (... | 0 | 29,749,339 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rrep1(i,n) for(ll (i) = (n); (i) >= 1; --(i))
#define nfor(i,a,b) for(ll (i) = (a); (i) < (b); ++(i))
#... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
#include <fstream>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#de... | 0 | 54,424,790 |
#include <stdio.h>
#include <string.h>
int dp[51][5];
void init() {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 0; i <= 50; ++i) {
for (int j = 1; j <= 4; ++j) {
for (int t = 0; t < 10 && t <= i; ++t) {
dp[i][j] += dp[i-t][j-1];
}
}
}
}
int main() {
int n;
init();
whi... | #include<iostream>
#include<string>
using namespace std;
enum version{
fleft,
fright,
};
version check(char c){
switch(c){
case 'q':
case 'w':
case 'e':
case 'r':
case 't':
case 'a':
case 's':
case 'd':
case 'f':
case 'g':
case 'z':
case 'x':
case 'c':
case 'v':
case 'b':
return ... | 0 | 15,694,913 |
#include <bits/stdc++.h>
using namespace std;
const unsigned int MOD = 1000000007;
#define ll long long
#define PI 3.1416
string day[]={"SUN","MON","TUE","WED","THU","FRI","SAT"};
bool sortDescByFirst(const pair<int,int>&a, const pair<int,int>&b){
return a.first>=b.first;
}
int main() {
int a,b,c,d;
while(c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << (#x) << "]: " << x << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
int a[n];
for (int& e: a) cin >> e;
vector<vector<int>> g(n);
fo... | 0 | 15,411,298 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000... | 0 | 82,344,874 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 65,308,731 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#define rep(i, n) for (int i = 0; ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
ll N; cin >> N;
ll A[N]; rep(i, N) cin >> A[i];
ll K[N] = {};
ll acc = 0;
ll ans = 0;
while(true){
acc = 0;
rep(i, N){
... | 0 | 11,942,980 |
#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;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef v... | 0 | 23,600,655 |
#include <iostream>
using namespace std;
int main(){
int n, k, x, y;
cin >> n >> k >> x >> y;
int result = 0;
if(n - k >= 0){
result += k * x;
result += (n - k) * y;
}
else{
result += n * x;
}
cout << result << endl;
} | #include<iostream>
#include<string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W;
string S;
cin >> H >> W;
int a, b;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> S;
if (S == "snuke") {
... | 0 | 13,467,265 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;
cin >>T ;
while(T--){
int s[3];
cin >> s[0] >> s[1] >> s[2];
sort(s,s+3);
if( s[0] * s[0] + s[1] * s[1] == s[2] * s[2] ) cout << "YES" << endl;
else cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
vector<vector<int>> v(4,vector<int>(4));
vector<vector<bool>> bin(4,vector<bool>(4,false));
for(int i=1; i<=3; i++)
for(int j=1; j<=3; j++)
cin >> v[i][j];
int n;... | 0 | 39,753,837 |
#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 <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <iomanip>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i,k,n) for(ll i=k; i<(ll)(n); i++)
#define Q 1000000007
struct UnionFind {
vector<ll> par;
UnionFind(ll N) ... | 0 | 97,658,392 |
#include<vector>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<bits/stdc++.h>
#include<cstring>
#include<map>
#include<cmath>
#include<set>
using namespace std;
#define ll long long int... | #include <iostream>
using namespace std;
int main(void){
int d;
while(cin >> d){
int COUNT = 0;
for (int i = d; 600 > i; i = i + d){
int j = i * i * d;
COUNT = COUNT + j;
}
cout << COUNT << endl;
}
return 0;
} | 0 | 16,695,434 |
#include <bits/stdc++.h>
using namespace std;
#define M_PI 3.14159265358979323846
#define MOD 1000000007
typedef long long ll;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<int, int> ipair;
typedef pair<ll, ll> llpair;
template<typename T> ostream& ... | #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>
#includ... | 0 | 64,585,163 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int a,b,c;
cin >> a>> b>> c;
cout << ((a <= c && b >= c) ? "Yes" : "No" ) << endl;
return 0;... | #include <iostream>
#include <map>
#include <vector>
#include <cmath>
#define point pair<double, double>
using namespace std;
int n;
vector<pair<double, double> > points;
void makeCurve(pair<double, double> p1, pair<double, double> p2, int n);
point makeVector(point a, point b);
int main() {
cin>>n;
point start... | 0 | 97,828,147 |
#include <iostream>
#include <numeric>
#define MAX 1000000
using namespace std;
int main() {
bool prime[MAX];
fill(prime, prime + MAX, true);
prime[0] = prime[1] = false;
for (int i = 2; i * i < MAX; i++) {
for (int j = 2; i * j < MAX; j++) {
if (!prime[i * j]) {
continue;
}
prime[i * j] = false;
}... | #include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", ... | 0 | 56,846,127 |
#include <bits/stdc++.h>
using namespace std;
int main(){
cout << fixed << setprecision(12);
double x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
double L = 0;
L = sqrt((x2 - x1)*(x2-x1) + (y2 - y1)*(y2-y1));
cout << L << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k,d,x,cnt=0;
cin >> n >> k;
bool a[n+1] = ... | 0 | 91,571,380 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int sum = 0;
bool flag = false;
int pos = 0;
for(int i = 1; i <= n; i++)
{
sum += i;
if(n == sum)
{
flag = true;
pos = i;
break;
}
}
if(!fla... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall... | 0 | 99,017,716 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define revp(i,a,b) for(int i=b;i>=a;i--)
string s;
int main()
{
cin>>s;
rep(i,0,s.length()-1)
{
if(s[i]!=',')
cout<<s[i];
else
cout<<" ";
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int INF_INT = 1e9;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T... | 0 | 28,042,659 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
ll n,h,w,cnt=0;
cin >> n >> h >> w;
ll a[n],b[n];
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
if(a[i]>=h&&b[i]>=w){
cnt++;
... | #include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
for (int i = 0; i < n; ++i)
{
int y,m,d;
cin>>y>>m>>d;
int ans=0;
int ty=1000-y-1;
ans+=(20*20+19*10)*(ty/3);
if(ty%3==1) ans+=20*10;
else if(ty%3==2) ans+=20*15+19*5;
if(y%3==0)
{
ans+=20*(10-m... | 0 | 47,121,090 |
#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;
typedef long long ll;
const ll INF=1e18,MOD=1e9+7;
int main(){
string s;
cin>>s;
int cnt=0;
for(int i=0;i<s.length();i++){
if(s[i]=='o')cnt++;
}
if(s.length()==15){
if(cnt>=8)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
... | 0 | 37,199,563 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 22,288,358 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdint>
#include <bitset>
#include <vector>
#include <thread>
#include <stack>
#include <map>
using namespace std;
int main()
{
int n, l;
cin >> n >> l;
vector<string> vs(n);
for (int i = 0; i < n; i++)
{
cin >> vs[i];
}
sort(vs.begin(), vs.... | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | 0 | 75,046,595 |
#include <bits/stdc++.h>
using namespace std;
int a,b;
#define For(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) For(i,0,n)
#define F first
#define S second
typedef double db;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INF=1e17;
ll gcd(ll x,ll y){
return y? gcd(y,x%y):x;
}
int... | #include<iostream>
#include<string>
#include<queue>
using namespace std;
int main(){
int n;
string w;
priority_queue<int> s;
while(cin>>w && w!="end"){
if(w=="insert"){
cin>>n;
s.push(n);
}
else{
n=s.top();
s.pop();
cout... | 0 | 19,535,639 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
struct mint {
int n;
m... | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
using dd = long double;... | 0 | 68,206,558 |
#include <bits/stdc++.h>
#define Int int64_t
#define pb push_back
using namespace std;
int main()
{
Int N;cin>>N;
vector<Int> A(N);
set<Int> s;
for(auto &x:A) cin>>x,s.insert(x);
Int largest=-1;int find=1;bool found=false;
int i=0,j=0;
while(i<N){
if(A[i]==find){
++find;
found=tr... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | 0 | 46,469,209 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
long long N,K;
cin>>N>>K;
long long ans=0;
long long mod=1000000007;
for(long long i=K;i<=N+1;i++){
ans+=(N*(N+1)/2-(N-i)*(N-i+1)/2-(i-1)*i/2)+1;
ans%=mod;
}
cout<<ans<<endl;
return 0... | #include <bits/stdc++.h>
#define smax(a, b) ((a) < (b) ? ((a)=(b), true) : false)
#define smin(a, b) ((a) > (b) ? ((a)=(b), true) : false)
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MAX = 1e9 + 7;
int n;
bool visited[... | 0 | 26,138,204 |
#include<iostream>
#include<cstdio>
#include<queue>
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
struct P{
int x;
int y;
};
int w,h,n;
const int INF = 1e+8;
char feld[1010][1010];
int d[1010][1010];
int sx,sy,gx,gy;
int dx[4]={0,0,1,-1};
int dy[4]={1,-... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n, m, k;
cin >> n >> m >> k;
bool flag = false;
rep(i, n + 1) {
rep(j, m + 1) {
if (j * (n - i) + i * (m - j) == k)
f... | 0 | 82,807,345 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a, b;
cin>> a >> b;
if(a%3 == 0 || b%3 == 0 || (a+b)%3 == 0) cout << "Possible" << endl;
else cout << "Impossible" << end... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
typedef long long int lint;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(all(a));
int num_minus = lower_bound(all(a), 0) - a.begin();
int minus_par... | 0 | 96,856,770 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, m;
cin >> n >> m;
vector< vector<P> > city(n+1);
for(int i=1; i<=m; i++){
int p, y;
cin >> p >> y;
city[p].push_back(make_pair(y, i));
}
for(int j=1; j<=n; j... | #include <iostream>
#include <vector>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <assert.h>
#include <algorithm>
#include <queue>
#include <bitset>
#include <stack>
#include <chrono>
#include <random>
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define ll... | 0 | 9,284,598 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b[51],cnt=0;
cin>>a;
for (int i=0;i<a;i++)
cin>>b[i];
for (int i=0;i<a;i++)
for (int n=i+1;n<a;n++)
cnt+=b[i]*b[n];
cout<<cnt;
return 0;
} | using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define infile "../test/sample-1.in"
#define int long long
const int INF=1e18;
const int MOD=1e9+7;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overlo... | 0 | 96,548,337 |
#include <cstdio>
using namespace std;
int main(){
int a, b;
scanf("%d %d", &a, &b);
if(a < b){
printf("a < b\n");
}
else if(a > b){
printf("a > b\n");
}
else{
printf("a == b\n");
}
return 0;
} | #include<bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
#define ll long long int
#define pb push_back
#define rep(i , j , n) for(ll i = j ; i < n ; i++)
#define pre(i , j , n) for(ll i = j ; i >= n ; i--)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vecto... | 0 | 76,549,426 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<ll> takahashi(n);
ll sum = 0;
for(int i = 0; i < n; i++){
ll a, b;
cin >> a >> b;
takahashi[i] = a+b;
sum-=b;
}
sort(takahashi.begin(), takahashi.end(), greater<long long>());
for(int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int in() {int x; cin>>x; return x;}
ll lin() {ll x; cin>>x; return x;}
string sin() {string x;cin>>x;return x;}
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
int ma... | 0 | 91,850,070 |
#include <bits/stdc++.h>
using namespace std;
#define sswap(x, y) { x+=y; y=x-y; x-=y; }
#define LSOne(S) ((S) & (-S))
#define EPS 1e-6
#define MOD 1000000007
#define fi first
#define se second
#define pb push_back
#define ende '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 985,351 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define uniq(v) v.resize(distance(v.begin(),unique(v.... | #include <iostream>
#include <cstdint>
#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 <unorder... | 0 | 56,196,343 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll a,b,c;
cin >> a >> b >> c;
c %= a;
map<ll,ll> mp;
mp[c]++;
while(1){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
ll cnt[101010];
pair<ll,int> P[101010];
int main(){
int N; cin>>N;
map<ll,int> mp;
rep(i,N){
ll a; cin>>a;
P[i]=make_pair(a,-(i+1));
mp[a]++;
}
sort(P,P+N);
revers... | 0 | 93,982,344 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
typedef pair<int, int> Pi;
#define fi first
#define se second
int mx[] = {1, 0, -1, 0};
int my[] = {0, 1, 0, -1};
signed main()
{
int W, H;
char mas[25][25];
while(cin >> W >> H, W || H) {
queue < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int (i)=0; (i) < (n); (i)++)
int main()
{
ll N; cin >> N;
vector<ll> a(N, 0);
rep(i,N) {
ll tmp; cin >> tmp;
a[i] = tmp - 1;
}
ll ansi = 0;
ll ans = 0;
rep(i,N) {... | 0 | 74,311,965 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,double> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( ... | #include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if (a < b)
if (b < c) cout << "Yes\n";
else cout << "No\n";
else
cout << "No\n";
} | 0 | 32,247,578 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main(){
int N, K;
cin >> N >> K;
if(K == 1) K = N;
cout << max(N - K, 0) << endl;
} | # include <bits/stdc++.h>
using namespace std;
# define int long long
int d,s,h,q,n,p;
signed main()
{
scanf("%lld%lld%lld%lld\n",&q,&h,&s,&d);
scanf("%lld\n",&n);
p=min(min(q*8,h*4),s*2);
if(d<p){
if(n%2==1)printf("%lld\n",(n-1)/2*d+p/2);
else printf("%lld\n",n/2*d);
}
else printf("%lld... | 0 | 745,468 |
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | 0 | 73,855,532 |
#include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n, i = 0,ans=1,m;
cin >> n;
vector <int>a(n),k(10000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, long long K, long long S) {
if (S == 1e9) {
rep(i, N) {
if (i < K) {
cout << S << " ";
} else {
cout << 1 <<... | 0 | 78,544,876 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
int N, K; cin >> N >> K;
if(N % K == 0){
cout << 0 << endl;
} else {
cout << 1 << endl;
}
} | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YE... | 0 | 96,111,269 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
while (true){
int i,S=0;
char x[1000] = { 0 };
cin >> x;
for (i = 0; i < 1000; i++){
if (x[i] == '\n'){ break; }
switch (x[i]){
case '0':S = S + 0;
break;
case '1':S = S + 1;
break;
case '2':S = S + 2;
break;... | #include <iostream>
using namespace std;
int main(){
for (int A=1;A<=9;A++){
for (int B=1;B<=9;B++){
cout<<A<<'x'<<B<<'='<<A*B<<endl;
}
}
return 0;
} | 0 | 94,390,724 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <list>
using namespace std;
using ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1)... | 0 | 49,088,094 |
#include <iostream>
using namespace std;
int main() {
while(1) {
int a, b;
cin >> a >> b;
if (a == 0 && b == 0)
return 0;
int krsw[17][17] = {};
int cross[17][17] = {};
int n;
cin >> n;
for(int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
krsw[x][y] = 1;
}
for(int i = 1; i <= a; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
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 c... | 0 | 5,102,711 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T>
class LCA_weight {
private:
int n;
int D = 30;
vector<int> depth;
vector<vector<pair<int,T>>> hen;
vector<vector<int>> par;
vector<T> dista; ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
usi... | 0 | 56,895,746 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
using namespace std;
const double eps=1e-10;
const int dy[]={-1,-1,0,1,1, 1, 0,-1};
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4... | 0 | 9,854,757 |
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gcd(ll x, ll y) {
ll r;
while (x%y) {
r = x % y;
x = y;
y = r;
}
return ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define dbg(n) cout<<#n<<' '<<n<<endl;
int power(ll x,ll y){ll res=1;while(y>0){if(y&1)res=(res*x)%mod;y=y>>1;x=(x*x)%mod;}return res;}
int main(){
int t;
cin>>t;
map<int,int> mp;
... | 0 | 23,489,207 |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
using namespace std;
#define A_MAX 2000000
#define INVALID -2000000000
int A[A_MAX];
void insert(int i, int* start) {
int parent = i / 2;
if (parent != 0) {
if (*(start+i-1) > *(start+parent-1)) {
int tmp = *(start+i-... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 | 40,802,389 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
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 y... | #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 s;
cin >> s;
int ans=1;
vector<int> num;
while(true){
for(int i=0; i<num.size(); i++){
... | 0 | 23,182,549 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
ll ans = 1e12;
for(int i = 0; i < 1<<n; i++)
{
int count = __builtin_popcount(i);
if(count !... | 0 | 40,851,129 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
signed main(){
int n;
cin>>n;
for(int i=1;;i++){
if(i*(i+1)>=2*n){
for(int j=1;j<=i;j++){
if(j!=i*(i+1)/2 - n){
cout<<j<<endl;
... | 0 | 21,739,031 |
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include ... | 0 | 5,550,165 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin >>A;
if(A<1200)cout << "ABC" <<endl;
else cout << "ARC"<<endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 55,989,169 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INPUT() freopen("input.txt", "r", stdin)
#define OUTPUT() freopen("output.txt", "w", stdout)
#define F first
#define S second
template<typename T>T gcd(T... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; 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 sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 0 | 57,430,582 |
#define _CRT_SECURE_NO_WARNINGS
#define M_PI 3.14159265358979
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include<iomanip>
#include<vector>
#include<cmath>
#include <algorithm>
using namespace std;
int main(){
int a[10];
for (int i = 0; i < 10; i++){
cin >> a[i];
}
sort(a, a + 10)... | #include <iostream>
using namespace std;
int P[10010];
int n,q;
int root(int a) {
if (P[a] == a) return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a, int b){
return root(a) == root(b);
}
void unite(int a, int b) {
P[root(a)] = root(b);
}
int main() {
int x,y,num,check;
cin >>... | 0 | 31,644,104 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const ll inf=1e9+7;
ll dp[50][3000];
int main()
{
fast;
ll a,b,h;
cin>>a>>b>>h;
set<ll>s={a,b,h};
cout<<s.size();
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
ll ans = 0;
ll t = 0;
ll cand = 0;
for (int i = 30; i >= 1; i--) {
if (((K >> i) & 1) == 0) continue;
... | 0 | 92,534,823 |
#include<iostream>
using namespace std;
int main() {
int n, i = 0;
cin >> n;
for (i = 1; i < 370; ++i) {
if (i * n % 360 == 0)break;
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
int main(){
int n, m; cin >> n >> m;
vector<int> S(n);
rep(k, m){
int tmp; cin >> tmp;
rep(i, tmp){
int a; cin >> a; a--;
S[a] |= 1 << k;
}
}
int p = 0;
re... | 0 | 10,971,547 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
double x[4],y[4];
for(int j=0;j<4;j++)
cin>>x[j]>>y[j];
if(abs((x[3]-x[2])*(y[1]-y[0])-(x[1]-x[0])*(y[3]-y[2]))<1e-10)
cout<<"YES"<<endl;
else
... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<queue>
using namespace std;
typedef long long LL;
#define sqr(x) ((x)*(x))
#define mp make_pair
#define F first
#define S second
inline int read(){
int x = 0; char ch = getchar(); bool positi... | 0 | 53,983,106 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
void solve () {
double n;
cin >> n;
vector<int> a(n);
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
double avg = round(sum / n);
long long ans = 0;
for (int i = 0; i < n; i++) {
long lon... | 0 | 69,320,451 |
#include <iostream>
#include <string>
#include <cmath>
#include<iomanip>
#include<algorithm>
#include<list>
using namespace std;
int main()
{
int n;
string a[101], b[101];
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i];
b[i] = a[i];
}
for (int i = 0; i < n; i++){
for (int j = n - 1; j > i; j--){
if (... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 7,888,839 |
#include <iostream>
using namespace std;
int main() {
int N,i,j;
cin >> N;
for(i=0; i<30; i++){
for(j=0;j<30;j++){
if(4*i+7*j==N){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 99,680,868 |
#include<iostream>
using namespace std;
#include<iomanip>
int main()
{
int a, b, r, d;
double f;
cin >> a >> b;
d = a / b;
r = a % b;
f = (a * 1.0) / b;
cout << d << " " << r << " " << fixed << setprecision(10) << f << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int n;
cin >> n;
int four = 0;
int num=n;
if(n==1 || n==2 || n==4){
cout << 4 <<endl;
}else{
for(int i=1; i<1000000; i++){
if(num%2==0){
... | 0 | 15,353,415 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(ll i=(a);i<(n... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 0 | 93,524,878 |
#include <iostream>
using namespace std;
int a[100005];
int m = 0;
int sum = 0;
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n-1; i++) {
if (a[i] >= a[i + 1]) {
sum++;
if (m < sum) {
m = sum;
... | #include<bits/stdc++.h>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define endl "\n"
#define ll long long
#define int long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cin.exceptions(cin.failbit);cout.tie(NULL);
using namespace std;
bool isPrime(... | 0 | 57,608,339 |
#include <iostream>
#include <string>
typedef long long ll;
void print()
{
std::cout << std::endl;
}
template<class T>
void print(T param)
{
std::cout << param << std::endl;
return;
}
template<class T, class... S>
void print(T param1, S... param2)
{
std::cout << param1 << " "; print(std::forward<S>(param2)...);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int count = 0;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
int z = s - x - y;
if (0 <= z && z <= k) {
count++;
}
}
}
cout << c... | 0 | 32,562,786 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout<<#x<<" = "<<(x)<<endl;
#define Yes(x) cout<<(x?"Yes":"No")<<endl;
#define YES(x) cout<<(x?"YES":"NO")<<endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define mod 1000000007
#define inf 1e18
const int N = 300005;
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
void cs(int &x)
{
cout << "Case #" << x << ": ";
}
bool cmp(string a, string b)
{
return a + b < ... | 0 | 75,084,003 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
vector<int> a(3);
rep(i, 3) cin >> a[i];
sort(a.begin(), a.end());
int ans = a[1]-a[0] + a[2]-a[1];
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
string S;
cin>>S;
bool OK=true;
map<char,int> data;
rep(i,4){
data[S[i]]++;
}
if(data.size()!=2){
OK=false;
}
for(auto p:data){
auto v=p.second;
... | 0 | 85,274,840 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long;
inline void nprint(){}
template <class Head, class... Tail>
inline void nprint(Head &&head, Tail &&... tail) {
cout << head << endl;
nprint(move(tail)...);
}
#ifdef DEBUG
#define eprint(...) nprint(__VA_ARGS__)... | #include <cstdio>
#define inf -99999999
using namespace std;
int cnt(int x,int y);
int cross[17][17];
int main(void){
int a,b,n,i,j,k,x,y;
for(j=0;j<6;j++){
scanf("%d%d",&a,&b);
if(a==0) return 0;
scanf("%d",&n);
for(i=1;i<17;i++) for(k=1;k<17;k++) cross[i][k]=inf;
for(i=... | 0 | 93,359,293 |
#include <stdio.h>
int main () {
int angka;
scanf ("%d", &angka);
int x = (angka/100);
int y = (angka - (x*100))/10;
int z = (angka - ((angka/10)*10));
if (x == 7 | y == 7 | z == 7) {
puts ("Yes");
} else puts ("No");
return 0;
} | #pragma GCC optimize("Ofast")
#include<stdio.h>
#include<algorithm>
using namespace std;
int r[105],c[105],dp[105][105]={0};
int main(){
int i,j,k,n,len;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d",&r[i],&c[i]);
for(i=0;i<n-1;i++)
dp[i][i+1]=r[i]*c[i]*c[i+1];
for(len=3;len<=n;len++){
for(i=0;i<n-len+1;i++)... | 0 | 6,900,120 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}... | #include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double pi = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
int main(){
int N,M;
cin >> N >> M;
vector<priority_queue<int,vector<int>,greater<int>>> p(N+1);
vector<map<int,int>> m(N+1)... | 0 | 25,169,038 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.