code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
temp... | #include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | 0 | 95,288,843 |
#include <cstdio>
using namespace std;
int n;
int a[80];
void solve() {
long money = 1000;
for (int i=0;i<n-1;i++) {
if (a[i] < a[i+1]) {
money += (a[i+1]-a[i]) * (long)(money/a[i]);
}
}
printf("%ld\n", money);
}
int main() {
scanf("%d", &n);
for (int i=0;i<n;i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL 1LL << 40;
#define INF 1 << 31;
#define MOD 1000000007;
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define prique priority_queue
typedef pair<int, int> P;
typedef vecto... | 0 | 98,295,838 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int row1, col1, row2, col2;
cin >> row1 >> row2;
col1 = row1;
col2 = row2;
vector<string> vec(row1);
vector<string> vec2(row2);
for (int i = 0; i < row1; i++) cin >> vec.at(i);
for (int i = 0; i < row2; i++) cin >> vec2.at(i);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans *= A - i;
}
for (int i = ... | 0 | 59,271,671 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> llVEC;
typedef vector<P> PVEC;
typedef priority_queue<P,PVEC,greater<P> > PPQ;
typedef priority_queue<ll, llVEC, greater<ll> > llPQ;
#define rep(i,a,n) for(ll i = a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
const ll C = 1000000000+7;
int main() {
int N, K;
cin >> N >> K;
ll ans = 0;
if(K % 2 == 1) {
ll x = N / K;
... | 0 | 71,725,634 |
#include<iostream>
using namespace std;
int main(){
int num;
cin >> num;
bool A[num+1][num+1];
for(int i=1; i<=num; i++){
for(int j=1; j<=num; j++){
A[j][i] = false;
}
}
for(int i=1; i<=num; i++){
int node;
int n;
cin >> node >> n;
for(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec... | 0 | 69,321,882 |
#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 maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l... | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define ALL(a) a.begin(), a.end()
#define REP(i,a) for(ll i(0), _##i(a); i < _##i; ++i)
#define FOR(i,a,b) for(ll i(a), _##i(b); i <= _##i; ++i)
using namespace std;
using ll = long long;
void solve(){
string s;
cin >> s;
int n =... | 0 | 95,073,695 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N - 1);
vector<int> C(N - 2);
cin >> A.at(0);
int ans = abs(A.at(0));
for (int i = 1; i < N; i++) {
cin >> A.at(i);
B.at(i - 1) = abs(A.at(i) - A.at(i - 1));
ans += B.at(i - 1);
}
... | #include <bits/stdc++.h>
using namespace std;
#define REPI(x) for(int i=0;i<x;i++)
#define REPJ(x) for(int j=0;j<x;j++)
#define SCANFD(x) scanf("%d",&x)
int main(){
int N;
int a[200000];
long long x,y;
long long res;
scanf("%d",&N);
for(int i=0;i<N;i++)
scanf("%d",&a[i]);
x=a[0];... | 0 | 41,835,704 |
#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()
{
string a,b; cin >> a >> b;
if (a[0] == b[2] && a[1] == b[1] && a[2] == ... | #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),... | 0 | 95,017,753 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define MAX 305
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
ll INF=1ll<<55;
int n, k;
int H[MAX];
ll dp[MAX][MAX];
int main(){
cin >> n >> k;
rep(i,n){
cin >> H[i+1];
}
... | #include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(is... | 0 | 88,060,283 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char b;
cin >> b;
vector<char> c(128);
c.at('A')='T';
c.at('T')='A';
c.at('G')='C';
c.at('C')='G';
cout << c.at((int)b) << endl;
} | #include <iostream>
#include <cctype>
#include <stdio.h>
using namespace std;
int main(void){
char ch;
while(1){
scanf("%c", &ch);
if(islower(ch)){
cout << static_cast<char>(toupper(ch));
}else if(isupper(ch)){
cout << static_cast<char>(tolower(ch));
}els... | 0 | 24,340,989 |
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
int n; string a[36], b[36];
int main() {
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(b[j - 1][1] > b[j][1]) swap(b[j - 1], b[j]);
}
}
for(int i ... | #include <iostream>
#include <cctype>
#define MAX_LEN (1200)
using namespace std;
int main()
{
char* str = new char[MAX_LEN + 1];
int* counter = new int[26];
for (int i = 0; i < 26; i++) {
counter[i] = 0;
}
while (cin >> str) {
for (int i = 0; str[i] != '\0'; i++) {
... | 0 | 66,746,191 |
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <list>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <map>
using namespace std;
int main(){
int n;
char str[10], com[13];
map<string,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(de... | 0 | 56,026,183 |
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>
#include <fstream>
#include <array>
#include <utility>
#include <functional>
using namespace std;
typedef long long Int;
#define REP(i , x) for(int i = 0 ; i < x ; ++i)
typedef pair<int, int> P;
Int a = 100000;... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 21,488,224 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
string s;
cin >> s;
ll k;
cin >> k;
int ans;
ll n=s.size();
if(k<=n){
for(int i=0;i<k;i++){
if(s[i]!='1'){
ans=s[i]-'0';
break;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 0 | 184,809 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
void compress(vector<int> &a){
vector<int> b = a;
sort(b.begin(), b.end());
for(auto &x : a){
x = lower_bound(b.begin(), b.end(), x) - b.begin();
}
}
int main(){
ios::sync_with_stdio(false)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const int N = 3e2+6;
const int mod = 1e9+7;
const int inf = 1e8;
int g[N][N];
int edg[N*10][3];
void solve(){
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++){
... | 0 | 60,890,335 |
#include <iostream>
using namespace std;
int main() {
int n,x,y;
while(true)
{
y=0;
cin>>n>>x;
if(n==0 && x==0) break;
for(int i=n;i>=3;i--)
{
for (int j = i-1; j>=2; --j)
{
for (int k = j-1; k >=1; --k)
{
if (i+j+k==x) y=y+1;
}
}
}
cout<<y<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){ if(b==0) return a; return gcd(b,a%b);}
ll lcm(ll a,ll... | 0 | 99,764,837 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define sz(v) (int)((v).size())
#define pb push_back
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
string r, b; cin >> r >> b;
int nr, nb; cin >> nr >> nb;
string u; cin >> u;
if (u==r) ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
int i = 0;
int cnt = 0;
while (1) {
if (cnt >= n) {
cout << -1 << endl;
return 0;
}
el... | 0 | 28,735,877 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s1, s2, s3;
char dif = 'A' - 'a';
cin >> s1 >> s2 >> s3;
char s11 = s1[0] + dif;
char s22 = s2[0] + dif;
char s33 = s3[0] + dif;
cout << s11 << s22 << s33 << endl;
} | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
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", &x); retur... | 0 | 59,849,559 |
#include<iostream>
int main(){
int n;
std::cin>>n;
int a=1;
if(n<=12){
for(int i=1;i<=n;i++){
a*=i;
}
std::cout<<a<<std::endl;
}
else if(n==13)std::cout<<355687428096000/16/15/14/13<<std::endl;
else if(n==14)std::cout<<355687428096000/16/15/14<<std::endl;
else if(n==15)std::cout<<355687428096000/16/15<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
const int mod=1000000007;
int main(){
int n,m;cin>>n>>m;
vector<int> a(n+1,-1);
rep(i,m){
int x;cin>>x;
a[x]=0;
}
a[0]=1;
if(a[1]==-1)a[1]=1;
for(int i=2;i<=n;i... | 0 | 89,725,599 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
signed main()
{
SPEED;
int n,k;
cin>>n>>k;
int a[n],dp[n+1]={0};
for(int i=0;i<n;i++)
{
cin>>a[i];
}
dp[1]=abs(a[1]-a... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int (i)=(a);(i)<(int)(b);++(i))
#define RREP(i,a,b) for(int (i)=(a);(i)>=(int)(b);--(i))
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int Maxn = 100010;
bool fix[Maxn];
int h[Maxn];
int main(){
int n;
cin >> n... | 0 | 12,413,860 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define PI 3.141592653589793238
#define dbg(n) cout<<#n<<' '<<n<<endl;
#define dbg_v(v) cout<<#v<<":";for(int i=0;i<(int)v.size();i++) cout<<" "<<v[i]; ... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define mod 1000000007... | 0 | 65,317,541 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 82,376,740 |
#include <iostream>
using namespace std;
int main(void){
int a,b,c;
int num;
cin >> a >> b >> c;
if(a > b)
{
num = b;
b = a;
a = num;
}
if(b > c)
{
num = c;
c = b;
b = num;
}
if(a > b)
{
num = b;
b = a;
a... | #include <bits/stdc++.h>
using namespace std;
int h, w, n;
char m[1010][1010];
int d[1010][1010];
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
void init()
{
for (int i = 0; i < h; i++){
for (int j = 0; j < w; j++){
d[i][j] = 1e9 + 9;
}
}
}
int main()
{
int sx, sy;
cin >> h >> w >> n;
for (int... | 0 | 57,846,453 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
#define INF 1000000000000;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i,n) cin >> h[i];
long long dp[110000];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = INF;
for (int j =... | #include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll... | 0 | 68,236,785 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int INF = 1005;
const int MAXN = 105;
const int MAXM = 1005;
int G[MAXN][MAXN];
int U[MAXM], V[MAXM], W[MAXM];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b, c;
cin >> a >> b >>... | 0 | 62,754,639 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> kind(M);
for (int i = 0; i < M; ++i) cin >> kind[i];
sort(kind.begin(), kind.end());
vector<int> dp(N+1, N); dp[0] = 0;
for (int i = 0; i < M; ++i)
for (int j = kind[i]; j ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define PI acos(-1.0)
#defin... | 0 | 68,032,843 |
#include <iostream>
#include <algorithm>
using namespace std;
int main (void) {
int n[5];
for (int i = 0; i < 5; i++) {
cin >> n[i];
}
for (int i = 0; i < 5; i++) {
for (int j = i + 1; j < 5; j++) {
if (n[i] < n[j]) {
swap(n[i], n[j]);
}
}
... | #include<iostream>
#include<map>
#include<algorithm>
using namespace std;
int main() {
int n; cin >> n;
map<int, int>a;
for (int i = 0; i < n; i++) {
int tmp; cin >> tmp;
a[tmp]++; a[tmp - 1]++; a[tmp + 1]++;
}
int ans = 0;
for (auto&& x : a) {
ans = max(ans, x.second);
}
cout << ans << endl;
return 0;
} | 0 | 74,191,515 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
set<int> s;
rep(i,n) s.insert(a[i]);
if(s.size() == n) cout << "YES" << endl;
else cout << "NO" << end... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | 0 | 35,539,472 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#include <map>
#include <cmath>
#include <string>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define Co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string S;
cin >> S;
string ans;
if (S.size() < 26)
{
vector<int> dic(26, 0);
for (int i = 0; i < S.size(); i++)
{
int val = (int)(... | 0 | 11,569,577 |
#include <bits/stdc++.h>
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 mod=1000000007;
int n;
cin >> n;
long to=0;
vector<int>a(n);
vector<int>b(n);
vector<int>c(n);
rep(i,n){
cin>>a.at(i)>>b.at(i)... | #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 | 9,943,393 |
#include <stdio.h>
long long p = 1000000007;
long long x, y, z;
long long rui(long long a,long long b) {
if (b == 0)return 1;
if (b == 1)return a;
if (b == 2)return a * a % p;
if (b % 2)return rui(rui(a, b / 2), 2) * a % p;
else return rui(rui(a, b / 2), 2);
}
int main() {
scanf("%lld%lld", &x, &y);
if ((x + y) ... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#define rep(i,j) for(i=0;i<j;i++)
using namespace std;
typedef int Natural;
class UnionFindTree
{
public:
Natural Node_num;
Natural *parents;
Natural *ranks;
UnionFindTree(Natural n):Node_num(n+1)
{
n++;
parents=new Natural[n];
ranks=new Natura... | 0 | 75,346,440 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, a, b) for(ll i = ll(a); i <= ll(b); i++)
int main()
{
string s,num;
cin>>s;
ll d,min_d=9999,n;
REP(i,0,s.size()-3)
{
num=s.substr(i,3);
n=stol(num);
d=abs(753-n);
min_d=min(d,min_d);
num.erase(num.b... | #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 db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | 0 | 35,657,958 |
#include <iostream>
using namespace std;
int main(void){
string a,b;
cin>>a>>b;
if(a==b){
cout<<"H"<<endl;
}
else if(a=="D"&&b=="H"){
cout<<"D"<<endl;
}
else if(a=="H"&&b=="D"){
cout<<"D"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
int main()
{
int n, s, i, j, ans, sum, num;
while(cin >> n >> s, n + s){
ans = 0;
for(i = 0; i < (1 << 10); i++){
num = sum = 0;
for(j = 0; j < 10; j++){
if(1 << j & i){
num++;
... | 0 | 57,754,641 |
#include "bits/stdc++.h"
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define pb push_back
#define DEBUG false
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<int,ll>;
cons... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
void solve()
{
int x, a;
cin >> x >> a;
if (x < a )
cout << 0;
else
cout << 10;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
... | 0 | 11,546,757 |
#include <bits/stdc++.h>
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
template <typename T>
void view(T e) { std::cout << e << std::endl; }
template <typename T>
void view(const std::vector<T>& v) ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 6;
const int inf = 0x3f3f3f3f;
const ll mod=1e9+7;
ll prime[maxn],v[maxn],phi[maxn];
ll sphi[maxn];
ll m=0;
void euler(ll n){
memset(v,0,sizeof(v));
m=0;
for(ll i=2;i<=n;i++){
if(v[i]==0){
v[i]=i;
prime[++m]=... | 0 | 96,687,367 |
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
const int maxn = 1<<18;
int n, h, w;
set<pair<int, int>> present, cnt[10];
int sum(int i, int j) {
if(i <= 0 || i+2>h || j <= 0 || j+2>w) return 0;
int ans = 0;
for(int a = 0; a < 3; a++)
for(int b = 0; b < 3; b++)... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<map>
#define ll long long
using namespace std;
int n;
int a[300000];
int MAXN = 2147483647;
map<ll,int> mp;
ll len=0;
void init()
{
scanf("%d",&n);
for (int i=0; i<n; ++i)
scanf("%d",&a[i]);
}
void clearLen(int i)
{
f... | 0 | 59,099,744 |
#include <bits/stdc++.h>
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;
while (1) {
if (*max_element(h.begin(), h.end()) == 0) break;
int l = 0;
while (h[l] == 0) l++;
int r = l + 1;
... | #include<bits/stdc++.h>
#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;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 0 | 51,273,609 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <iostream>
using namespace std;
int main()
{
double D,S,T,A;
cin>>D;
cin>>S;
cin>>T;
A=D/S;
if(T>=A)
{
cout<<"Yes";
}
else if(T<A)
{
cout<<"No";
}
return 0;
} | 0 | 44,539,245 |
#include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
std::printf("%d\n", N / 3);
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
char tbl[100][100];
int main(){
long a,b;
cin >> a >> b;
for(int i=0; i<50; i++){
for(int j=0; j<100; j++){
tbl[i][j] = '.';
tbl[50+i][j] = '#';
}
}
int count=1;
for(int i=0; i<50... | 0 | 62,685,443 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
scanf("%d %d",&a,&b);
if(b%2==0 && b>=a*2 && b<=a*4){
cout<<"Yes";
}
else{
cout<<"No";
}
} | 0 | 37,346,893 |
#include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1e9;
int main()
{
int n,m;
cin >> n >> m;
bool g[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
g[i][j] = false;
}
}
for(int i=0;i<m;i++){
int a,b;
cin >> a >> b;
g[a-1][b-1] = true;... | 0 | 1,791,051 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a, b;
cin >> a >> b;
cout << (a == 'H' ? (b == 'H' ? 'H' : 'D') : (b == 'H' ? 'D' : 'H')) << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long f... | 0 | 58,246,988 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll INF = 987654321987654321;
int main()
{
int N, K;
ll ans = -INF;
cin >> N >> K;
vector<int>P(N), C(N);
for (auto&i : P)
{
cin >> i;
i--;
}
for (auto&i : C)cin >> i;
for (int i = 0; i < N; i++)
{
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
map<ll,int> ma;
rep(i,n){
int a; cin >... | 0 | 32,407,236 |
#include <iostream>
int solve(int n, int x) {
int n_combis = 0;
for (int a = 1; a <= n; a++) {
for (int b = a + 1; b <= n; b++) {
for (int c = b + 1; c <= n; c++) {
if (a + b + c == x) {
n_combis++;
}
}
}
}
retur... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb()
{
fact[0] = fact[1] = 1;
... | 0 | 37,563,858 |
#include<bits/stdc++.h>
using namespace std;
int flag[1001];
map<int,int>mp;
map<int,int>mp1;
int main()
{
string s,s1;
int c=0;
cin>>s>>s1;
if(s[0]==s1[0])
c++;
if(s[1]==s1[1])
c++;
if(s[2]==s1[2])
c++;
cout<<c<<"\n";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 0 | 8,532,040 |
#include <algorithm>
#include <iostream>
#include <vector>
int main()
{
int n, k;
std::cin >> n >> k;
if (k == 1) {
std::cout << 0 << std::endl;
} else {
std::cout << n - k << std::endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
for(int I=0;I<n;I++){
string a=" ";
string b=" ";
string c;
cin >> c;
a+=c;
cin >> c;
b+=c;
int dp[a.size()][b.size()];
for(int i=0;i<a.size();i++){
for(int j=0;j<b.size();j++){
if(i==0||j==0)dp[i]... | 0 | 57,754,490 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,l,t;
scanf("%d%d%d",&n,&l,&t);
int x[n], w[n];
for (int i =0 ; i < n; i++){
scanf("%d%d",&x[i],&w[i]);
if (w[i] == 2) w[i] = -1;
}
int finalpos[n];
int P[n];
for (int i = 0; i < n; i++){
finalpos[i] =... | 0 | 88,673,358 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
char ch;
int i , x , y , total[26]={0};
while( cin >> ch ){
if( isupper(ch) )
ch = tolower(ch);
x = ch - 'a';
total[x] ++;
}
for( i=97 ; i<=122 ; i++ ){
printf("%c : %d\n" , i , total[i-97] );
}
} | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | 0 | 54,340,457 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t;
cin >> s >> t;
int size = min(s.size(),t.size());
for (int i=0; i<size; i++) {
cout << s.at(i) << t.at(i);
}
if (s.size() > t.size()) {
cout << s.at(s.size()-1) << endl;
} else if (s.size() < t.size()) {
cout << t.at(t.size... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.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;
}
templ... | 0 | 56,871,201 |
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | #include <bits/stdc++.h>
using namespace std;
int n,m;
long long tmp;
long long sum = 0;
priority_queue<long long> q;
int main() {
cin >> n >> m;
for (int i = 0; i < n; ++i) {
cin >> tmp;
q.push(tmp);
}
for (int i = 0; i < m; ++i) {
tmp = q.top();
q.pop();
q.push(... | 0 | 12,921,517 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 45,358,645 |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef pair < ll , ll > pp;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
int A[N],n,i,mx,a,b;
main(){
cin >> n;
for(i=1;i<=n;i++) { cin >> A[i]; mx = max(A[i] , m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Speed ios_base::sync_with_stdio(false); cin.tie(NULL)
int main()
{
ll n;
cin>>n;
vector<ll> A;
map<ll,ll> mp;
for(ll i=0;i<n;i++)
{
ll c;cin>>c;
A.push_back(c);
}
for(ll i=0;i<n;i++)
{
... | 0 | 83,629,220 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep( i, n, m ) for(int i = ( n ); i < ( m ); i++)
#define rep_d( i, n, m ) for(int i = ( n ) - 1; i >= ( m ); i--)
#define sort_asc( X ) sort(( X ).begin(), ( X ).end())
#define sort_desc( X ) sort(( X ).begin(), ( X ).end(), greater <>())
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FO... | 0 | 38,708,442 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<int, int>
#define F first
#define S second
#define mod 1000000007
#define MOD 998244353
#define INF 40000000000000000
int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const long double PI = acos(-1);
#define chmin(i, j) i = min(i, j);
#define chmax(i, j) i = max(i, j);
#define rep(i, n) for(int i=0;i<n;i++)
ll MOD = 1000000007;
ll fact(ll m) {
if(m == 0 || m == 1) return 1LL;
else retur... | 0 | 86,632,385 |
#include<iostream>
using namespace std;
int n;
int main(){
while(cin>>n){
if(n==0)break;
int s[110]={},ma=0,mi=1001,cn=0;
for(int i=0;i<n;i++){
cin>>s[i];
if(s[i]>ma){
ma=s[i];
}
if(s[i]<mi){
mi=s[i];
}
cn+=s[i];
}
cout<<((cn-mi)-ma)/(n-2)<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define INFLL (0x3f3f3f3f)
using namespace std;
typedef long long ll;
ll A[100055];
ll Mx, T, L = INFLL;
int N;
int main() {
cin >> N;
for(int i = 0; i < N; i++) {
cin >> A[i];
if(Mx < A[i]) Mx = A[i];
}
for(int i = 0; i < N; i++) {
ll t = abs(A[i]*2 - Mx);
if(L <= t || Mx == A[i]) ... | 0 | 72,731,659 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for(int i = 0; i < N; i++) {
cin >> a.at(i);
if(a.at(i) == 2) {
}
}
int count = 0;
int x = a.at(0);
while(count < N) {
if(x != 2) {
count++;
x = a.at(x-1);
} else {
cout <... | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | 0 | 21,859,411 |
#include <iostream>
#include <vector>
using namespace std;
void func(int start,int num,int current);
int s,res;
int main(void){
int n;
cin >> n; cin >> s;
while(n!=0 || s!=0){
res = 0;
func(0,n,0);
cout << res << endl;
cin >> n; cin >> s;
}
return 0;
}
void func(int start,int num,int current){... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 86,146,637 |
#include <iostream>
using namespace std;
void printA(int A[], int N){
for(int i = 0; i < N - 1; ++i){
cout << A[i] << " ";
}
cout << A[N - 1] << "\n";
}
int selectionSort(int A[], int N){
int nSwap = 0;
for(int i = 0; i < N - 1; ++i){
int minIdx = i;
for(int j = i; j < N; ++j... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long q,h,s,d;cin>>q>>h>>s>>d;
long long low=min(8*q,min(4*h,min(2*s,d)));
long long n;cin>>n;
if(n==1){
long long one=min(s,min(h*2,q*4));
cout<<one<<endl;
}else{
long long price;
if(n%2==0) price=low*n/2... | 0 | 2,756,581 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a[200000];
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
long long sum1=a[0],sum2=accumulate(a+1,a+n,0ll),ans=abs(sum2-sum1);
for(int i=1;i<n-1;i++){
sum1+=a[i];
sum2-=a[i];
ans=min(ans,abs(sum2-sum1));
}
cout<<ans<<endl;
} | #include <iostream>
#include <vector>
#include <bits/stdc++.h>
#define rep(i, n) for (int i{ 0 }; i < n; ++i)
using namespace std;
int main() {
int i_s;
cin >> i_s;
vector<int> v(4);
rep(i, 4) {
v.at(3 - i) = i_s % 10;
i_s = (i_s - v.at(3 - i)) / 10;
}
rep(i, 1 << 3) {
in... | 0 | 86,658,170 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n + 1, 0);
for (ll i = 1; i <= n; ++i)cin >> a[i];
for (ll i = 1; i <= n; ++i)a[i] += a[i - 1];
vector<ll> now;
for (ll i = 0; i <= n; ++i) {
for (ll j = i + 1; j <= n; ++j) {
now.push_back(a... | #include <stdio.h>
int main(){
int stay,i,a,cou;
char m1[3],m2[3];
while(1){
scanf("%d",&a);
if(a==0)break;
stay=0;
cou=0;
for(i=0;i<a/2;i++){
scanf("%s %s",m1,m2);
if(stay==0&&m1[1]=='u'&&m2[1]=='u'){
cou++;
stay=1;
}else if(stay==1&&m1[1]=='d'&&m2[1]=='d'){
cou++;
stay=... | 0 | 17,460,802 |
#include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int main()
{
map<string, int> Map;
string str;
string max, freq;
while (cin >> str){
Map[str]++;
if (Map[max] < Map[str]){
max = str;
}
if (freq.size() < str.size()){
freq = str;
}
}
cout << max << " " ... | #include <iostream>
#include <cstdio>
int main(){
int m,f,r,sum=0,i=0,count;
char res[256];
while(1){
std::cin>>m>>f>>r;
if(m==-1&&f==-1&&r==-1)break;
if(m==-1||f==-1)res[i]='F';
else{
sum=m+f;
if(80<=sum)res[i]='A';
if(65<=sum&&sum<80)res[i]='B';
if(50<=sum&&sum<65)res[i]='C';
if(30<=sum&&sum... | 0 | 61,791,814 |
#include <iostream>
#include <vector>
using namespace std;
int n, k;
bool alln(vector<int>& v){
for(int i=0;i<n;++i) if(v[i]!=n) return false;
return true;
}
void simulate(vector<int>& v){
int cnt = 0;
vector<int> tmp(n+1, 0);
for(int i=0;i<n;++i) {
tmp[max(0, i-v[i])]++;
tmp[min(n, i+v[i]+1)]--;
}
... | #include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<long long> A(N);
for (int i = 0; i < N; i++) std::cin >> A[i];
long long xor_A = 0;
for (int i = 0; i < N; i++) xor_A ^= A[i];
std::vector<long long> v(N);
for (int i = 0; i < N; i++) v[i] = A[i] & ~xor_... | 0 | 63,536,023 |
#include <iostream>
using namespace std;
int main()
{
int n, t, c[6] = {500, 100, 50, 10, 5, 1}, i, s, m, u;
while (cin >> n && n)
{
t = 1000 - n;
m = 0;
while (t)
{
if (t >= 500) s = 0;
else if (t >= 100) s = 1;
else if (t >= 50) s = 2;
else if (t >= 10) s = 3;
else if (t >= 5) s = 4;
els... | #include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define M 1000000007
#define pb push_back
#define p_q priority_queue
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,l... | 0 | 40,071,512 |
#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() {
string s,t,ans;
cin >> s >> t;
ans = t+s;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int H, W;
cin >> H >> W;
vector<vector<char>> list(H, vector<char>(W));
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++)
cin >... | 0 | 80,201,226 |
#include <iostream>
#include <vector>
using namespace std;
double gaiseki(double x1,double y1,double x2,double y2){
double ab;
ab = x1*y2 - y1*x2;
if (ab>=0)
ab=1;
else
ab=-1;
return ab;
}
int main() {
double x1,y1,x2,y2,x3,y3,xp,yp;
while(cin >>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){
if ( ( gaiseki(x1-x2,y1-y2,... | #include <iostream>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(n);++i)
#define in(v) cin>>v;
#define out(v) cout<<v<<"\n"
template<typename Iterator>void print(const Iterator &s, const Iterator &t) { for(auto it=s;it+1!=t;++it)cout<<*it<<" ";cout<<*(t-1)<<"\n"; }
const int MOD = 1e9+7;
i... | 0 | 51,727,006 |
#include <bits/stdc++.h>
using namespace std;
int sumdigit(int n) {
int s = 0;
while (n != 0)
{
s += n % 10;
n /= 10;
}
return s;
}
int main() {
int n, a, b, s = 0;
cin >> n >> a >> b;
for (int i = 1; i <= n; i++)
if (sumdigit(i) >= a && sumdigit(i) <= b) s += i;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define READ(X) cin>>X;
#define READV(X) long long X; cin>>X;
#define READAR(A,N) long long A[N]; fo... | 0 | 35,497,934 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<map>
using namespace std;
int main() {
int N; cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
vector<long long> s(N + 1);
map<long long, long long> m;
s[0] = 0;
m[0] = 1;
for (int... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main()
{
int n; string s;
cin >> n;
string ans = "";
int c1[26], c2[26] = {0};
fill_n(c1, 26, 100);
for(int i = 0; i < n; i++){
cin >> s;
for(int j = 0; j < s.si... | 0 | 19,658,810 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <list>
#include <set>
#include <queue>
#include <iterator>
#include <bitset>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#define ll long long
#define _ ios_base::sync_with_stdio(0);cin.tie(... | 0 | 80,417,120 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i = 0; i < (ll)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
int a, b;
a = n / 2;
b = a + 1;
vector<bool> sa(n, false);
rep(i, m) {
cout << a+1 << ' ' << b+1;
cout << endl;
a--;
b++;
a %... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, ... | 0 | 14,328,980 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
ll ans=0;
for(int i=0;i<n;i++) {
for(int j=i+1;j<n;j++){
ans+=a[i]*a[j];
}
}
cout<<ans<<"\n";
return 0;
} | #include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
using namespace std;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int OFF = (1 << 20);
int n;
ll a, b;
int main () {
cin >> n;
ll sol = 0;
for (int i = 1; i <= n; i++) {
ll tren = ... | 0 | 1,566,963 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pf(n) printf("%d\n",n)
#define pff(a,b) printf("%d %d\n",a,b);
typedef long long ll;
typedef p... | #include <iostream>
using namespace std;
int main(){
int n, x;
while(cin >> n >> x){
int cnt = 0;
if(n == 0 & x == 0) break;
for(int i = 1; i < n - 1;i++){
for(int j = i + 1; j < n; j++){
for(int k = j + 1; k <= n;k++){
if(i + j + k == x) cnt++;
}
}
}
cout << cnt << endl;
}
return 0;
} | 0 | 79,287,769 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | #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,m,x;
cin>>n>>m>>x;
vector<int>c(n),sum(m);
vector<vector<int>>a(n,vector<int>(m));
rep(i,n){
cin>>c[i];
rep(j,m){
cin>... | 0 | 11,644,858 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <sstream>
#include <iomanip>
using namespace std;
#define mkp make_pair
#define e... | 0 | 81,759,061 |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define ... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(... | 0 | 34,199,871 |
#include<math.h>
#include<map>
#include<iostream>
#include <algorithm>
#include <string>
#include<vector>
#include<array>
#include<tuple>
#include<queue>
#include<stack>
#include<iomanip>
#include<bitset>
using namespace std;
vector<int> _prime;
vector<int> build_prime_table(int max) {
vector<int> table = vector<int>(... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define all(a) a.begin(),a.end()
#define x first
#define y second
#define MOD 1000000007
typedef vector<int> vi;
typedef vector<vi> vvi... | 0 | 69,190,131 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
int inputNumber;
cin >> inputNumber;
d = inputNumber % 10;
inputNumber /= 10;
c = inputNumber % 10;
inputNumber /= 10;
b = inputNumber % 10;
inputNumber /= 10;
a = inputNumber;
if (b != c) {
cout << "No" << end... | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, val;
cin >> n;
unordered_map<int, int> cnt;
for(int i = 0; i < n;... | 0 | 47,005,505 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main() {
int n;
while(cin >> n, n) {
bool l=false, r=false;
bool state = false;
int cnt = 0;
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | 0 | 32,796,955 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0)
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define int long long
const int MOD=1e9+7;
const int N=1e5+5;
int32_t main()
{
IOS;
int a[]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <numeric>
#include <cstring>
#include <cmath>
#include <set>
#include <queue>
#include <stack>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
#define rep(i, n) for... | 0 | 75,197,096 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define DEBUG(x) cout<<#x<<": "<<x<<e... | #include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<map>
#include<functional>
#include<set>
#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i... | 0 | 40,308,987 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
bool ok = true;
if (s[0] != 'A') ok = false;
rep(i,26) if (s[1] == 'A' + i || s[n-1] == 'A' + i) ok = false;
string t = s.substr(2,n-3);
int cnt = 0;
rep(i,t.size(... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
typed... | 0 | 6,527,808 |
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main(void){
long long n;
cin >> n;
long long sum=n-1;
for(long long i=sqrt(n); i>1; i--){
if(n%i==0){
sum = min(sum, i + n/i -2);
}
}
cout << sum << endl;
} | #include<stdio.h>
int main(){
int a,b,c,x,y,z;
scanf("%d %d %d",&a,&b,&c);
if(a<b){
x=a;
y=b;
}else{
x=b;
y=a;
}
if(y<c){
z=c;
}else{
z... | 0 | 73,262,301 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn=1e5+10,mod=1e9+7;
const ll inf=1e18;
pair<ll,int> p[maxn];
map<ll,vect... | 0 | 39,924,323 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <cstdio>
#define REP(i, n) for (i = 0; i < (n); i++)
#define FOR(i, a, b) for (i = (a); i < (b); i++)
using namespace std;
int main()
{
int a, b, i, j;
while (scanf("%d%d", &a, &b), (a + b)){
int n, x, y;
int dp[20][20] = {0};
bool flag[20][20] = {false};
dp[0][1] = 1;
scanf("%d", &n);
... | 0 | 95,684,637 |
#include<bits/stdc++.h>
using namespace std;
vector<int>p;
vector<int>rank;
void shokika(int size){
rank.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++){
p[i]=i;
rank[i]=0;
}
}
int find(int x){
if(x==p[x])
return x;
return p[x]=find(p[x]);
}
int same(int x,int y){
if(find(x)==find(y)... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,k;
ll ans,t;
int main(){
scanf("%d%d",&n,&k);
ans=n/k;
ans=ans*ans*ans;
if(k%2==0)t=(n+k/2)/k,t=t*t*t;
cout<<ans+t;
return 0;
} | 0 | 39,068,872 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | #include <bits/stdc++.h>
#include<chrono>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
using namespace chrono;
const ll mod = 1000000007;
const ll N = 300... | 0 | 82,092,805 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
int a[N], b = 0;
vector<vector<bool>> dp1(N+1,vector<bool>(K+1)),dp2(N+1,vector<bool>(K+1));
dp1[0][0] = true;
for (int i = 0; i < N; i++) {
cin >> a[i];
a[i] = min(a[i],K);
for (int j = 0; j <= K; j++) {
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
ll a,b;
cin >> a >> b;
ll A=0,B=0,C=0;
for(ll i=0;i<n;i++){
ll p;
cin >> p;
if(p<=a) A++;
else if(p<=b) B++;
else C++;
}
ll ans=m... | 0 | 12,366,165 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod = 1e9+7;
using P = pair... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int m... | 0 | 81,431,475 |
#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <limits.h>
#include <queue>
#include <math.h>
#include <iostream>
#define FOR(i, x, y) for (int i = x; i <= y; i++)
#define REPEAT(_N) for (int _i = 0; _i < _N; _i++)
using namespace std;
inline bool Read(int &a) { return scanf("%d", &a) != EOF; }
cons... | #include <iostream>
using namespace std;
struct card{
char suit;
int value;
};
void selection(struct card a[], int n){
for (int i=0; i<n; i++){
int minj=i;
for (int j=i; j<n; j++){
if (a[j].value <a[minj].value){
minj=j;
}
}
swap(a[i],a... | 0 | 30,828,262 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll q, h, s, d;
cin >> q >> h >> s >> d;
ll n;
cin >> n;
h = min(2*q, h);
s = min(2*h, s);
d = min(2*s, d);
cout << (n/2*d + (n&1)*s) << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... | 0 | 54,818,588 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m,x;
... | #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 | 89,986,668 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
int main(){
int a, b;
cin >> a >> b;
int ans=0;
for(int i=a; i<=b; ++i){
int k = i%10;
int l = i/10%10;
int m = i/1000%10;
in... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void solve() {
int n, k; scanf("%d%d", &n, &k);
vector<pair<int, int>> v;
for (int i = ... | 0 | 11,390,496 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
#define rep(i, n) for(_LL i = 0; i < (_LL)(n); i++)
int modl(_LL a, _LL k)
{
a %= k;
if( a < 0 ) a += k * ( 1 - (a + 1) / k );
return a;
}
int modadd(_LL a, _LL b, _LL k)
{
return modl(a + b, k);
}
int modminus(_LL a... | #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) {
... | 0 | 25,021,697 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
cin.ignore();
string rule[10] = {"", ".,!? ", "abc", "def", "ghi",
"jkl","mno", "pqrs", "tuv", "wxyz"};
for(int i=0; i<n; i++){
string s;
getline(cin, s);
string ans = "", temp = "";
in... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int n;
int main(){
LL ans = 0, u, v;
scanf("%d", &n);
for(LL i = 1; i <= n; i++){
ans += i * (n - i + 1);
}
for(int i = 1; i < n; i++){
scanf("%lld%lld", &u, &v);
if(v < u) swap(u, v);
ans -= u * (n - ... | 0 | 68,234,908 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = k;
for (int i = 1; i < n; i++) {
ans *= (k - 1);
}
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <stack>
#include <string>
using namespace std;
int main(){
int A,B;
int flagA=0;
int K;
cin>>A>>B>>K;
while(K--){
if(flagA==0){
if(A%2==0){
}else{
A=A-1;
... | 0 | 20,199,205 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vect... | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
#define IOS\
ios::sync_with_stdio(false);\
cin.tie(0);\
... | 0 | 3,819,915 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int w,h,n;
cin>>w>>h>>n;
int res[w+5][h+5];
memset(res,0,sizeof res);
for(int i=0;i<n;++i){
int x,y,a;
cin>>x>>y>>a;
if(a==1){
for(int i=1;i<=x;++i)
for(int j=1;j<=h;++j)
res[... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
long power(long a, long b) {
return b ? power(a*a%MOD, b/2) * (b%2?a:1)%MOD:1;
}
long perm(int N, int K) {
long x = 1;
for(int i = 1; i <= K; i++) x = x * (N-i+1) % MOD;
return x % MOD;
}
lon... | 0 | 69,783,503 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long S, C;
cin >> S >> C;
long s = S;
long c = C / 2;
long tmp = min(s, c);
long ans = 0;
ans += tmp;
S -= tmp;
C -= tmp * 2;
if (C <= 1) return cout << ans << "\n", 0;
ans += C / 4;
cout << ans << "\n";
} | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 17,758,467 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
string s;
cin >> s;
int n = s.size();
int x = 753;
rep(i, n-2) {
int temp = (s[i] -... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 60,619,046 |
#include<stdio.h>
void right_triangle(int x, int y, int z);
int main(void)
{
int n;
scanf("%d", &n);
for ( int i = 0; i <n ; ++i){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
right_triangle(a , b, c);
}
return 0;
}
void right_triangle( int x, int y, int z)
{
x *= x;
y *= y;
... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e10;
int main(){
long long int h, w;
cin >> h >> w;
long long int ans = INF;
vector<vector<long long int>>
a = {
{ h / 3 * w, (h - h / 3) / 2 * w},
{(h / 3 + 1) * w, (h - h / 3 - 1) / 2 * w},
... | 0 | 86,370,612 |
#include <iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<set>
#include<map>
#define INF 1e8
using namespace std;
int main(void){
set<long long> s;
int n, count=0, min=1e9+5;
cin>>n;
for(int i=0;i<n;++i){
int a;
cin>>a;
if(a <min)
{
count++;
min=a;
}
}
cout<<c... | #include <vector>
#include <queue>
#include <iostream>
using namespace std;
class TopologicalSort {
public:
TopologicalSort(int V): V(V), G(V, vector<int>(0)), indeg(V, 0) {}
void addEdge(int s, int t) {
G[s].push_back(t);
indeg.at(t)++;
}
vector<int> getSorted() {
return vs;
}
bool sort() {
... | 0 | 50,662,824 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.