code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
int odd = (m + 1) / 2;
int even = m / 2;
std::vector<int> a(m), b(m);
int p = 1;
for (int i = 0; i < odd; ++i)
a[i] = p++;
for (int i = odd; i-- > 0;)
b[i] = p++;
for (int i = 0; i < even; ++i)
a[odd + i] = p+... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 0 | 88,950,221 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
type... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <math.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
using namespace std;
#define rep(I,N) for(int I = 0; I < (int)(N); I++)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define IN... | 0 | 74,412,605 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | #include <iostream>
#include <algorithm>
int main() {
long long int n, k;
std::cin >> n >> k;
long long int a[200010];
for (int i = 0; i < n; ++i)
std::cin >> a[i];
std::sort(a, a + n);
int cnt = std::max(0LL, n - k);
long long int ans = 0;
for (int i = 0; i < cnt; ++i)
ans += a[i];
std::cout << ans;
} | 0 | 5,076,961 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int A = 1;
for (int i = 0; i < M; i++) {
A *= 2;
}
int B = 1900 * M + 100 * (N - M);
cout << A * B << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll n, d, a;
cin >> n >> d >> a;
vector < pair < ll, ll > > v;
for(int i = 0; i < n; i++){
ll x, h;
cin >> x >> h;
v.push_back({x, (h + a - 1) / a});
}
... | 0 | 77,853,587 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 2000000010;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
typedef pair<int,P> PP;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
using namespace std;
int H, W;
char s[50][50];
int check(int x, int y){
bool k=false;
if(x>0 && s[x-1][y]==1){
k=true;
s[x-1][y]=0;
check(x-1, y);
}
if(y<W && s[x][y+1]==1){
k=true;
s[x][y+1]=0;
check(x, y+1);
}
if(x<H && s[x+1][y]==1){
k=true;
s[x+1]... | 0 | 59,879,117 |
#include <iostream>
using namespace std;
int main() {
char input;
cin >> input;
if (islower(input)) {
cout << "a";
} else {
cout << "A";
}
} | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
typede... | 0 | 41,359,004 |
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include<chrono>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi first
#define se ... | #include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
ll divisor(ll n)
{
ll i,cnt=0,lim=sqrt(n);
for(i=1; i<=lim; i++)
{
if(n%i==0)
{
if(n/i==i)
cnt++... | 0 | 32,645,077 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int h,w,a,b;
cin>>h>>w;
if(w==1 || h==1)
{
cout<<1<<endl;
return 0;
}
else if(w%2==0)
{
a=h*(w/2);
}
else
{
if(h%2==0)
{
a=(h*w)/2;
}
else
{
b=((w-1)/2)+1;
a=b+(((h-1)/2)*w);
}
}
cout<<a<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int main() {
ll n;
cin >> n;
ll sum = 0;
for (ll i = 1; i*i <= n; i++)
{
... | 0 | 90,310,069 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define ALL(c) (c).begin(), (c).end()
const int MAX_N = 1e5;
int N;
int P[MAX_N];
ll solve() {
vector<pii> ps;
for (int i = 0; i < N; i++) {
ps.push_ba... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 52,248,117 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <string>
using namespace std;
int main(void){
int n;
string in;
while(1){
cin>>n;
if(n==0)break;
char data[n];
char into[n];
for(int i=0;i<n;i++){
... | 0 | 30,392,623 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
string s, t;
cin >> s >> t;
vector<char> S;
rep(i,s.size()) S.push_back(s[i]);
s... | #include <bits/stdc++.h>
using namespace std;
constexpr int B = 20;
int main() {
int n, l, q;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
cin >> l >> q;
vector<vector<int>> data(B, vector<int>(n));
for (int i = 0; i < n; i++) {
int ok = a[i] + l;
data... | 0 | 30,467,515 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>v(n),visited(n,false);
for(int i=0;i<n;i++)
cin>>v[i];
int index=0;
bool no=false;
int count=0;
while(index!=1){
if(visited[index]==true){
no=true;
break;
... | #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 mod 1000000007
typedef long long ll;
int main() {
string s;cin>>s;
int cnt=0;
rep(i,s.size()){
if(s[i]=='o'){
cnt... | 0 | 7,967,690 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#ifdef LOCAL
#include<debug.h>
#else
#define db(...) 21
#endif
#define sz(a) (int)a.size()
#define found(m,x) ((m).find(x)!=(m).end())
#define uset unordered_set
#define umap unordered_map
#define a(x) x.begin(),x.end()
#define fo(... | 0 | 38,346,673 |
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int N;
cin >> N;
while ( N >= 0 ) {
if ( N % 4 == 0 ) {
cout << "Yes" << endl;
return 0;
}
N -= 7;
}
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define vb vector<bool>
#define pii pair<int, int>
#define vpli vector<pair<long long, int>>
#define deb(x) cout << "deb ... | 0 | 60,882,771 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
vector<int>A(N);
vector<int>B(N+1);
B[0] = 0;
for(int i = 0; i < N; i++) {
cin >> A[i];
B[i+1] = B[i]+A[i];
}
int ans = 0;
int cnt = 1;
sort(B.begin(),B.end());
... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pii pair<int,int>
#define pll pair<lli, lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ss second
#define ff first
#define INF 1000000001
#define i... | 0 | 26,726,532 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 0 | 55,035,083 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
typedef std::pair<float,float> point;
typedef std::vector<point> segments;
void print_array(segments list)
{
for(int i = 0; i < list.size(); ++i){
std::cout << list[i].first<<" "<<list[i].second<< std::endl;
}
}
void print_point(point p... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 19,392,491 |
#include <stdio.h>
int main(){
int a,b,c;
scanf("%d",&a);scanf("%d",&b);scanf("%d",&c);
if(a<b&&b<c)printf("Yes\n");
else printf("No\n");
return 0;
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
vector<vector<int>> E;
vector<int> P, A;
void DFS(int cur, int p, int t) {
for (int i = 0; i < E[cur].size(); i++) {
int n = E[cur][i];
if (n == p) cont... | 0 | 31,177,298 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int N;
cin >> N;
map<ll, int> mp;
vector<ll> A(N);
for (int i = 0; i < N; i++)
{
ll a;
cin >> a;
if (mp.count(a))
mp[a]++;
else
mp[a] = 1;
A[i] = a;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
cout << 0 << endl;
string S;
cin >> S;
if(S == "Vacant") {
return 0;
... | 0 | 93,293,868 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N, P;
cin >> N >> P;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<vector<long long>> dp(N + 1, v... | #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... | 0 | 68,449,135 |
#include<bits/stdc++.h>
#define ll long long
#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 dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
template<class... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(),(a).end()
#define ALL(a,n) (a),(a)+n
#define vi vector<long long>
#define vd vector<long double>
#define vs vector<string>
#define INF 1010000000000000017LL
#define MOD 1000000007LL
#define EPS 1e-12
#define PI 3.14159265... | 0 | 85,728,333 |
#include<iostream>
#include<vector>
using namespace std;
const long long MOD = 1000000007;
long long cnt[2004][2004];
long long sum[2004][2004];
int same[2004][2004];
int main(){
int n,m;
cin>>n>>m;
vector<int> s(n);
vector<int> t(m);
for(int i=0;i<n;i++) cin>>s[i];
for(int i=0;i<m;i++) cin>>t[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<n;i++)
int N, K;
ll A[1001];
int main() {
cin >> N >> K;
REP(i,N) cin >> A[i];
vector<ll> B, C;
REP(i,N) {
REP(j, B.size()) {
B[j] += A[i];
}
B.push_back(A[i]);
copy(B.begin(),B.end(),back_in... | 0 | 42,284,109 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <c... | #include<bits/stdc++.h>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll... | 0 | 4,184,348 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i ... | 0 | 7,095,958 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double T, X; cin >> T >> X;
cout << setprecision(5) << T / X << endl;
} | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, k, a;
cin >> n >> k;
map<int, int> mp;
for (int i=0; i<n; i++) {
cin >> a;
mp[a]++;
}
vector<int> v;
for (auto iter=mp.begin(); iter!=mp.end(); iter++) {
... | 0 | 92,948,037 |
#include <iostream>
#include <map>
using namespace std;
int fib(int n, map<int, int>& fib_mp)
{
auto itr = fib_mp.find(n);
if (fib_mp.end() != itr) return itr->second;
return fib_mp[n] = fib(n - 1, fib_mp) + fib(n - 2, fib_mp);
}
int main()
{
int n;
cin >> n;
map<int, int> fib_mp;
fib_mp[0] ... | #include <iostream>
#include <cstring>
using namespace std;
char s[1100],t[1100];
int ans=2333333;
int main(void)
{
cin>>s>>t;
int ls=strlen(s),lt=strlen(t);
for(int i=0;i<=ls-lt;i++)
{
int k=0;
for(int j=0;j<lt;j++)
{
if(s[i+j]!=t[j])k++;
}
ans=min(an... | 0 | 95,471,157 |
#include<bits/stdc++.h>
using namespace std;
long long int A, B, K;
long long int max(long long int A, long long int B) { return A > B ? A : B; }
int main() {
cin >> A >> B >> K;
if (K >= A) cout << 0 << " " << max(0, B-(K-A));
else cout << (long long) (A-K) << " " << B;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string S, ans = "AC\n";
cin >> S;
if (S[0] != 'A') ans = "WA\n";
if (S[1] < 'a' || S[1] > 'z') ans = "WA\n";
int C = 0, n = S.size();
if (S[n - 1] < 'a' || S[n - 1] > 'z... | 0 | 42,410,259 |
#include<iostream>
using namespace std;
int main()
{
int x,y,z=500,a;
cin>>x>>y;
a=x*500;
if(a>=y){
cout<<"Yes"<<endl;
}
else cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,c=0;
cin >> n;
vector<int> a;
for(int i=0; i<n; i++){
int val;
cin >> val;
a.push_back(val);
}
int j=0, now=1;
for(;;){
now = a[now-1];
if(now == 2){
... | 0 | 60,812,308 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string op;
string ABCD;
int seven;
int a, b, c, d;
cin >> ABCD;
a = ABCD[0] - '0';
b = ABCD[1] - '0';
c = ABCD[2] - '0';
d = ABCD[3] - '0';
for (int bit = 0; bit < (1 << 3); bit++) {
op = "---";
seven = 0;
for (int i = 0; i < 3; i++... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1001001001;
template<class T> bool chmin(T &a, T b){if(a > b){a = b; return true;} return false;}
int dp[10050];
int main(){
int h, n; cin >> h >> n;
vector<int> a(n), b(n);
for(int i = 1; i <= h + 10; i++) dp[i] = MAX;
for(int i = 0; i < n; i++){
... | 0 | 96,493,750 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
using namespace std;
typede... | #include<bits/stdc++.h>
using namespace std;
#define N 100000 + 5
#define M 20 + 5
#define rep(i, l, r) for(int i = l; i <= r; ++i)
#define dep(i, l, r) for(int i = r; i >= l; --i)
int n, q, l, a, b, ans, x[N], f[N][M];
int read(){
char c; int x = 0, f = 1;
c = getchar();
while(c > '9' || c < '0'){ if(c == ... | 0 | 680,285 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S,T;
cin >> S >>T;
int ans = 0;
for (int n = 0;n< S.size();++n) {
if (S[n] == T[n]) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IC ios_base::sync_with_stdio(false); cin.tie(NULL);
#define f(i, a, b) for(int i=a; i<b; i++)
#define ff(i, a, b) for(int i=a-1; i>=b; i--)
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define mp m... | 0 | 44,730,485 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int n;
cin >> n;
if(n == 1){
cout << 1 << endl;
}else if(2 <= n && n <= 3){
cout << 2 << endl;
}else if(4... | #include<iostream>
using namespace std;
int main(){
int x,y,a,b;
while(1){
cin >>x >>y;
if(x==0 && y==0) break;
if(x<=y){
a=x;
b=y;
} else {
a=y;
b=x;
}
cout << a << " " << b <<endl;
}
return 0;
} | 0 | 51,005,635 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
int ans = min(A, K... | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 0 | 67,482,699 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> d(n);
for (size_t i = 0; i < n; i++) cin >> d[i];
long long ans = 0;
for (size_t i = 0; i < n; i++) {
for (size_t j = i+1; j < n; j++) {
ans += d[i] * d[j];
... | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<cstdint>
#include<bits/stdc++.h>
#include<queue>
#include<set>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for(int i = n-1; i >= 0; i--)
#define rep1(i, n) for(i... | 0 | 56,032,461 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using V = vector<T>;
template<class T, class U> us... | 0 | 88,949,198 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v)... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, x, y;
vector<pair<int, int>> a(50), b(50), c(50);
cin >> n >> m;
for (int i = 0; i < n; i++)
{
cin >> x >> y;
a[i] = make_pair(x, y);
}
for (int i = 0; i < m; i++)
{
cin >> x >> y;
b[i] = make_pair(x, y);
}
for (int... | 0 | 74,960,292 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
vector<int> an;
vector<vector<int>> AN;
while (cin >> n) {
if (n == 0)break;
for (int i = 0; i < n; i++) {
cin >> a;
an.push_back(a);
}
AN.push_back(an); an.clear();
}
for (int i = 0; i < AN.size(); i++) {
long long int max = 0, ... | #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,i... | 0 | 54,638,752 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <iostream>
#include <queue>
using namespace std;
using ll = long long;
int main(){
ll K,n;
cin >> K;
queue<ll> q;
for(int i=1;i<10;++i) q.push(i);
while(1){
n = q.front();
q.pop(); --K;
if(K==0){
cou... | 0 | 49,502,154 |
#include <iostream>
using namespace std;
int main(){
int H,W;
while(cin >> H >> W){
if(H==0&&W==0) break;
for(int i=0;i<H;i++){
for(int j=0; j<W; j++){
if(H==0&&W==0) break;
cout <<"#";
}
cout <<"\n";
}
cout << "\n";
}
} | #include"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
ll sum = 0;
for (ll i = 0; i < N; i++) {
cin >> A[i];
sum ^= A[i];
}
for (ll i = 0; i < N; i++) {
A[i] &= ~sum;
}
ll next_position = 0;
ll rank =... | 0 | 68,563,621 |
#include<iostream>
#include<vector>
#include<cmath>
#include<iomanip>
#include<string>
using namespace std;
int s(string str, int j) {
int i = j;
if (str[i] == '(') {
while(true) {
i++;
if (str[i] == ')') {
return i;
} else if (str[i] == '[' || str[i] ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
using namespace std;
#define mod 1e9+7
#define ll long long int
#define epsilon 1e-7
double min(double x, double y){
if(x<y)return x;
return y;
}
int t[100];
int v[100];
double realv[20000];
int tsum[1... | 0 | 81,525,634 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int A, B;
size_t K;
cin >> A >> B >> K;
vector<int> v;
int upper = min(A, B);
for (int i = 1; i <= upper; ++i) {
if (((A % i) == 0) && ((B % i) == 0)) {
v.push_back(i);
}
}
if (K <= v.size()) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int intl;
typedef unsigned long long intu;
#define int long long
#define sfi(x) scanf("%lld", &x)
#define sfi2(x, y) sfi(x) , sfi(y)
#define sfi3(x, y, z) sfi(x) , sfi(y) , sfi(z)
#define sfc(x) scanf(" %c", &x)
#define sfs(x) ... | 0 | 83,126,793 |
#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(void){
int N,K;
cin >> N >> K;
int x = 1;
rep(i,N) x = min(x * 2, x + K);
cout << x << endl;
} | #define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | 0 | 62,122,193 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
int n;
cin >> n;
int a, b, c, d;
a = n / 1000;
b = n / 100 - a * 10;
c = n / 10 - a * 100 - b * 10;
d = n - a * 1000 - b * 100 - c... | #include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main(){
ll N; cin >> N;
vector<string>... | 0 | 77,911,993 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int N;
cin>>N;
string s[10000];
int a,b,c;
a=0;
b=0;
c=0;
long long answer=0;
for(int i=0;i<N;i++){
cin>>s[i];
for(int j=0;j<s[i].size()-1;j++){
if(s[i][j]=='A'&&s[i][j+1]=='B') answer++;
}
if(s[i][0]=='B') b+... | #include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define ... | 0 | 64,933,967 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
rep(i, N) cin >> a[i];
int ans = 0;
REP(i, N) {
if (a[i]... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define PB push_back
... | 0 | 99,144,606 |
#include <fstream>
#include <iostream>
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = (b-1); i >= (a); i--)
#define RF0(i,b) RFO(i,0,b)
#define lli long long int
#define pii pair<int,int>
#define add(a,b) ((int) (... | #include <bits/stdc++.h>
using namespace std;
#define popcnt(a) __builtin_popcount(a)
#define FastIO() ios::sync_with_stdio(false), cin.tie(0);
#define IO() freopen("palindrome.in","rw",stdin)
#define error(args...) \
{ \
cerr<<"LINE "<<__LINE__; ... | 0 | 64,803,012 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i,1000) {
string t;
int x = i;
rep(j,3) {
t += '0'+x%10;
x /= 10;
}
int ti = 0;
rep(j,n) {
... | 0 | 92,023,321 |
#include <cstdio>
#include <algorithm>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i,f,n) for(int i=(f); i<=(n); ++i)
using namespace std;
main()
{
int N, a[2000001], maxv = 0;
scanf("%d", &N);
rep(i, N)
scanf("%d", a+i),
maxv = max( maxv, a[i] );
int cnt[maxv + 1] = {-1};
int ret[... | #include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | 0 | 11,798,903 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <numeric>
#include <array>
#include <cmath>
#include <memory>
using namespace std;
#define DEB(variable) cout << #variable << '=' << variable << endl
#define FOR(LoopVariable,numberOFbegin,numberOFend) for (long lon... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 32,088,541 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <set>
#include <map>
#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
using namespace std;
int main()
{
int num = 0;
while (cin... | 0 | 87,763,747 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
void func(long long N, long ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
int ma... | 0 | 92,855,363 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#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 per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll A,B,K;
... | 0 | 94,968,733 |
#include<cstdio>
#include<iostream>
#include<cctype>
#include<cstring>
using namespace std;
int main(){
int s;
char a[1001];
while(1){
scanf("%s",a);
if(a[0]=='0')break;
s=0;
for(int i=0;i<strlen(a);i++){
s+=(a[i]-'0');
}
cout<<s<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int n, a, b;
cin >>n >>a >>b;
int dist = b - a;
if(dist % 2 == 1){
cout <<"Borys\n";
}
else{
cout <<"Alice\n";
}
return 0;
} | 0 | 7,145,891 |
#include <iostream>
using namespace std;
main () {
int n, x;
while (cin >> n >> x, n) {
int a = 0;
for (int i=1; i<=n-2; i++)
for (int j=i+1; j<=n-1; j++)
for (int k=j+1; k<=n; k++)
if (i+j+k == x) a++;
cout << a << endl;
}
} | #include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
int32_t main()
{
int x,y;
cin>>x>>y;
if(x%y==0)puts("-1");
else cout<<x;
} | 0 | 89,730,101 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
string s,t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
if(s < t) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include<numeric>
#include<cmath>
#include<stdio.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 ALL(v... | 0 | 24,445,617 |
#include<stdio.h>
int main(){
int i, n, s;
while (1) {
scanf("%d", &n);
if (n==0) {
break;
}
int ans = 0, maxv = 0, minv = 1000;
int score[n];
for (i = 0; i < n; i++) {
scanf("%d", &s);
if (s > maxv) {
maxv = s;
}
if (s < minv) {
minv = s;
... | #include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | 0 | 98,959,546 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
... | #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... | 0 | 55,734,072 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define ld long double
#define lll __int128
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int> >
#define ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
int64_t K;
cin >> N;
cin >> K;
int64_t n = N.size();
int64_t dp[110][2][4] = {0};
int64_t n0 = N[0] - '0';
dp[0][0][1] = 1;
dp[0][1][0] = 1;
dp[0][1][1] = n0 - 1;
for ( int64_t i = 1; i < n; ++i){
in... | 0 | 58,643,748 |
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#inc... | #pragma GCC optimize("O4")
#include <bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9+7)
#define INF 1e17
#define int ll
#define EPS (1e-6)
using namespace std;
using ll=long long;
using pii=pair<... | 0 | 47,217,956 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
#define INF (int)(1e9)
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,start,end) for(int i=(start);i<=(end);i++)
#define all(n) begin(n),end(n)
#define DEBUG
int ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<string>
#include<numeric>
#include<complex>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
... | 0 | 90,103,358 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
int h1,h2,m1,m2;
int k;
cin>>h1>>m1>>h2>>m2>>k;
cout<<max(0,(h2-h1)*60+(m2-m1)-k);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | 0 | 97,999,816 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | 0 | 22,786,642 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 0 | 11,835,867 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
ret... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,k;
cin>>n>>k;
long double ans=0;
for(int i=1;i<=n;i++){
int x=0;
int tmp=... | 0 | 7,663,507 |
#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;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<ll> cum(n+1);
cum[0] = 0;
rep(i, n) cum[i+1] = cum[i] + a[i];
sort(cum.begin(), cum.en... | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 0 | 22,777,152 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
typedef std::string str;
#define sei set<int>
#define sell set<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#de... | #include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
using namespace std;
#define vsort(v) sort(v.begin(), v.end())
#define vsort_r(v) sort(v.begin(), v.end(),... | 0 | 97,191,348 |
#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[i];
a[i]--;
}
int ans = 0;
for(int i = 0; i < n; i++)
if (a[a[i]] == i)
ans++;
ans /= 2;
cout << ans << '\n';
re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
ll H, W;
cin >> H >> W;
ll s1, s2, s3, s4, s5, s... | 0 | 74,140,521 |
#include <iostream>
#include<stdio.h>
using namespace std;
int main(void){
int a,b,x,y;
cin>>a>>b;
double z;
x = a/b;
y = a%b;
z = 1.0 * a/b;
cout<<x<<" "<<y<<" ";
printf("%.6lf\n", z);
} | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b... | 0 | 58,751,568 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int c=0;
if(s.length()==t.length())
{
for(int i=0;i<s.length();i++)
{
if(s[i]!=t[i])
c++;
}
}
cout<<c;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 998244353
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq ... | 0 | 44,720,967 |
#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;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld= long double;
using ull= unsigned long long;
#define endl "\n"
const ll maxn=3e5+100;
const ll maxx=1e13;
const ll mod=1000000007;
map<ll,ll> mp;
ll f[maxn];
ll a[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cou... | 0 | 93,228,989 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitse... | #include <iostream>
#include <cstdio>
#include <set>
using namespace std;
int main(){
long long n;
cin >> n;
set<string> T;
string pre_word;
for(long long i = 0; i < n; i++){
string word;
cin >> word;
if(i == 0){
T.insert(word);
pre_word = word;
... | 0 | 40,798,252 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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) { ... | 0 | 39,239,291 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
string s, t;
cin >> s >> t;
int ans = 0;
if(s[0] == t[0]) ans++;
if(s[1] == t[1]) ans++;
if(s[2] == t[2]) ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<int> r(N + 1), g(N + 1), b(N + 1);
for (int i = 1; i < N + 1; i++) {
r[i] += r[i - 1] + (S[i - 1] == 'R');
g[i] += g[i - 1] + (... | 0 | 74,459,228 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin>>n;
if(n<1200) cout<<"ABC";
else cout<<((n<2800)?"ARC":"AGC");
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <unordered_map>
#include <vector>
std::vector<long long> solve(int H, int W, const std::vector<std::pair<int, int>> &points)
{
std::unordered_map<long long, int> map;
for (const auto &p : points)
{
int i1 = std::max(p.first - 2, 0);
int i2 = st... | 0 | 26,678,820 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
co... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
typedef map <str,int> mapsi;
typedef map <str,int> :: iterator mapsitr;
typedef... | 0 | 30,526,674 |
#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(){
double w, h, x, y;
cin >> w >> h >> x >> y;
double s = w*h/2.0;
printf("%.10f ",s);
if(w/2.0 == x && h/2.0 == y) cout << 1;
else cout << 0;
} | #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 | 48,922,841 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | #include <bits/stdc++.h>
using namespace std;
#define INF (1<<31)-1
#define LINF (1LL<<63)-1LL
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;}
#defi... | 0 | 62,613,321 |
#include <iostream>
using namespace std;
int main()
{
int n, i = 0;
int car[10] = {};
while(cin >> n){
if(n == 0){
cout << car[i - 1] << endl;
car[i - 1] = 0;
i--;
}else{
car[i] = n;
i++;
}
}
} | #include<iostream>
using namespace std;
int main()
{
int s, a[10000];
cin >> s;
a[0] = s;
for(int i = 1; i < 10000; i++)
{
if(s % 2 == 0)
{
s = s / 2;
a[i] = s;
}
else
{
s = 3 * s + 1;
a[i] = s;
}
... | 0 | 81,806,391 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <functional>
#include <climits>
#include <cstring>
using namespace std;
#define int long long
#define rep(i, n) for (int i=0;i<(int)(n);++i)
#define r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 0 | 57,118,032 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x,y;cin >> x >> y;
if(abs(x-y)<=1) cout << "Brown" << end... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int N, K;
ll height[305];
ll dp[305][305];
ll INF = 0x3f3f3f3f3f3f3f3f;
int main() {
cin >> N >> K;
for (int i=1; i<=N; i++){
scanf("%lld", &height[i]);
}
memset(dp, INF, sizeof(dp));
for (int i=1; i<=N;... | 0 | 55,315,608 |
#include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
while (a != 0 || b != 0)
{
if (b < a)
{
int tmp = a;
a = b;
b = tmp;
}
cout << a << ' ' << b << endl;
cin >> a >> b;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, M; cin >> N >> M;
vector<vector<int> > to(N);
rep(i, M){
int a, b; cin >> a >> b;
a--;
b--;
to[a].push_back(b);
... | 0 | 38,121,957 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 1000000007LL
#define IN freopen("C.in","r",stdin)
#define OUT freopen("output.txt","w",stdout)
#define... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 0 | 36,210,570 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i< (n); i++)
using namespace std;
using ll = long long;
int main(void) {
int A[3][3] = {0};
bool bing[3][3] = {false};
bool ans = false;
for(int i=0; i<3; i++) {
for(int j=0; j<3; j++) {
cin >> A[i][j];
}
}
int ... | #include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <chrono>
using namespace std;
using namespace chrono;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;... | 0 | 71,651,770 |
#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>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | 0 | 615,648 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
using namespace std;
int main()
{
int x,y,count=10;
long long ans; cin>>x>>y>>ans;
while(count--)
{
ans=x*ans-y;
cout<<ans<<"\n";
}
} | #include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf emplace_front
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pii pair<int,int>
#define psi pair<string,int>
#define vi vector<int>
#define vpii vector<pii>
#de... | 0 | 67,727,773 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/arc094_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 100,667,134 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
map<ll,ll>f;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,a,b,s=0,x;
cin>>n>>a>>b;x=a;
for(int i=1;i<=n;i++){
ll s2=0,y;y=i;
while(y>0){
s2+=(y%10);y/=10;
}
if(s2>=a&&s... | #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;
c... | 0 | 81,472,438 |
End of preview. Expand in Data Studio
- Downloads last month
- 44