code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<iostream>
#include<string>
using namespace std;
int main(){
bool dp[20][20];
char r[20][20];
int w,h;
while(true){
cin>>w>>h;
if(w==0&&h==0)
break;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>r[i][j];
dp[i][j]=false;
if(r[i][j]=='@')
dp[i][j]=true;
}
}
int count=1,cop=1;
while... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
using namespace std;
int dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};
int main(){
int W,H,sx,sy;
string s[25];
bool flag[25][25];
while(1){
cin>>W>>H;
if(W==0&&H==0) break;
for(int i=0; i<H; i++){
cin>>s[i];
for(int j=0; j<W; j++){
if(s[i][j]... | 1 | 84,812,352 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL<<60)
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Yes puts("Yes")
... | 1 | 2,619,146 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
const int nmax=10010;
int N,Q;
int par[nmax];
void init(){rep(i,nmax) par[i]=i;}
int find(int x){return (par[x]==x)?x:par[x]=find(par[x]);}
void unite(int a,int b){a=find(a),b=find(b);par[a]=b;}
bool same(int a,int b){return fi... | 1 | 25,903,536 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n , k;
cin >> n >> k;
while(n!=0|| k!=0){
vector<int>a(n);
for(int i = 0;i < n;i++){
cin >> a.at(i);
}
vector<int>S(n+1);
S.at(0) = 0;
for(int i = 0;i < n;i++){
S.at(i+1) = S.at(i) + a.at(i);
}
int ans = 0;
... | #include <iostream>
using namespace std;
int main(){
int n,m;
int k[100001];
while( cin >> n >> m , n+m ){
int sum = 0;
for(int i = 0 ; i < n ; i++ )cin >> k[i];
for(int i = 0 ; i < m ; i++ )sum+=k[i];
int mx = 0;
for(int i = 0 ; m < n ; m++,i++){
sum += k[m]-k[i];
mx = max(mx,sum... | 1 | 66,735,274 |
#include <cstdio>
using namespace std;
int main(){
int x, a;
scanf("%d %d", &x, &a);
printf("%s0\n", (x<a)?"":"1");
} | #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 pbds tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f... | 1 | 16,788,571 |
#include <bits/stdc++.h>
using namespace std;
int INF = 1001;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n);
vector<int> d(n);
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
for (int i = 0; i < n; i++) cin >> c[i] >> d[i];... | #include<bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
const char newl = '\n';
typedef long long int Int;
typedef pair<int,int> P;
using ... | 1 | 84,223,181 |
#include <iostream>
#include <algorithm>
#include <string>
#include <math.h>
#include <cstdint>
#include <vector>
using namespace std;
typedef long long ll;
ll ans, mx, mn, flag, sum, cnt;
int main(){
ll n,i;
cin>>n>>i;
cout<<(n-i)+1;
} | #include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
int n,p;
cin>>n>>p;
for(int i=p;i>1;i--)
{
n--;
}
cout<<n;
return 0;
} | 1 | 86,222,155 |
#include <iostream>
using namespace std;
int main()
{
int A, B;
char op;
cin >> A >> op >> B;
if(op == '+') {
cout << A+B << endl;
} else {
cout << A-B << endl;
}
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 97,851,066 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define vecst vector<string>
#de... | #include <iostream>
#include <cstdio>
#include <set>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
#include <sstream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace... | 1 | 32,084,593 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int main(int argc, char **argv)
{
int n;
cin >> n;
vector<int> dp(n, INT_MAX);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
auto p = lower_... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace st... | 1 | 39,345,166 |
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int main(void){
long long int N,M,H,W,x,i,j,k,ans,count,cost,tmp,a,b,c,d,c1,c2,HP;
long long int S[110000];
string T[110],TA,V,G,ans2;
bool flag;
count=0;
ans=std::pow(10,18);
ans=0;
flag=fal... | #include <iostream>
using namespace std;
int main()
{
int point[105];
int n;
int sum=0;
cin>>n;
for(int i=0; i<n; i++)
cin>>point[i];
for(int i=0; i<n; i++)
{
if(point[i]==0)
continue;
for(int j=i+1 ; j<n; j++)
{
sum+=point[i]*point[j];... | 1 | 9,625,823 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> ... | 1 | 30,010,331 |
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) ... | #include <iostream>
#include <vector>
#include <array>
#include <set>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <list>
#include <stack>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cassert>
#include <bitset>
#include <cctype> ... | 1 | 17,614,664 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define FOR(a, c) for (int(a) = 0; (a) < (c); (a)++)
#define FORL(a, b, c) for (int(a) = (b); (a) <= (c); (a)++)
#define FORR(a, b, c) for (int(a) = (b); (a) >= (c); (a)--)
#define INF 1000000000000000003
typedef long long int ll;
typedef vector<int> v... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
void solve()
{
int x, y;
cin >> x >> y;
if(y<=x*4 && y>=x*2 && y%2==0)
{
cout << "Yes" << endl;
}
else
cout << "No" << endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll t;
solve(... | 1 | 47,900,222 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
#define adrep(i,s,n) for (int i=(s);i<(n);i++)
using namespace std;
typedef long long ll;
ll MOD=ll(1e9)+7;
int main(){
ll N,K;
cin>>N>>K;
ll A[N];
rep(i,N){
cin>>A[i];
}
ll count=0;
ll count2=0;
rep(i,N-1){
for(int j=i+1;j<N;j++){
... | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
long long int mod=1000000007;
int main(void){
long long int n,k;
cin>>n>>k;
vector<int> a(n);
for(i... | 1 | 76,990,373 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
#define fore(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);++i)
#define rep(i,n) fore(i,0,(n)-1)
#define rfore(i,a,b) for(ll i=(ll)(b);i>=(ll)(a);--i)
#define rrep(i,n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
ll B[100005];
int main()
{
ll... | 1 | 41,277,741 |
#include <algorithm>
#include <iostream>
using namespace std;
void solve(long long A, long long B, long long C, long long D){
cout << min(A, B) + min(C, D) << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long A;
scanf("%lld",&A);
long long B;
scanf("%lld",&B);
long l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
int a,b,c,d;scanf("%d %d %d %d",&a,&b,&c,&d);
printf("%d\n", min(a,b) + min(c,d));
} | 1 | 32,242,539 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int IN... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | 1 | 17,722,763 |
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.14159265358979323846
#define VI vecto... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin >>A>>B>>C>>D;
int begin=max(A,C);
int end=min(B,D);
if(end-begin<0){
cout <<"0"<<endl;
return 0;
}
cout<<end-begin<<endl;
} | 1 | 50,780,441 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#de... | #include <cstdio>
const long long int MOD = 1e9 + 7;
int main(){
int n, m;
long long int x, y, xSum=0, ySum=0;
scanf("%d %d", &n, &m);
for(int i=0; i<n; ++i){
scanf("%lld", &x);
xSum += (2*i + 1 - n) * x;
xSum %= MOD;
}
for(int i=0; i<m; ++i){
scanf("%lld", &y);
ySum += (2*i + 1 - m) * y;
ySum %= MOD;... | 1 | 38,511,523 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<iomanip>
#include<map>
#include<cstring>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const ll LLINF = 4 * 1e... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
#include <cassert>
#include <complex>
using namespace std;
#define INF 1e16
ty... | 1 | 10,173,732 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string S;
long long K;
cin >> S >> K;
for (int i = 0; i < min((long long)S.size(), K); i++) {
if (S[i] >= '2') {
cout << S... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
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... | 1 | 83,792,244 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, A;
cin >> N >> A;
int ans = N * N - A;
cout << ans << endl;
return 0;
} | #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... | 1 | 71,623,354 |
#include "bits/stdc++.h"
using namespace std;
bool dp[8000][16001][2];
int ori = 8000;
int main()
{
string s;
int tarx, tary, n, f = 0, tcount[2] = {0, 0};
cin >> s >> tarx >> tary;
s += 'T';
n = s.size();
for(; f < n && s[f] == 'F'; ++f){}
dp[0][ori][0] = true;
dp[0][ori + f][1] = true;
for(int i = f, isx = t... | #include <iostream>
#include <cstdio>
#include <bitset>
#define M 8005
using namespace std;
int x, y, z, c;
string s;
bitset<M * 2> bs[2];
int main() {
int i;
cin >> s >> x >> y;
for (i = 0; s[i] == 'F'; i++);
bs[0][i + M] = bs[1][M] = 1;
for (; i <= s.size(); i+... | 1 | 90,452,532 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | #include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
int main(){
int N; cin >> N;
string S;cin >> S;
int need_left = 0;
int pointer = 0;
for(int i = 0; i < S.size();i++){
if(S[i]=='(')++pointer;
else{
if(pointer == 0)++need_left;
... | 1 | 53,049,628 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
string s;
cin >> s;
vector<bool> v(3, false);
rep(i,3){
if(s[i]=='a'){
v[0] = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> s(3);
for(int i=0;i<3;i++){
cin>>s.at(i);
}
sort(s.begin(),s.end());
if(s.at(0)=='a'&&s.at(1)=='b'&&s.at(2)=='c')
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 1 | 68,665,647 |
#pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#inc... | #include <iostream>
#include<string>
using namespace std;
int main()
{
string S;
cin >> S;
for (int i = 0; i < S.length(); i++) {
int len = S.length() - i;
if (len % 2 == 0 && i>0) {
string S1 = S.substr(0, len / 2);
string S2 = S.substr(len / 2, len / 2);
if (S1 == S2) {
cout << len << endl;
re... | 1 | 22,518,796 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
int mod = 1000000000+7;
int main(){
int n;
string s;
cin>>n>>s;
string s1="",s2="";
int l=0;
rep(i,n){
if(s[i]=='(')l++;
else {
if(l>0)l--;
else s1+='(';
}
}
rep(i,l)s2+=')';
cout<... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int cnt1=0;
int cnt2=0;
stack<char> st;
for(int i=0;i<n;++i){
if(!st.empty()){
if(st.top()=='(' && s[i]==')')st.pop();
else st.push(s[i]);
}
else st.pus... | 1 | 36,814,212 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >>... | #include<iostream>
using namespace std;
int main(){
int n,ans=100000;
cin>>n;
while(n--){
ans*=1.05;
if(ans%1000>0){
ans/=1000;
ans*=1000;
ans+=1000;
}
}
cout<<ans<<endl;
} | 1 | 18,973,290 |
#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,m;
cin >> n >> m;
int l,r;
int l_max = 0;
int r_min = n-1;
rep(i,m) {
cin >> l >> r;
l--;
r--;
l_max = max(l, l_max);
r_... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define ss second
#define ff first
#define pb push_back
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO ios_base::sy... | 1 | 7,387,929 |
#include <iostream>
using namespace std;
int main() {
int scores[7];
int score_length = 0;
int number = 0;
cin>>number;
while (number != 0) {
int max = 0;
int min = 1000;
int score = 0;
int total = 0;
for (int i = 0; i < number; i++) {
cin>>score;
... | #include "algorithm"
#include "iostream"
#include "cmath"
#include "string"
#include "map"
using namespace std;
int main(){
while(true){
int n,min=1001,max=-1,sum=0,ten;
cin >> n;
if(!n)break;
for(int i =0;i<n;i++){
cin >> ten;
sum+=ten;
if(min>ten)min=ten;
if(max<ten)max=ten;
}
cout << (s... | 1 | 30,224,597 |
#include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>
using namespace std;
#de... | #include <iostream>
#include <cmath>
using namespace std;
const double EPS = 1e-10;
int main()
{
double xa, ya, xb, yb, xc, yc, xd, yd;
double AB, CD;
int num = 0, i = 0;
cin >> num;
while ( i < num )
{
cin >> xa >> ya >> xb >> yb >> xc >> yc >> xd >> yd;
if ( fabs( ( xa - xb ) * ( yc - yd ) - ( xc - xd ) * (... | 1 | 35,006,517 |
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (long l... | #include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#defi... | 1 | 83,495,650 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
void solve() {
int n, k, price = 0;
cin >> n >> k;
int p[n];
for (int i = 0; i < n; ++i)
cin >> p[i];
sort(p, p + n);
for (int i = 0; i < k; ++i)
price += p[i];
cout << price << endl;
}
int main() {
solve();
ret... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
int k;cin >>k;
vector<int>p(n);
... | 1 | 28,005,471 |
#include <iostream>
int main() {
int n, k, x, y;
std::cin >> n >> k >> x >> y;
if (n < k) {
std::cout << n * x << "\n";
} else {
std::cout << k * x + (n - k) * y << "\n";
}
} | #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<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LONG... | 1 | 53,976,683 |
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 1 | 44,833,443 |
#include <vector>
#include <set>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <string>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { co... | #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()... | 1 | 87,448,346 |
#include<bits/stdc++.h>
#define ll unsigned long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
using namespace std;
const int N=3e5+10;
set<pii>s;
int r[N],c[N],id1[N],id2[N];
int main()
{
int h,w,m;
scanf("%d%d%d",&h,&w,&m);
for(int i=1;i<=m;i++)
{
in... | #include<bits/stdc++.h>
#define poi 601000
using namespace std;
typedef long long ll;
struct girl
{
int x,y;
bool operator<(const girl &b)const
{
return (x^b.x)?x<b.x:y<b.y;
}
}a[poi];
int b[poi],ans,h,w,n,tans;
set<pair<int,int> > s;
inline int re()
{
char x=getchar();
int k=1,y=0;
while(x<'0'||x>'9')
{if(x... | 1 | 64,093,403 |
#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 <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INT_INF = 2147483647;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;... | 1 | 42,651,617 |
#define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); ++i)
#define REP2(i, m, n) for (ll(i) = (ll)(n)-1; i >= (ll)(m); --i)
#define rep(i, n) REP(i, 0, n)
#define rep2(i, n) REP2(i, 0, n)
#define all(hoge) (hoge).begin... | 1 | 82,327,171 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int>vec = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int i;
cin >> i;
cout << vec[i - 1] << endl;
return 0;
} | #include <stdio.h>
int x[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int main(){
int a;
scanf("%d",&a);
printf("%d",x[a-1]);
return 0;
} | 1 | 38,571,647 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#define ll long long
using namespace std;
int n;
vector<pair<ll, ll>> v;
bool cmp(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return atan2(a.second, a.first) < atan2(b.second, b.first);
}
int main() {
scanf("%d", &n);
for (int i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
int32_t main()
{
cout << fixed << setprecision(15);
int n;
cin >> n;
vector<pair<double, pair<double, double>>> a;
for (int i = 0; i < n; ++i)
{
int x, y;
cin >> x >> y;
a.push_... | 1 | 28,044,948 |
#include <iostream>
void checkTringle(int a,int b,int c){
if(a * a == b * b + c * c){
std::cout << "YES" << std::endl;
}else{
std::cout << "NO" << std::endl;
}
}
int main(int argc, char *argv[])
{
int dataSize;
std::cin >> dataSize;
int side[3];
for(int i=0; i<dataSize; i++){... | #include <iostream>
#include<math.h>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<functional>
#include<string>
using namespace std;
int aa[1000][1000]={};
int main()
{
int i=0,j=0,n=0,a=0,b=0,c=0,d=0;
cin >> n;
for(i=0;i<n;i++){
d=0;
cin >> a >> b >> c;
if(a>b&&a>... | 1 | 52,516,171 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <bits/stdc++.h>
#define PI acos(-1)
#define fs first
#define sc second
#define debug freopen("1.in","r",stdin),fre... | #include<iostream>
#include<algorithm>
using namespace std;
int N,a,b,c;
long ans;
main()
{
cin>>N;
for(int i=0;i<N;i++)
{
string s;cin>>s;
for(int j=0;j+1<s.size();j++)
{
if(s[j]=='A'&&s[j+1]=='B')ans++;
}
if(s[0]=='B'&&s[s.size()-1]=='A')c++;
else if(s[0]=='B')b++;
else if(s[s.size()-1]=='A')a++;
... | 1 | 81,678,027 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
ll n, k, s;
cin >> n >> k >> s;
rep(i, n) {
if (i < k)
cout << s;
else {
if (s == 1e9)
cout << 1;
else
... | 1 | 32,732,260 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
int main() {
ll K, A, B;
cin >> K >> A >> B;
ll ans = 0;
if (B - A <= 2) ans = K + 1;
else {
ll sell_num = (K - (A ... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long k,a,b;
cin >> k >> a >> b;
if(b-a>2){
if(k<=a)cout << k+1 << endl;
else{
cout << b + (b-a)*((k-a-1)/2) + (k-a+1)%2 << endl;
}
}
else{cout << k+1 << endl;}
return 0;
} | 1 | 45,395,110 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define ll long long
using namespace std;
int main() {
int n, m, k=0;
cin >> n >> m;
rep(i, m){
int a;
cin >> a;
k += a;
}
n -= k;
if(n < 0) cout << -1 << endl;
else cout << n << endl;
return 0;
} | #include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
int n;
int m;
int sum;
void input() {
sum = 0;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int t;
cin >> t;
sum += t... | 1 | 98,119,644 |
#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;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
#define all(x) x.begin(), x.end()
#define allr(x... | #include<iostream>
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int k;
cin >> k;
string s;
cin >> s;
if (s.length() <= k) {
cout << s;
} else {
s[k] = '.';
s[k + 1] = '.';
s[k + 2] = '.';
s[k + 3] = '\0';
for (int... | 1 | 56,556,037 |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
#define int long long
#define F first
#define S second
#define s(x) set<x>
#define um(x, y) unordered_map<x, y>
#define m(x, y) map<x, y>
#define p(x, y) pair<x, y>
#define v(x) vector<x>
#define min_heap(t) priority_queue<t, vector<t>, greater<t>>
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs prior... | 1 | 50,147,760 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
static const int MAX = 100;
int N;
int ADJ[MAX][MAX];
int depth[MAX];
enum STATUS { ACTIVE = 0, MARKED, VISITED, };
int status[MAX] = {ACTIVE};
void visit(int id) {
status[id] = VISITED;
}
void mark(int id) {
status[id]... | #include<iostream>
#include<queue>
using namespace std;
int n, M[100][100], d[100];
void bfs (int s) {
int i, u, v;
queue<int> Q;
Q.push(s);
for (i = 0; i < n; i++) {
d[i] = (1 << 21);
}
d[s] = 0;
while (!Q.empty()) {
u = Q.front();
Q.pop();
for (v = 0; v < n;... | 1 | 44,405,419 |
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,k,ai,bi;
cin >> n >> k;
vector<long> l(100001);
rep(i,n){
cin >> ai >> bi;
l[ai]+=bi;
}
for (int i = 0; i < 100001; i++){
if (l[i] ... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define ll long long int
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define D1(x) {cerr<<" [" <<#x<<": "<<x<<"]";cout << endl;}
#define D2(x) {cerr<<" [" <<#x<<": ";f... | 1 | 45,457,081 |
#include<iostream>
using namespace std;
int main(){
int x;
int y;
cin >> x;
cin >> y;
if (x<y){
cout << "a" << " < " << "b" << endl;
}
else if(x>y){
cout << "a" << " > " << "b" << endl;
}
else {
cout << "a" << " == " << "b" << endl;
}
return 0;
} | #include<iostream>
#include<cstdio>
#include<ctime>
using namespace std;
template<class T>inline T sqr(T x){ return x*x; };
int a,b;
void solve(int a,int b){
if (a < b){
cout << "a < b" << endl;
}
else if (a == b){
cout << "a == b" << endl;
}
else{
cout << "a > b" << endl;
}
}
int main(){
std::cin >> a>>b;... | 1 | 97,254,328 |
#include <bits/stdc++.h>
using namespace std;
void takahasi(int &x, int &y){
if(x%2 ==1){
x -= 1;
x /= 2;
y += x;
}
else{
x /= 2;
y += x;
}
}
void aoki(int &x, int&y){
if(y%2 ==1){
y -= 1;
y /= 2;
x += y;
}
else{
y /=2;
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int a, b, c;
cin >>a >> b >> c;
for(int i=0;i<c;i++){
if(i%2==0){
b=b+(a/2);
a=a/2;
}
else{
a=a+(b/2);
b=b/2;
}
}
cout << a << " " << b <<endl;
} | 1 | 81,522,551 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deq... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void *wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned... | 1 | 18,037,399 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define acc_io cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(ll i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#defin... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> static void getin... | 1 | 57,650,073 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <limits.h>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#define ll long long
#define ull unsigned lo... | #include<stdio.h>
int main()
{
int h,n,a[100000];
int i,m=0;
scanf("%d %d",&h,&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
m+=a[i];
}
if(h-m<=0){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 1 | 36,141,793 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin >> A;
cin >> B;
cin >> C;
cin >> D;
int sum = 0;
if(A<B){
sum = sum+A;
}
else{
sum = sum+B;
}
if(C<D){
sum = sum+C;
}
else{
sum = sum+D;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int train = min(a, b);
int bus = min(c, d);
cout << train + bus << endl;
} | 1 | 37,217,899 |
#include <iostream>
#include <string>
using namespace std;
string s;
int m;
int h;
int main(){
while(1){
cin >> s;
if(s == "-") break;
cin >> m;
for(int i = 0; i < m; i++){
cin >> h;
s += s.substr(0, h);
s.erase(s.begin(), s.begin()+h);
}
cout << s << endl;
}
} | #include<iostream>
using namespace std;
#include<string>
int main() {
string str;
while (cin >> str && str != "-") {
int m;
cin >> m;
for (int i = 0; i < m; ++i) {
int h;
cin >> h;
h = str.size() - h;
string temp = "";
for (int j = str.size() - h; j < str.size(); ++j) {
temp += str[j];
}
... | 1 | 28,248,786 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int t,x;
cin >> t >> x;
double ans = (double)t / (double)x;
printf("%.5f\n", ans);
} | #include<bits/stdc++.h>
#define ll long long int
#define nl '\n'
using namespace std;
int main(void){
double t,n,b;
cin>>n>>b;
cout<<fixed<<setprecision(10)<<n/b;
} | 1 | 93,581,956 |
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <numeric>
using namespace std;
int main()
{
while (1)
{
char ch[1000];
char* pch;
pch = ch;
memset(ch, 0... | #include<iostream>
#include<cstring>
using namespace std;
int main()
{
char inputInt[2000];
while(true)
{
cin.getline(inputInt, 2000);
int length = strlen(inputInt);
int sum = 0;
if(length == 1 && inputInt[0] == '0')
break;
for(int i = 0;i < length;i++)
{
sum += inputInt[i] - '0';
}
cout << sum... | 1 | 73,835,728 |
#include<iostream>
#include<cmath>
using namespace std;
int min_one_way(int h, int w){
return min(h,w);
}
int min_two_way(int h, int w){
int divh = h/3;
int divw = w/2;
int s1 = divh*w;
int s2 = (h-divh)*divw;
int s3 = (h-divh)*(w-divw);
int min_horizon1 = min(min(s1,s2),s3);
int max_hor... | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t H,W;
cin>>H>>W;
int64_t ans=H*W;
for(int64_t i=1;i<W;++i){
int64_t j=H/2;
vector<int64_t> cho(3);
cho[0]=i*H,cho[1]=(W-i)*j,cho[2]=(W-i)*(H-j);
sort(cho.begin(),cho.end());
ans=min(ans,cho[2]-cho[0]);
}
for(int64_t i=1;i<H... | 1 | 69,901,767 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int N, Y; cin >> N >> Y;
for(int i = 0;i <= Y/10000; i++){
for(int j = 0; j <= (Y-i*10000)/5000; j++){
int tmp = i * 10000 + j * 5000;
... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N,S;
cin >> N >> S;
int x = -1, y = -1, z = -1;
for(int i = 0; i < N+1;i++){
for(int j = 0; j < N+1;j++){
if(N-(i+j) >= 0 & S == ( 10000*i + 5000*j + 1000*(N-(i+j)) )){
x = i;
y = j;
z = N - (i+j);
break;
... | 1 | 82,318,251 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin>>n;
int i=1;
while(1) {
i*=2;
if(i>n) {
cout<<i/2<<endl;
return 0;
}
}
} | #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() {
int n;
cin >> n;
int last = 1;
while (last * 2 <= n) {
... | 1 | 28,063,426 |
#pragma target("avx")
#pragma target("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | 1 | 31,697,073 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
int main(){
int n;
while(cin>>n&&n){
vector<string> vs(n);
rep(i,n)cin>>vs[i... | #include <bits/stdc++.h>
using namespace std;
int main(void){
while(true){
int n;
cin >> n;
if(n == 0) break;
bool floor = true;
bool r = true, l = true;
string f;
int cnt = 0;
for(int i = 0; i < n; ++i){
cin >> f;
if(f == "lu"){
l = false;
}
if(f == "ru"){
r = false;
}
if(f =... | 1 | 99,865,940 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
int N,L;
cin>>N>>L;
vector<int> a(N);
R... | #include<iostream>
using namespace std;
int main()
{
long long int a[100000],l,p,n,ans,j,i;
cin>>n>>l;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
ans=a[0]+a[1];
for(i=1;i<n;i++)
{
if(ans<a[i]+a[i+1])
{
ans=a[i]+a[i+1];
p=i;
}
}
if(an... | 1 | 50,593,884 |
#include<cstdio>
#include<iostream>
using namespace std;
int main(){
long long a,b;
scanf("%lld%lld",&a,&b);
if (abs(a-b)>1){
printf("Alice");
}
else printf("Brown");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void... | 1 | 24,922,444 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[6],i,minn=9,chk,c,ans=0;
for(i=0;i<5;i++){
cin>>a[i];
}
for(i=0;i<5;i++){
chk=a[i]%10;
if(chk!=0 && chk<minn){
minn=chk;
c=i;
}
}
for(i=0;i<5;i++){
if(i!=c){
... | #include<iostream>
#include<stdio.h>
using namespace std;
int main(void) {
int menu[5];
int diffMin = 10;
int last;
for (int i = 0; i < 5; i++) {
scanf("%d", &menu[i]);
if ((menu[i] - 1) % 10 < diffMin) {
diffMin = menu[i] % 10;
last = i;
}
}
int ans = 0;
for (int i = 0; i < 5; i++) {
if (i == last... | 1 | 12,674,069 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using ld = long double;
int main(){
ll n,m;
cin >> n ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int>a(n);
for(int i=0;i<n;i++) cin >> a.at(i);
while(m>0){
sort(a.begin(),a.end(),greater());
a.at(0)/=2;
m--;
if(m<=0) break;
for(int i=0;i<n;i++){
if(a.at(i)>a.at(0)){
a.at(i)/=2;
... | 1 | 14,279,904 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | #include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main() {
ll K,S; cin>>K>>S;
ll cnt=0;
for(ll i=K; i>=0; i--)... | 1 | 92,832,532 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, seisu, marume;
double avg;
cin >> a;
cin >> b;
avg = (a + b)/2.0;
seisu = (a + b)/2;
marume = (avg - seisu)*2;
cout << seisu+marume << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a=0,b=0,x=0;
cin >> a >> b;
x=(a+b)/2.0+0.5;
cout << x << endl;
} | 1 | 29,758,139 |
#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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include<bits/stdc++.h>
#define ts cout<<"ok"<<endl
#define ll long long
#define hh puts("")
using namespace std;
int n,m,d;
char s[]={'R','Y','G','B'};
inline int read(){
int ret=0,ff=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') ff=-ff;ch=getchar();}
while(isdigit(ch)){ret=ret*10+(ch^48);ch=getchar... | 1 | 69,022,388 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e9 + 5;
#define INF 100000000000
const int MOD = 1e9+7;
const double PI = 3.141592653589793238462... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
int cal(vector<int> &a, int n) {
vector<int> b(n);
for (int i = 0; i < n; i++) b[i] = i + 1;
int cnt = 1;
while (a != b) {
cnt++;
next_perm... | 1 | 40,731,918 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
... | #include <iostream>
using namespace std;
bool tst (int n, const string &s, const string &t, int pos) {
for (int i = 0; i + pos < n; i++) {
if (s[i + pos] != t[i]) return false;
}
return true;
}
int main () {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i < n; i++) {
if (tst(n, s, t, i))... | 1 | 23,291,554 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y, ll z){
if(y==0)
return 1;
else
{
ll p=power(x,y/2,z);
if(y%2==0)
return (p*p)%z;
else
return (x*((p*p)%z))%z... | 1 | 18,807,694 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n;
string s;
cin >> n >> s;
if(n%2==1)cout << "No" << endl;
else{
bool ok=true;
for(ll i=0;i<n/2;i++){
if(s[i]!=s[i+n/2])ok=false;
}
if(ok)cout << "Yes" << end... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define lin "\n"
#define fast_io ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(0)
void solve() {
int n;
cin>>n;
string s;
cin>>s;
if(n&1){
cout<<"No";
return... | 1 | 4,418,558 |
#include <stdio.h>
int main() {
int apple, piece, applePie;
scanf("%d %d", &apple, &piece);
applePie = ((apple*3)+piece)/2;
printf("%d", applePie);
return 0;
} | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << endl;
return;
}
template <typename First, typename... Rest>
void c... | 1 | 38,882,949 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
const ll ATCODER_AMARI = 1000000007;
const ll INF = 10000000000000;
ll factorial(ll k){
ll sum = 1;
for(int i = 1 ; i < k + 1; i++) {
sum *= i;
}
return sum;
}
ve... | #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... | 1 | 87,760,038 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n, t;
cin >> n >> t;
long long int a, b;
long long int total = 0;
cin >> b;
for (int i = 1; i < n; i++) {
cin >> a;
total += min(t, (a - b));
b = a;
}
cout << total + t;
}
int main() {
ios::sync_with_stdio(false);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, T;
cin >> n >> T;
vector<int> t(n);
for (int i = 0; i < n; i++) cin >> t[i];
int pushed = t[0];
int tot = 0;
for (int i = 1; i < n; i++) {
tot += min(T, t[i] - pushed);
pushed = t[i];
}... | 1 | 28,170,854 |
#include<bits/stdc++.h>
using namespace std;
#include <string>
int main(){
int k;
cin>>k;
string palabra;
cin>>palabra;
int tamano;
tamano=palabra.size();
if (tamano>k){
for(int i=0;i<k;i++){
cout<<palabra[i];
}
cout<<"...";
}
else{
cout<<palab... | #include<bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
int cnt=0;
for(int i=0;i<s.length();i++){
cnt++;
}
if(cnt<=k){
cout<<s<<endl;
}
else{
for(int i=0;i<k;i++){
cout<<s[i];
}
cout<<"..."<<endl;
}
return 0;
} | 1 | 56,143,375 |
#include<bits/stdc++.h>
using namespace std;
int a[10100],answer=0,n;
int main()
{
cin>>n;
for(int i=1; i<=2*n; i++)
cin>>a[i];
sort(a+1,a+1+2*n);
for(int i=1; i<=2*n; i+=2)
answer+=a[i];
cout<<answer<<endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void agc_a_bbq_easy(void) {
int n;
cin >> n;
vector<int>l(n * 2);
for (int i = 0; i < n * 2; i++) {
cin >> l[i];
}
sort(l.begin(), l.end());
int sum = 0;
for (int... | 1 | 96,908,264 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;
int main() {
int N; cin >> N;
vector<int> L(2 * N, 0);
for (int i = 0; i < 2 * N; i++) cin >> L[i];
sort(L.begin(), L.end(), greater<int>());
int sum = 0;
for (int i = 0; i < 2 * N... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <map>γγγγγγ
#include <iostream>
#include <queue>
#include <set>γγγγγγ
#include <string>γγγγγ
#include <vector>
using namespace std;
int n,a[210],ans=0;
int main(){
scanf("%d",&n);
for (int i=1;... | 1 | 62,694,779 |
#include <iostream>
#include <string>
#include <map>
int main()
{
std::map<std::string, int> count_map;
std::string str{};
int max_length = 0;
std::string max_str{};
while (std::cin >> str)
{
if (count_map.count(str) == 0)
{
count_map[str] = 1;
}
else
{
count_map[str]++;
}
if (max_length < str... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
class Word {
public:
char w[33];
int length;
int freq;
public:
Word() {
strcpy(w, "");
length = 0;
freq = 0;
}
};
int main()
{
char str[1001];
char buf[32];
char *p, *q;
fgets(str, 1001, stdin);
Word wl[32];
for ( p = str; (... | 1 | 44,744,598 |
#include <queue>
#include <string>
#include <vector>
#include <iostream>
using namespace std;
int H, W, N;
int main() {
cin >> H >> W >> N;
vector<string> s(H);
vector<int> x(N + 1), y(N + 1);
for (int i = 0; i < H; i++) {
cin >> s[i];
for (int j = 0; j < W; j++) {
if (s[i][j] == 'S') x[0] = j, y[0] = i;
... | #include <iostream>
#include <queue>
#include <stdlib.h>
using namespace std;
const int MAX_W = 1000;
const int MAX_H = 1000;
const int MAX_N = 9;
typedef pair<int, int> P;
int H,W,N;
char field[MAX_H][MAX_W];
int dist[MAX_H][MAX_W];
queue<P> que;
int limits = 99999;
void getStatus(int y, int x, int min_dist){
for(... | 1 | 5,006,819 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <algorithm>
#include <queue>
#include <string>
#include <map>
#include <iomanip>
#include <list>
#include <stack>
using namespace std;
typedef int INT;
#define int long long
INT main()
{
ios::sync_with_std... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main()
{
int N; cin >> N;
vector<int> a(N); REP(i, N) cin >> a[i];
sort(ALL(a));
int n = a[N-1], r = a[0], rr = n;
REP(i, N-1) {
if (rr >= abs(n/2-a[i]... | 1 | 63,591,909 |
#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... | #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<ll,ll>;
int main() {
ll q, h, s, d;
ll n;
cin >> q >> h >> s >> d >> n;
n *= 4;
vector<P> table = {{1, q}, {2, h}, {4, s}, {8, d}};
sort(table.begin(), table.end(), [... | 1 | 71,696,032 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 20;
int n, h[maxN], res(0);
bool c;
int main(){
cin >> n;
for (int i = 0; i < n; ++i) cin >> h[i];
for (int i = 0; i < n; ++i){
c = true;
for (int j = 0; j <= i; ++j){
if (h[j] > h[i]) c = false;
}
res += c;
}
cout << res;
} | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0;
int rec = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < i; j++) {
if (H[j] > H[i]) {
rec++;
break;
}
}
if (rec == 0) {
... | 1 | 53,127,347 |
#include <bits/stdc++.h>
using namespace std;
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define ALL( a ) (a).begin(), (a).end()
int dp[1001][1001] = {};
int main() {
int n; cin >> n;
int maxl;
string s1, s2;
REP( i, n ) {
cin >> s1 >>... | #include <cstdio>
#include <cstring>
#include <algorithm>
#define SIZE 1010
class TLcsSolver
{
int FTable[SIZE][SIZE];
const char* FArray1;
const char* FArray2;
const int Fn1;
const int Fn2;
int Count(int i, int j)
{
if(i == 0 || j == 0) return 0;
if(FArray1[i-1] == FArray2[j... | 1 | 99,134,147 |
#include <bits/stdc++.h>
#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)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1<<21;
const ll INF = 1LL << 60;
const ll mod = 1e9+7;
int main() {
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <tuple>
#include <math.h>
#include <set>
#include <map>
using namespace std ;
using ll = long long ;
using ld = long double ;
... | 1 | 25,584,832 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<int> a(9);
for (int i = 0; i < 9; i++) {
cin >> a.at(i);
}
int n;
cin >> n;
int b = 0;
for (int i = 0; i < n; i++) {
int bi;
cin >> bi;
for (int i = 0; i < 9; i++) {
if (a.at(i) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | 1 | 5,801,045 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
while(true){
int a[100000] = {0};
int n, k;
cin >> n >> k;
if(!n)
break;
for(int i = 0; i < n; i++){
cin >> a[i];
}
int ans = 0;
for(int j = 0; j < k; j++){
ans +... | #include <iostream>
using namespace std;
int main() {
while (true) {
int n, k;
cin >> n >> k;
if ((n | k) == 0) {
break;
}
int* a = new int [n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int* s = new int [n - k + 1];
... | 1 | 64,235,075 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T,a,b;
cin>>T;
while(T--)
{
cin>>a>>b;
int val=(int)sqrt(1ll*a*b);
int ans=2*(int)sqrt(1ll*a*b)-1;
if(1ll*val*val==1ll*a*b && a!=b)ans--;
if(1ll*val*(val+1)>=1ll*a*b)ans--;
printf("%d\n",ans);
}
} | #include <bits/stdc++.h>
using namespace std;
long long n,m,i,j,ans,x,y;
int main(){
cin>>n;
while (n--){
cin>>x>>y;
if (x==1&&y==1){
cout<<"0\n";
continue;
}
if (x==y||abs(x-y)==1){
cout<<(min(x,y)-1)*2<<endl;
continue;
}
ans=((long long)(sqrt(x*y)));
if (ans*ans>=x*y) ans--;
if (ans*(a... | 1 | 66,689,681 |
#include <iostream>
#include <vector>
#include <algorithm>
int main(int argc, char **argv){
int W = 0;
int H = 0;
int x = 0;
int y = 0;
int r = 0;
int tmpW = 0;
int tmpH = 0;
std::cin >> W >> H >> x >> y >> r;
tmpW = W - r;
tmpH = H - r;
if(r <= x && x <= tmpW && r <= y && y <= tmpH){
std::cout << "Yes";
... | #include<iostream>
#include<algorithm>
using namespace std;
main(){
int w,h,x,y,r,flag=0;
cin>>w>>h>>x>>y>>r;
if(x+r>w || x-r<0 || y+r>h || y-r<0)flag=1;
if(flag==1)cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | 1 | 83,604,752 |
#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<long long> VL;
typede... | #include<bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
double w,h;
cin>>w>>h;
double x,y;
cin>>x>>y;
double ans=(w*h)/2;
cout<<ans<<" ";
if(w/2==x && h/2==y)
cout<<"1";
else
cout<<"0";
return 0;
} | 1 | 7,368,046 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
int main() {
string S;
long long K;
cin>>S>>K;
string SS=S+S;
int S_num=0;
int SS_num=0;
int sflug=1, ssflug=1;
bool onazi=false;
rep(i,S.size()-1){
if(S[i]==S[i+1]){
sflug++;
... | 1 | 60,295,418 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 998244353
using namespace std;
ll fn(ll n, ll p) { return n - n % p; }
int main() {
ll k;
cin >> k;
vector<ll> a(k);
for(int i = 0; i < k; i++) {
cin >> a[i];
}
ll ans1, ans2;
ll l = 0, r... | #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 main() {
int K; cin >> K;
vector<ll> A(K);
REP(i, 0, K) cin >> A[i];
if (A.back() > 2) {
cout << -1 << endl;
... | 1 | 17,599,670 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B, C;
cin >> A >> B >> C;
cout << ((A.back() == B.front() && B.back() == C.front()) ? "YES" : "NO") << "\n";
} | 1 | 96,907,401 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t A, ans, B_dashdash;
double B, B_dash;
cin >> A >> B;
B_dash = B * 100 + 0.1;
B_dashdash = B_dash;
ans = (A * B_dashdash) / 100;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a;
double b;
cin >> a >> b;
ll c = round(b * 100.0);
cout << a * c / 100LL << '\n';
return 0;
} | 1 | 32,280,731 |
#include <iostream>
int main()
{
int x;
std::cin >> x;
if (x < 1200)
{
std::cout << "ABC";
}
else
{
std::cout << "ARC";
}
std::cout << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define rep2(i,m,n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x){
return x * x;
}
signed main (){
int x;
cin >> x;
i... | 1 | 28,020,827 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 1 | 91,503,933 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.