code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
using namespace std;
struct Node{
int key;
Node *prev,*next;
};
Node *NIL;
void initList(){
NIL = (Node *)malloc(sizeof(Node));
NIL -> prev = NIL;
NIL -> next = NIL;
}
void insert(int K){
Node *x;
x = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vec... | 0 | 28,111,154 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int N;
cin >> N;
int cmax = 0, Nmax = 1;
for (int i = 1; i <= N; i++) {
int c = 0;
int t = i;
while (t%2 == 0){
c++;
t /= 2;
}
if (c > cmax){
cmax = c;
Nmax = i;
... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
const int INF = 1000100100;
int main(){
ll n,cnt=0,sum=0,ans;
string s;
cin>>s;
n=s.size();
rep(i,n){
if(s[i]=='B'){
cnt++;
... | 0 | 15,722,032 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n+1);
vector<int> b(n);
for (int i = 0;i < n+1;i++){
cin >> a[i];
}
for (int i = 0;i < n;i++){
cin >> b[i];
}
long long ans = 0;
for (int i = 0;i < n;i++){
if (b[i] >= a[i]){
b[i] -= a[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll a, ll b) {
if (a > b) swap(a, b);
if (b % a == 0) {
return (b/a)*a*2-a;
}
return (b/a)*a*2+f(b%a, a);
}
int main () {
ll N, X;
cin >> N >> X;
if (X+X == N) {
cout << N/2*3 << endl;
return 0;
... | 0 | 95,538,200 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#defin... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#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(a) (a).begin(),(a).end()
#define mod 1000000007
#define pi acos(-1.0)
using namespace std;
signed main() {
cin.tie(0);
... | 0 | 9,214,815 |
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(ll A, string op, ll B) {
cout << A + B * (op == "+" ? 1 : -1) << endl;
}
int main() {
ll A;
cin >> A;
string op;... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define YN(flag) (flag?"Yes":"No")
#define lcm(a,b) (a/__gcd(a,... | 0 | 91,426,642 |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
int a, b, C;
double rad, S, L, h;
cin >> a >> b >> C;
rad = C * acos(-1) / 180;
S = a * b * sin(rad) / 2;
L = a + b + sqrt(pow(a, 2) + pow(b, 2) - 2 * a * b * cos(rad));
h = b * sin(rad);
printf("%f\n%f\n%f\n", S, L, h)... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#d... | 0 | 16,791,261 |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define mod 1000000007
#define int long long
int solve2(vector<vector<int>> &dp, vector<vector<int>> &a, int c, int src, int par) {
if (dp[src][c] != -1)return dp[src][c];
int ans = 0;
int c0 = 1, c1 = 1;
for (auto x : a[src]) {
if (x != par) {
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = ... | 0 | 17,803,692 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI d(n);
rep(i,n){
cin >> d.at(i);
}
sort(d.begin(),d.end());
int ans=d.at(n/2... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=40;
int n;
char a[maxn][3];
char b[maxn][3];
char c[maxn][3];
void bubble_sort()
{
for(int i=0;i<n;i++)
{
for(int j=n-1;j>0;j--)
{
if(b[j][1]<b[j-1][1]) swap(b[j],b[j-1])... | 0 | 57,739,299 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int a;
int remain;
cin >> n >> a;
remain = n % 500;
if (remain <= a)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
string o, e;
cin >> o >> e;
int n = max(o.size(), e.size());
rep(i, n)
{
if (i < o.size())
... | 0 | 83,818,522 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<bool> snukes(N);
rep(i, N) snukes.at(i) = false;
rep (i, K) {
int d;
cin >> d;
rep (j, d) {
int a;
cin >> a;... | #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int N, A, B, C, X;
while (scanf("%d %d %d %d %d", &N, &A, &B, &C, &X) == 5) {
if (N == 0 && A == 0 && B == 0 && C == 0 && X == 0) break;
int Y[N];
for (int i = 0; i < N; i++) {
scanf(" %d", &Y[i]);
}
int index = 0;
... | 0 | 60,529,975 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
getline(cin,a);
cin >>b;
a=a+a;
if(a.find(b)==-1)
{cout <<"No"<<endl;}
else{cout <<"Yes"<<endl;}
return 0;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 83,595,557 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long> A(n);
for(int i=0; i<n; ++i) cin>>A[i];
long long current=1000;
for(int i=1; i<n; ++i){
long long stocks=0;
if(A[i-1]<A[i]) stocks = current/A[i-1];
current += (A[i]-A[i-1])*stocks;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, m, a, b, c[9][9]{};
cin >> n >> m;
for (int i = 0; i < m; ++i)
{
cin >> a >> b;
c[a][b] = c[b][a] = 1;
}
int p[8], ans = 0;
iota(begin(p), begin(p) + n, 1);
do
{
bool ok = true;
for (int i = 0; i < n - 1; i++)
if (!c[p[i]][p[i+1]])
... | 0 | 7,540,580 |
#include <cstdio>
#include <cmath>
struct Point{double x, y;};
void koch(int n, Point p1, Point p2) {
if (n == 0) return;
Point s, t, u;
double rad_60 = M_PI * 60 / 180;
s.x = (2 * p1.x + 1 * p2.x) / 3;
s.y = (2 * p1.y + 1 * p2.y) / 3;
t.x = (1 * p1.x + 2 * p2.x) / 3;
t.y = (1 * p1.y + 2 * p2.y) / 3;
u.... | #include <bits/stdc++.h>
using namespace std;
#define maxn 100002
#define FOR(i, l, r) for (int i=l; i<=r; ++i)
#define FORD(i, r, l) for (int i=r; i>=l; --i)
#define REP(i, r) for (int i=0; i<(int)r; ++i)
#define REPD(i, r) for (int i=(int)r-1; i>=0; --i)
#define fi first
#define se second
#define mk make_pair
#define... | 0 | 92,590,327 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i,n) ... | #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)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 20,965,384 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
int dp[1<<26];
int main(){
string s;cin>>s;
memset(dp,0x3f,sizeof(dp));
dp[0]=0;
int h=0;
rep(i,s.size()){
h^=1<<(s[i]-'a');
int Min=dp[h]+1;
rep(j,26){
dp[h]=min(dp[h],dp[h^(1<<j)]+1);
Min=min(Min,dp[h^(1<<j)]+1);
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX_A = 1e5+1;
int N, M;
void solve() {
cin >> N >> M;
vector<P> jobs(N);
for (int i = 0; i < N; ++i) {
int a, b;
cin >> a >> b;
jobs[i] = P(a, b);
}
sort(jobs.begin(), j... | 0 | 33,256,024 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N,ans=0;
cin >> N;
vector<ll> A(N),B(N),diff;
ll sum=0;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
if(A[i] >= B[i]) diff.push_back(A[i]-B[i]);
else{
sum += B[i] - A[i]... | #include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <queue>
#include <math.h>
#include <bitset>
#define INF 100000000000
#define ll long long
using namespace std;
struct UnionFind {
vector<ll> par;
UnionFind(ll N) : par(N) {
for(ll i = 0; i < N; i++) par[i] = i;
}
ll root(... | 0 | 1,998,560 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
c... | #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 | 42,255,563 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
void so... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair ... | 0 | 18,172,572 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
using namespace std;
#define int long long
#define f(i,a,b) for(i=a;... | 0 | 58,221,282 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
int main() {
vector<vector<int>> A(3, vector<int>(3));
REP(i, 3) {
REP(j, 3) { cin >> A[i][j]; }
}
vector<int>::it... | 0 | 32,984,399 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = (long long) 1e9+7;
vector<ll> fac(2000001);
vector<ll> ifac(2000001);
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % M;
x = x*x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a,... | #include <iostream>
#include <cmath>
using namespace std;
const double EPS = 1e-10;
int
main()
{
int n;
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> n;
while (n--) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if (fabs((x2 - x1) * (y4 - y3) - (x4 - x3) * (y2 - y1)) < EPS)
... | 0 | 86,910,897 |
#include <iostream>
#include <bits/stdc++.h>
#define mod 1000000007
#define point complex<long long>
#define pi acos(-1)
#define pb push_back
typedef long long ll;
using namespace std;
void Fastio(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
double dis(int x1, int x2, int y1, int y2){
return s... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
for(auto &i: s){
if(i >= 'a' && i <= 'z') cout << (char)(i-'a'+'A');
else
if(i >= 'A' && i <= 'Z') cout << (char)(i-'A'+'a');
else cout << (char)i;
}
while(cin >> s){
... | 0 | 88,034,463 |
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdli... | #include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long LL;
int fu[100020];
int dis[100020];
bool success;
int findfu(int i)
{
if (f... | 0 | 43,955,369 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
typedef long long ll;
const int MAXN=2e5+7;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;... | 0 | 69,760,406 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
ll x, t; cin >> x >> t;
if(x<t){
cout << 0 << endl;
}
else{
cout << x-t << endl;
}
return 0;... | #include<map>
#include<bitset>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<stack>
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define SIZE(a) ll(a.size())
#define vll vector<ll>
#define MEMSET(a, n, m) for(ll i=0;i<=n;i++) a[i] = m
#define BIT(n) (ll(1... | 0 | 75,526,014 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin>>N;
int k = 0;
int j = 0;
int a = 0;
for(int n = 1;n <= N;n++){
a = n;
while (a != 0){
a /= 10;
j++;
}
if(j % 2 == 1){
k++;
}
j = 0;
}
cout<<k<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=500000;
char s[N+9];
int n;
void into(){
scanf("%s",s+1);
n=strlen(s+1);
}
int a[N+9];
LL ans;
void Dfs_a0(int p,int v){
a[p]=max(a[p],v);
if (p>1&&s[p-1]=='>') Dfs_a0(p-1,v+1);
}
void Dfs_a1(int p,int v){
a[p]=max(a[p],v);
if (p... | 0 | 22,946,231 |
#include <iostream>
#include <cstring>
using namespace std;
int main(){
int n;
int mode[101];
memset(mode,0,sizeof(mode));
int a = 0;
while(cin >> n){
mode[n]++;
a = max(a,mode[n]);
}
for(int i=0; i<101; i++){
if(mode[i] == a)
cout << i << endl;
}
return 0;
} | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k,n,i;
cin>>k>>n;
int a[n+2];
a[n+1]=k;
a[0]=0;
for(i=1;i<n+1;i++)
cin>>a[i];
int sum=0,mx=0,j=1,kk=0,l,h;
mx=a[1]-a[0]+a[n+1]-a[n];
for(i=1;i<n;i++)
{
mx=max(mx,a[i+1]-a[i]);
}
cout<<(k-mx);
} | 0 | 44,046,085 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a % 2 == 0 || b % 2 == 0) cout << "Even";
else cout << "Odd";
} | #include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorit... | 0 | 6,867,415 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, m, d[maxn];
int main() {
cin >> n >> m;
for (int i = 1, u, v; i <= m; i++) {
cin >> u >> v;
d[u]++, d[v]++;
}
for (int i = 1; i <= n; i++) {
if (d[i] & 1) { cout << "NO" << endl; exit(0); }
}
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | 0 | 47,750,513 |
#include <bits/stdc++.h>
using namespace std;
#define maxn -20000000000
#define mod 1000000007
#define md(x) (x) % mod;
#define sc scanf
#define pr printf
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ps push
#define prt(x) cout << (#x) << " is " << (x) << endl
#define EPS 1e-9
#... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
int s = 0;
for (int i=0; i<n; i++){
cin >> a[i];
s += a[i];
}
int ans = 0;
if (s % n == 0) {
int x = s/n;
for (int i: a){
ans += (x - i)*(x - i);
... | 0 | 8,140,307 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int main() {
ll a,b;
cin >> a >> b;
ll ans = 0;
if(a>b){
ans = b;
rep(i, a-1){
b *= 10;
ans += b;
}
}
else{
ans = a;
rep(i, b-1){
a... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<60
#define fs first
#define sc second
#define pb push_back
#define int long long
#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(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#d... | 0 | 30,595,089 |
#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#def... | #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)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;... | 0 | 17,357,283 |
#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
vector<string> ans(100);
for (int i = 0; i < 50; i++)
ans[i].resize(100, '#');
for (int i = 50; i < 100; i++)
ans[i].resize(100, '.');
int x = 0, y = 0;
for (int i = 0; i < a - 1; i++)
{
ans[y][x] = '.'... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(0);
struct S{
int a,b; S(){}S(int _a,int _b)
{ a=_a; b=_b; }
const bool operator<(cons... | 0 | 96,028,855 |
#include<iostream>
#include<algorithm>
using namespace std;
static const int MIN = -1 * (1 << 21);
int main() {
int i, j, n, a, maxa, max_so_far, max_ending_here;
while (1) {
cin >> n;
if (n == 0)break;
max_so_far = 0;
max_ending_here = 0;
maxa = MIN;
for (i = 0; i < n; i++) {
cin >> a;
maxa = max(m... | #define _GLIBCXX_DEBUG
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string s, t, save;
cin >> s;
reverse(s.begin(), s.end());
for(char &c : s){
save += c;
if(save=="maerd"||save=="remaerd"||save=="esare"||save=="resare"){
t +... | 0 | 48,078,790 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main(){
int h, w;
cin >> h >> w;
char paint[h][w];
rep(i, h){
rep(j, w){
cin >> paint[i][j];
}
}
int x[4] = {0, 0, -1, 1};
int y[4] = {-1, 1, 0, 0};
int check... | 0 | 42,198,992 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll... | 0 | 26,822,425 |
#include <bits/stdc++.h>
using namespace std;
char a[1 << 10][1 << 10];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int H, W; cin >> H >> W;
for (int i = 1; i <= H; i++) cin >> a[i];
for (int i = 1; i <= H * 2; i++) {
for (int j = 0; j < W; j++) cout << a[(i + 1) / 2][j];
cout << endl;
}
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
string L; cin >> L;
int n = L.length();
vector<vector<ll> > memo(n, vector<ll>(2));
memo[0][0] = 1;
memo[0][1] = 2;
for (int i = 1; i < L.length(); i++) {
if (L[i] == '1') {
... | 0 | 62,928,535 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll MOD = 1000000007;
ll sub(ll n){
if(n<=0){
return -1;
}
else{
vector<ll> list(n+1);
rep(i,n+1){
if(i==0){
list.at(i) = 0;
}
else if(i==1){
list.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int H;
cin >> H;
vector<int> V(H);
for (int i = 0; i < H; i++) cin >> V[i];
for (int i = 1; i <= H; i++) {
cout << "node " << i << ": " << "key = " << V[i - 1] << ", ";
if (i !... | 0 | 51,106,896 |
#include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).... | #include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<stack>
#include<cassert>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define m... | 0 | 56,690,641 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H;... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
#define REV(V) reverse(ALL(V))
#define RSORT(V) SORT(V);REV(V)
#defin... | 0 | 17,622,657 |
#include <cstdio>
using namespace std;
int main() {
char c;
unsigned int cnt = 0;
unsigned int max_cnt = 0;
for (int i=0;i<3;i++) {
scanf("%c", &c);
if (c == 'R') {
cnt++;
} else {
cnt = 0;
}
if (cnt > max_cnt)
max_cnt = cnt;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,sum;
int frac,minfrac = 10;
sum = 0;
for(int i=0;i<5;i++) {
cin >>a;
if(a%10) {
sum += (((a/10)+1)*10);
frac = a %10;
if(minfrac > frac) {
minfrac = frac;
... | 0 | 96,766,443 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int n;
cin>>n;
int d[60];
rep(i,n){
cin>>d[i];
}
ll umee;
rep(j,n){
for(int k=j+1;k<n;k++)
umee+=d[j]*d[k];
}
cout<<umee<<endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
... | 0 | 47,640,581 |
#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) { ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ii=pair<ll,ll>;
using vi=vector<ll>;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (ll)1e18
#define all(x) (x).begin(),(x).end()
#define print(a); for(auto x:a)cout<<x<<" "; cout<<"\n... | 0 | 45,790,997 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long,long> pl;
typedef pair<ll,ll> pll;
typedef vector<long> vl;
typedef vector<bool> vb;
typedef vector<ll> vll;
typedef vector<vl> vvl;
typedef vector<vb> vvb;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<string> vs... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();+... | 0 | 41,992,468 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
#define endl '\n'
const int N = 3*1e5+5;
set<pii> s;
int r[N], c[N];
vector<pii> R, L;
bool cmp(pii a, pii b){
return a.fi > b.fi;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
... | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#define MAX_W (100000L)
#define MAX_H (100000L)
#define INF (1000000000L)
using namespace std;
int main(int argc, char *argv[]) {
long W, H, ps[MAX_W + 1], qs[MAX_H + 1];
scanf("%ld %ld", &W, &H);
for (int i = 0; i < W; i++) {
scanf("%ld", &ps[i]);
... | 0 | 4,314,925 |
#include<bits/stdc++.h>
#define fo(i,a,b) for(int i= a ; i < b ; ++i)
#define rep(i,n) fo(i,0,n)
#define pln(n) printf("%lld\n",n)
#define sll(n) scanf("%lld",&n)
#define ss(n) scanf("%s",n)
#define vi vector < int >
#define pii pair < int , int >
#define pb push_back
#define mp make_pair
#define ll long long
#define u... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 0 | 34,751,965 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
string s; cin >> s;
ll k; cin >> k;
for(int i = 0; i < (int)s.size(); i++){
if(s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int m;
ll ans, sum;
ll count(ll digit, ll times) {
if (times == 1) return digit;
... | 0 | 71,803,771 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | #include<bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define INF 10000000000000000LL
#define ll long long
const int inf =INT_MAX;
const int MAX=3e5+9;
const ll MOD=1e9+7;
const int TOT_PRIMES=1e6+9;
const int MAX_A=71;
const int LN=20;
using namespace std;
int main(){
string s, t;
c... | 0 | 85,033,583 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rr... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define PI acos(-1)
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define f... | 0 | 68,556,480 |
#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>
using namespace std;
bool check(int n, int maxi){
for (int i = maxi; i > 0; i--) {
if(n >= i){
n -= i;
}
}
return (n == 0);
}
int main(){
int n;
std::cin >> n;
int l = 0, r = n, mid = (r + l)/2;
while(r - l > 1){
if(check(n, mid)){
r = mid;
}else{
l = m... | 0 | 12,384,057 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << endl;
#define CFYN(... | 0 | 51,916,702 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT \
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> P;
const ll INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const int MAXN = 200000;
ll N, M;
struct Edge {
ll to;
ll weight;
ll next;
};
vector<Edge> edges(MAXN);
vector<int> head(MAXN, -1);
vector<in... | 0 | 16,390,657 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (auto itr = s.rbegin(); itr != s.rend(); itr++) {
cout << *itr;
}
cout << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
class Dice
{
private:
vector<int> dice;
public : Dice(vector<int> num) {
for (int i = 0; i < (int)num.size(); ++i) {
dice.push_back(num.at(i));
}
}
int getDiceRightNum(int top, int forward) {
int right = 0;
for(int i = 0; i < (int)di... | 0 | 69,616,142 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int x;
cin >> x;
if (x < 1200) {
cout << "ABC" << '\n';
} else {
cout << "ARC" << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int in() {int x; cin>>x; return x;}
ll lin() {ll x; cin>>x; return x;}
string sin() {string x;cin>>x;return x;}
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
bool i... | 0 | 8,770,113 |
#include<bits/stdc++.h>
#define endl '\n';
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
co... | #include<stdio.h>
#include<math.h>
int main(void)
{
double s,d,f,g,h,j,i,k,a,b,C,za;
scanf("%lf %lf %lf",&a,&b,&C);
k=0.5;
za=3.1415926535;
C=za/180*C;
g=k*a*b*sin(C);
f=a+b+(sqrt((a*a+b*b)-(2*a*b*cos(C))));
h=b*sin(C);
printf("%lf\n%lf\n%lf\n",g,f,h);
return 0;
} | 0 | 18,263,941 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
template<class T> inline bool chmax(T& a, T b) { if (a < b... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(3, vector<int>(n));
fo... | 0 | 69,640,395 |
#include <iostream>
#include <numeric>
int main(){
int n, x;
std::cin >> n >> x;
int ans = 0;
for (int i = 0; i < n; i++)
{
int x_;
std::cin >> x_;
x_ = abs(x - x_);
ans = std::gcd(ans, x_);
}
std::cout << ans << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
int i,n,t,j=0,p,x,a=0,b,l=0,r=0,y,k,c,sum=0,m,d;
string s1,s2;
cin>>s1>>s2;k=0;j=0;
for(i=0;i<s1.size()+s2.size();i++){
if(k<s1.size()){co... | 0 | 36,060,418 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, P,Q;
cin >> N >> K;
P=1;
Q=1;
while(N-Q>=0){
if(P<K){
P=P*2;
Q++;
}
else if(P>=K){
P=P+K;
Q++;
}
}
cout << P << endl;
} | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int i... | 0 | 58,902,001 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
vector<int> d(N, 0);
int recover = 0;
for (auto &x: d) cin >> x;
for (size_t i=0; i<d.size(); i++) {
for (size_t j=(i+1); j<d.size(); j++) {
recover += d[i] * d[j];
}
}
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> a(n), num(n + 1, 0);
for (ll i = 0; i < n; i++) {
cin >> a[i];
num[a[i]]++;
}
ll sum = 0;
for (ll i = 0; i <= n; i++) {
sum += num[i] * (num[i] - 1) / 2;
}
for (ll i = 0; i < n; i++) {
ll tmp = 0;... | 0 | 20,288,372 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
using namespace std;
const int num1 = 1046527;
const int num2 = 13;
char c[num1][num2];
inline int getInt(char ch) {
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
return 0;
}
... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <limits>
#include <queue>
#include <unordered_map>
#include <list>
#include <set>
#include <numeric>
using namespace std;
using ll = long long;
#define rep_init... | 0 | 76,624,444 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int count=0;
for(int i=0;i<s.size();i++){
if(s.at(i)=='o') count++;
}
if(15-s.size()+count>=8) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
vector< vector<int> > G(10001);
queue<int> que;
int n_v, n_e, u, v;
int in_degree[10001], ans[10001], idx;
int main(){
memset(in_degree, 0, sizeof(in_degree));
scanf("%d %d", &n_v, &n_e);
for(int i=0; i<n_e; i++){
... | 0 | 51,714,088 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | #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 head(int base, int k) {
int dst = 0;
while(base < k) {
base *= 2;
dst++;
}
return dst;
}
int main() {
int n, k;
cin >> n >> k;
vecto... | 0 | 40,343,925 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define RFOR(i,a,b) for(int i = (int)(b-1);i>=(int)(a);--i)
#define REP(i,n)... | #include<iostream>
using namespace std;
int main(){
long long cnt=1;
long long n;cin>>n;
for(int i=1;i<=n;i++){
cnt*=i;
}
cout<<cnt<<endl;
} | 0 | 15,607,358 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i,n) for(long long i=1;i<=(long long)(n);i++)
#define all(v) v.begin(),v.end()
#define Sort(v) sort(all(v))
#define Reverse(v) reverse(all(v))
#define Rsort(v) sort(all(v),greater)
#define pub(v)... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,i... | 0 | 74,759,804 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define maxn 10000001
#define endl "\n"
#define inf INT_MAX
#define vec vector <ll>
#define mps map <ll,ll>
#define ppl vector<pair<ll,ll>>
#define fi first
#define si second
#define p... | 0 | 85,847,295 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>
bool ask(T x)
{
static int tot = 0;
++tot;
cerr << "ASK " << tot << endl;
cout << "? " << x << endl;
char c;
cin >> c;
return c == 'Y';
}
void ans(ll x)
{
cout << "! " << x << endl;
exit(0);
}
int ma... | 0 | 58,820,562 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int mxN = 105;
vector<int> adj[mxN];
int main() {
int n;
cin >> n;
string s;
cin >> s;
for(int i = 0; i < n; ++i)
adj[(int)s[i]].push_back(i);
long long tot = 0;
vector<int> :: iterator it;
for(int i = 0; i < n; ++i) {
for... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int k;
int n;
vector<int> a;
void solve() {
vector<int> diff;
diff.push_back(k+*a.begin()-a[n-1]);
for (auto i=a.begin();i!=a.end();i++) {
diff.push_back(*(i+1) - *i);
}
sort(diff.begin(), diff.e... | 0 | 64,859,442 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define big 998244353
#define ff first
#define se second
#define pb push_back
#define pii pair<int,int>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define PSET(x,y) fixed<<setprecision(y)<<x
#define mp make... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
int sum,i;
while(cin>>a)
{
i=0;
sum=0;
if(a[0]==48) break;
while(a[i]!=0){
sum=sum+(a[i]-48);
i++;
}
cout<<sum<<endl;
}
return 0;
} | 0 | 52,161,883 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl ... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 40,698,719 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
long long int n, t;
cin >> n >> t;
long long int res = 0;
... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define vl vector
using namespace std;
int main()
{
ll n,a,b,i,j;
cin>>a>>b;
for(i=1;i<=1000000;i++)
{
long double x,y;
x=i*0.08;
y=i*0.1;
ll c,d;
c=floor(x);
d=floor(y);
if(c==a && ... | 0 | 43,858,844 |
#include<bits/stdc++.h>
#define pii pair<int,int>
#define pb push_back
#define mk make_pair
using namespace std;
vector<pii > g;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
if(k>(n-1)*(n-2)/2) {printf("-1");return 0;}
for(int i=2;i<=n;++i) g.pb(mk(1,i));
int i=2,j=3;
k=(n-1)*(n-2)/2-k;
while(k--) {
g.pb(mk(i,j)... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
using namespace std;
#define fors(i,a,b) for(int i=(a);i<=(b);++i)
#define ford(i,a,b) for(int i=(a);i>=(b);--i)
#define min(x,y) ((x) < (y) ? (x) : (y))
#define max(x,y) ((x)... | 0 | 23,535,601 |
# include <iostream>
# include <cstring>
# include <unordered_map>
using namespace std;
# define ll long long
unordered_map<ll, ll> cnt;
int main(){
cnt[0] = 1;
int n;
cin >> n;
ll ans = 0, cur = 0;
for(int i=0; i<n; i++){
ll num; cin >> num;
cur += num;
ans += cnt[cur];
cnt[cur]++;
}
cout... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | 0 | 92,677,325 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll s = 1;
if(b-a <= 2) {
cout << k+1 << endl;
return 0;
}
rep(i,k) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pai... | 0 | 31,641,367 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int ans=0 ;
string s;
cin >> s;
for(int i;i<s.size();i++){
if(s.at(i)=='x'){
ans++;
}
}
if(ans>=8){
cout << "NO" << endl;
}else{
cout << "YES" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vll vector<ll>
#define vpll vector<pair<ll ,ll>>
#define vvi vector<vector<int>>
#define vvll vector<vector<ll>>
#define MAP map<ll ,ll>
#define UMAP unordered_map<ll , ll>
#define endl "\n"
#define SET set<ll>
#define SETC set<char>
#define... | 0 | 91,798,837 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(A) (A).begin(),(A).end()
int check(int x){
string s;
cout << x << endl << flush;
cin >> s;
if(s == "Vacant")return 0;
else if(s == "Male")return 1;
else return 2;
}
int main(void){
int N;cin >> N;
int left = 0;
int right = N;
int x = check(0);
if(x ==... | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
typedef long long ll;
string s;
int a[2 * 100000+1], opt[2*100000], dp[1<<26], chara['z'-'a'+1], X['z'-'a'+2];
int main() {
cin >> s;
for (int i = 0; i < 26; i++) {
chara[i] = 1 << i;
X[i + 1] = 1 <... | 0 | 8,547,007 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
rep(i, N / R + 1) {
rep(j, (N - i * R) / G + 1) {
if ((N - i * R - j * G) % B == 0) ans++;
}
}
cout << ans << end... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 19,633,607 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define INF 9223372036854775806
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define PI 2*acos(0.0)
#define EPS 1e-9
ll max(ll a,ll b) {if(a>b) return a; else return b;}
ll min(ll a,ll b) {if(a<b) ret... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, r, s, p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
for (int i = k; i < n; i++) {
if (t[i] == t[i-k]) t[i] = 'a';
}
int numr, nums, nump;
numr = 0;
nums = 0;
nump = 0;
for (int i ... | 0 | 61,831,856 |
#include <bits/stdc++.h>
int main() {
long min = 1000000000;
long max = -1000000000;
long sum = 0;
long N;
long temp;
std::cin >> N;
for(long i = 0; i < N; ++i) {
std::cin >> temp;
min = std::min(temp, min);
max = std::max(temp, max);
sum += temp;
}
std::cout << min << " " << max << " ... | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
int main() {
int N;
cin>>N;
vector<string> S(N);
for(int i=0;i<N;i++){
cin>>S[i];
}
int M;
cin>>... | 0 | 57,728,023 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <bits/stdc++.h>
using namespace std;
void solve () {
int n, m;
cin >> n >> m;
unordered_map <int , vector<int>> mp;
vector<pair <int, int>> a(m);
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
mp[p].push_back(y);
a[i].first = p;
a[i].second = ... | 0 | 22,337,566 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string S;
cin >> A >> B >> S;
bool ok = true;
int i = 0;
while(i < A + B + 1) {
if(i == A && S[i] != '-') {
cout<< "No" << endl;
ok = false;
break;
}
else if(i != A && S[i] == '-') {
cout << "No" << endl;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 0 | 99,989,300 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> ii;
const int N = 1e5+1;
int i,n,a[N],sz[N];
ll ans[N];
priority_queue<ii>pq;
int main()
{
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
pq.push(ii(a[i],i));
sz[i] = 1;
}
while(pq.size()>1)
{
int t1 = pq... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 44,471,824 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
signed main() {
int n;
cin >> n;
int h[n];
rep (i, 0, n) cin >> h[i]... | #include<iostream>
#include<algorithm>
#include<math.h>
#include<string>
#include<tuple>
#include<vector>
#include<cstdlib>
#include<cstdint>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
#include<ctime>
#include<climits>
#include<random>
#include<queue>
#include<map>
using namespace std;
templa... | 0 | 96,558,682 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,x,n) for(int i = x; i < n; i++)
#define MAX 100
#define INF 1000000001
int k;
vector<pair<int,int>> adj[114514];
long long dis[114514];
bool processed[114514];
void dijkstra() {
priority_queue<pair<int,int>> q;
REP(i,0,114514) dis[i] = INF;
dis[1]... | #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()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
int main() {
int n,k;
cin>... | 0 | 99,446,734 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vec... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | 0 | 69,727,523 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define mp make_pair
#define endl "\n"
#define N 100001
#define INF 1e9
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cerr << "Time : " ... | #include <stdio.h>
int main () {
char S[100];
scanf("%s", S);
char Y[] = "YAKI";
for (int i = 0; i < 4; i++) {
if (S[i] != Y[i]) {
puts("No");
return 0;
}
}
puts("Yes");
} | 0 | 78,951,631 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vii vector<int>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define take(a,n) for(ll i=0;i<n;i++)cin>>a[i]
#define takes(a,n,st) for(ll i=st;i<n+st;i++)cin>>a[i]
ll ... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 14,366,750 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include ... | #include <bits/stdc++.h>
using namespace std;
const long long md=1000000007;
const int maxn=300100;
long long fac[maxn],inv[maxn];
long long powd(long long x,long long y){
long long res=1;
while(y){
if(y&1) res=res*x%md;
x=x*x%md;
y>>=1;
}
return res;
}
void csh(){
fac[0]=1;
for(int i=1;i<=300000;i++)
fac... | 0 | 38,888,455 |
#include<iostream>
#include <stdio.h>
using namespace std;
int main(){
int alphabets[128], index;
char ch;
for(int i = 0; i < 128; i++){
alphabets[i] = 0;
}
while(cin >> ch){
if(ch == '\0') break;
if(!isalpha(ch)) continue;
if(isupper(ch)) ch = tolower(ch);
index = ch - 'a';
alphabets[... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> x(n);
rep(i, n) cin >> x.at(i);
int ans = MOD;
rep(p, 300) {
int sum = 0;
... | 0 | 83,729,265 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string R="yhnujmikolp";
string L="qazwsxedcrfvtgb";
while(true)
{
string S;
int juge[50]={0};
int jugeL[50]={0};
int count=0;
cin>>S;
if(S=="#")
{
break;
}
int len=S.size();
for(int i=0;i<len;i++)
{
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
ll k;
cin >> k;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
ll cou = 0;
ll q = 10e8 + 7;
for(int i = 0; i < n - 1; i++){
for(int j = i + 1; j < n; j++){
... | 0 | 36,017,684 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N, K, R, S, P;
cin >> N >> K >> R >> S >> P;
string T;
cin >> T;
ll ans = 0;
rep(i, 0, N){
if(i + K < N && T[i + K] == T[i]){
... | #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 | 56,504,747 |
#include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n=0;
cin >> n;
if(n==0)break;
int time[1000000] = {};
for(int i=0;i<1000000;i++){
time[i] =0;
}
for(int i=0;i<n;i++){
int h,m,s;
char c;
c =0;
cin >> h >> c >> m >> c >> s;
int a = h ... | #include<stdio.h>
#include<iostream>
using namespace std;
#include<queue>
int main(){
while(1){
int a,b,n,v,x,y,i,j,m[18][18]={0},c=0,o=0;
pair<int,int> p,t,g;
queue<pair<int,int> > q;
scanf("%d%d",&a,&b);
if(a==0&&b==0){
break;
}
g.first=a;
g.second=b;
for(i=0;i<=a+1;i++){
for(j=0;j<=b+1;j++){
if(i==0||i==a+1||j==0... | 0 | 83,869,151 |
#include<iostream>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<string>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
#define LL long long
int n,v[111111],ans;
map<int,int>odd,even;
vector<pair<int,int>>o,e;
int... | #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 | 45,992,398 |
#include<iostream>
#include <string>
using namespace std;
int main()
{
int iodd = 0;
int iedge = 0;
int patternsum = 0;
cin >> iodd >> iedge;
if (iodd == 0) {
patternsum = (iedge * (iedge - 1) / 2);
}
else if (iedge == 0) {
patternsum = (iodd * (iodd - 1) / 2);
}
else {
patternsum = (iodd * (iodd - 1) / ... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 28,458,146 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#defin... | #include<cstdio>
#include<cstdlib>
#include<cmath>
#include<climits>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) f... | 0 | 26,779,961 |
#include<bits/stdc++.h>
#define nxt(x) bian[x].nxt
#define ed(x) bian[x].ed
using namespace std;
const int maxn=1e6;
struct edge{
int nxt,ed;
}bian[maxn];
int n;
int t[maxn],cnt=2;
int w[maxn];
bool bl[maxn];
void lj(int x,int y) {
ed(cnt)=y;
nxt(cnt)=t[x];
t[x]=cnt++;
w[x]++;
}
queue<int> q;
void bfs() {
while(!... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define inf 1000000000000000000
#define lli long long int
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
lli n,k;
cin>>n>>k;
lli h[n], dp[n];
for(int ... | 0 | 42,070,980 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, x, y;
cin >> A >> B;
x = (A + B) % 2;
if(x == 1) {
y = (A + B) / 2 + 1;
}
else {
y = (A + B) / 2;
}
cout << y << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using v... | 0 | 30,780,557 |
#include<iostream>
using namespace std;
int main(){
int n,i;
long long ans;
while(cin >> n){
ans=1;
for(i=0;i<n;i++){
ans=ans*(n-i);
}
cout << ans << endl;
}
} | #include<iostream>
#include<cstdio>
using namespace std;
int M[101][101];
int main(){
int n,u,k,v;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d",&u,&k);
u--;
for(int j=0;j<k;j++){
scanf("%d",&v);
v--;
M[u][v]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
i... | 0 | 23,065,897 |
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cs... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
constexpr int MOD = 1000000007;
void warshal_floyd(vvi& G) {
... | 0 | 39,012,377 |
#include<iostream>
using namespace std;
int main(){
int n,a,a2,b,b2,c,c2;
cin >> n;
for(int i=0;i<n;i++){
cin >> a >> b >> c;
a2=a*a; b2=b*b; c2=c*c;
if(a2+b2==c2||a2+c2==b2||b2+c2==a2)cout << "YES" <<endl;
else cout << "NO" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef array<int, 2> duo;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
templa... | 0 | 58,100,552 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i = a;i < b;i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for(int i = b-1;i >= a;i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
#define DEBUG_PRINT(...) fprintf(stderr, __VA_ARGS__)
#ifdef ENABLE_DEBUG
#define DEBUG(a) cerr<<#a<<"="<<a<<endl... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define W(x, y) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << y;
#else
#define W(x, y)
#endif
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;
using vl = vector<ll>;
... | 0 | 65,386,434 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.