code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <stdio.h>
int main(){
int n,a,b;
long long int total=0;
scanf("%d %d %d", &n, &a, &b);
int i1=0,i2=0, i3=0, i4=0, i5=0;
for(int i=1;i<=n;i++){
i1=i/10000;
i2=(i%10000)/1000;
i3=(i%1000)/100;
i4=(i%100)/10;
i5=i%10;
int sum=i1+i2+i3+i4+i5;
if(sum >=a && sum<=b){
total+=i;
}
}
printf(... | #include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using namespace atcoder;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
dsu d(n);
int t, u, v;
rep(i, q) {
cin >> ... | 0 | 68,765,589 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p;
vector<bool> sieve(n + 1, 1);
for (int i = 2; i < n; i++) {
if (!sieve[i])
continue;
p.emplace_back(i);
for (int j = i * i; j < n; j += i)
sieve[j] = 0;
}
vector<int> b(p.size());
for (int i = 0, m; i < (int) ... | #include <bits/stdc++.h>
using namespace std;
int h, w, d;
string col = "RGBY";
vector<string> res;
vector<vector<int>> memo, ch;
void solve();
void dfs(int i, int j);
int main() {
cin >> h >> w >> d;
solve();
for (auto s : res) cout << s << endl;
return 0;
}
void solve() {
memo.assign(h, vector<int>(w, -1));... | 0 | 50,607,459 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main()
{
ll x, y;
cin >> x >> ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 0 | 51,043,039 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int N, K;
int ans = 0;
cin >> N >> K;
rep(i, N... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 5,397,386 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
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; } retu... | 0 | 23,178,778 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main() {
string S;
cin >> S;
while (S.length() != 1) {
S.pop_back();
if (S.substr(0, S.length() / 2) == S.substr(S.length() / 2)) {
cout << S.length() << endl;
return 0;
}
}
} | 0 | 4,903,631 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n;
cin >> n;
ll z, w;
cin >> z >> w;
vector<ll> a(n);
rep(i, n) cin >> a[i];
if ( n == 1 ) {
cout << abs(a[0] - w) << endl;
return ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1e18;
int main() {
ll m,k;
cin >> m >> k;
if(m==0) {
if(k==0) {
cout << "0 0" << endl;
}
else {
cout << -1 << endl;
... | 0 | 95,884,528 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int x;
cin >> x;
int d = 360 / __gcd(360, x) * x;
cout << d / x << '\n';
return (0);
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll;
... | 0 | 73,246,360 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int d1, d2;
d1 = x2 - x1;
d2 = y1 - y2;
cout << x2 + d2 << ' ' << y2 + d1 << ' ' << x1 + d2 << ' ' << y1 + d1 << '\n';
return 0;
} | #include <iostream>
using namespace std;
const int dif = 'A' - 'a';
int main(){
string str;
getline(cin, str);
for(int i = 0; i < static_cast<int>(str.size()); i++){
if('A' <= str[i] && str[i] <= 'Z'){
str[i] -= dif;
}else if('a' <= str[i] && str[i] <= 'z'){
str[i] += dif;
}
}
cout << str << endl;
} | 0 | 61,670,362 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int main(){
ll n,m;
std::cin >> n >> m;
std::vector<std::pair<ll,ll>> ab(n);
rep(i,n){
ll ai,bi;
std::cin >> a... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define repr(i, n) for (ll i = n - 1; i >= 0; --i)
#define INF 10e8
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
usi... | 0 | 72,562,124 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (int)n; ++i)
typedef long long ll;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int S;
cin >> S;
vector<ll> dp(S + 1, 0);
dp[0] = 1;
for (int i = 3; i <= S; ++i) {
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[8] = {1, 1, 1, 0, 0, -1, -1, -1}, dyy[8] =... | 0 | 48,111,366 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<numeric>
using namespace std;
#define INF (1 << 30) - 1
#define LINF 1LL << 60
const int MOD = 1000000007;
using ll = long long;
using P = pair<int, int>;
int m... | #include<stdio.h>
#include<string.h>
int main(){
char s1[101],s2[101];
int n,i,taro=0,hana=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %s",s1,s2);
if(strcmp(s1,s2)==0){
taro++;
hana++;
}
if(strcmp(s1,s2)>0){
taro=taro+3;
}
if(strcmp(s1,s2)<0){
hana=hana+3;
... | 0 | 46,755,646 |
#include <bits/stdc++.h>
using namespace std;
int solve(const vector<vector<int>> &v_positions,
const vector<vector<int>> &h_positions, const pair<int, int> &pos) {
int pos_x = pos.first, pos_y = pos.second, ans = 0;
const vector<int> &v_pos = v_positions[pos_x], &h_pos = h_positions[pos_y];
ans +=
... | #include "bits/stdc++.h"
#include <set>
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 rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 0 | 59,716,423 |
#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>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #include <bits/stdc++.h>
#define NIL -1
#define INF 1000000001
using namespace std;
struct node{
int key,parent,left,right;
};
int main(){
int size_of_H;
int temp;
scanf("%d",&size_of_H);
vector<node> heap_array(size_of_H+1,node{-1,-1,-1,-1});
for(int i = 1;i <= size_of_H;i++){
scanf("%d... | 0 | 58,268,125 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
using Graph = vector<vector<int>>;
int main(){
string S;
cin >> S;
S[5] = ' ';
S[13] = ' ';
cout << S << endl;
} | #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 ... | 0 | 18,143,627 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#includ... | #include<iostream>
#include<vector>
using std::cout;
using std::cin;
using std::endl;
using std::vector;
void printVector(vector<vector<int> > v) {
for (int i = 0; i < v.size(); i++) {
if (i % 3 == 0 && i != 0) {
cout << "####################" << endl;
}
for (int j = 0; j < v.fr... | 0 | 79,157,620 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
A.push_back(1e9);
int ans = 0;
for (int i = 0, cnt = 1; i < N; i++) {
if (A.at(i) != A.at(i + 1)) ans += cnt / 2, cnt = 1;
else cnt++;
}
cout << ans << "\n"... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int m = 0, f = 0, r = 0, count = 0;
string grade[100];
while (1){
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
if (m == -1 || f == -1) grade[count++] = "F";
else if (m + f >= 80) ... | 0 | 6,906,178 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 0 | 78,793,662 |
#include "bits/stdc++.h"
#define REP(i,num) for(ll i=0;i<(num);++i)
#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRC... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, i, j, cnt = 0; cin >> N;
vector<int> h(N);
for(i=0; i<N; i++) cin >> h[i];
while(true){
j = 0;
while(h[j] == 0) j++;
for(i = j; i < N; i++){
if(h[i] == 0){
cnt++;
break;
}
h[i]--;
if(i == N - 1) c... | 0 | 154,615 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<double> v;... | #include <iostream>
#include <string>
#include <map>
#include <vector>
using namespace std;
const vector<int> calcV(string s) {
int n = s.size();
map<char, int> usedMap;
vector<int> retV(n);
int count = 0;
for(int i = 0; i < n; ++i) {
if(usedMap.find(s[i]) == usedMap.end()) {
use... | 0 | 99,602,138 |
#include <iostream>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
if (A != 1 && B != 1) {
cout << "1" << endl;
}
else if (A != 2 && B != 2) {
cout << "2" << endl;
}
else if (A != 3 && B != 3) {
cout << "3" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s, t;
cin >> s >> t;
bool flag = true;
for (int i = 0; i < s.size(); i++)
{
if (s[i] != t[i])
{
flag = false;
break;
}
}
if (flag == true)
{
cout << "Yes" << endl;
... | 0 | 8,933,514 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string taro, hana;
int n, taro_re, hana_re;
taro_re = hana_re = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> taro >> hana;
if (taro == hana) {
taro_re++;
hana_re++;
} else if (taro > hana) {
taro_re += 3;
} else ... | #include<bits/stdc++.h>
using namespace std;
int n,a,d,t[1000003],maxa=-1;
int gcd(int x,int y)
{
if(!y)
return x;
return gcd(y,x%y);
}
void fj(int x)
{
for(int i=2;i*i<=x;)
{
if(!(x%i))
{
++t[i];
while(!(x%i))
x/=i;
}
else
++i;
}
if(x>1)
... | 0 | 71,866,217 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
vector<int> x, s;
int par(int a) {
if (x[a] == a) return a;
return x[a] = par(x[a]);
}
int ans = 1;
void unite(int a, int b) {
int pa = par(a), pb = par(b);
if (pa == pb) return;
s[pa] += s[pb];
x[pb] = pa;
ans = ma... | 0 | 77,370,014 |
#include <sys/time.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <utility>
#include <cctype>
using namespace std;
using ll = long long;
using... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
int idx1, idx2;
std::string s1, s2;
unsigned int dp[1010][1010];
int main() {
std::cin >> s1 >> s2;
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
for(unsigned int i = 0; i <= s1.size(); ++i) {
for(unsigned int j = 0; j <= ... | 0 | 23,167,710 |
#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 ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
struct edge {
ll to;
ll cost;
};
struct graph {
ll V;
vector<vector<edge>> G;
vector<... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pii pair<int, int>
const int mod = 1e9+7;
const int MAXN = 1e5+5;
const int N = 1e5+5;
int fac[N];
int spf[MAXN];
void pre(int p) {
fac[0] = 1;
for(int i=1; i<N; i++) {
fac[i] = (fac[i-1... | 0 | 62,302,625 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long n, i, j;
cin >> n;
vector<int> cnt(26, 0);
string t;
cin >> t;
for (i = 0; i < t.size(); i++)
{
cnt.at(t.at(i) - 'a')++;
}
for (i = 1; i < n; i++)
{
string s;
cin >> s;
vector<int> cnt... | 0 | 97,951,285 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define Int long long
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
Int n;
cin>>n;
Int cv=0;
for(Int i = 1;i<=n;i++)
{
cv+=(i)*(n-i+1);
}
for(Int i = 1;i<n;i++)
{
Int x,y;
c... | #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 N; cin>>N;
vector<int> vW(N);
int total=0;
rep(i,N){
int x; cin>>x;
total += x;
vW[i]=x;
}
int ans = 1e9;
int left = 0;
for(int i=0; i<... | 0 | 47,096,274 |
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) pu... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector <long long> A(N+1);
vector <long long> B(N);
for (long long i=0; i<=N; i++) cin >> A.at(i);
long long ans=0;
for (long long i=0; i<N; i++) {
long long B;
cin >> B;
ans += min(B, A.... | 0 | 39,853,722 |
#include<iostream>
#include<algorithm>
#define ll long long int
using namespace std;
int N,A,B;
int main()
{
int con;
cin>>N>>A>>B;
if (B>N-A+1||(ll)A*(ll)B<(ll)N)cout<<-1<<endl;
else
{
for (int i=N-A+1;i<=N;i++)cout<<i<<" ";
while (1)
{
N-=A;
B--;
if (!N&&!B)break;
A=N%B==0?N/B:N/B+1;
for (in... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> A(100000),L(100000);
int lis(){
L[0]=A[0];
int length=1;
for(int i=0;i<n;i++){
if(L[length-1]<A[i]){
L[length++]=A[i];
}
else{
*lower_bound(L.begin(),L.begin()+length,A[i])=A[i];
}
}
... | 0 | 12,958,930 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int,int>;
const int dir[2][2] = {{-1,0},{0,1}};
const int mod = 1000000007;
const int INF = 0x3f3f3f;
#define all(v) v.begin(),v.end()
ll quick_pow(ll base, ll n) {
ll ans = 1;
while (n ) {
if (n & 1 )ans *= base;
... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
static const int MOD = 1000000007;
using ll = int64_t;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max(... | 0 | 3,105,553 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
int main(){
vector<int> v(3);
rep(i,3) cin>>v[i];
sort(v.begin(),v.end(),greater<int>());
string a=to_string(v[0]) + to_string(v[1]);
cout << stoi(a) + v[2] << endl;
} | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 46,926,871 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
const long long MOD = 1000000007;
const int MAX = 200001;
long long fac[MAX];
long l... | 0 | 62,180,846 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c;
cin >> a >> b >> c;
if(a == b && b == c)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define PII pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i+... | 0 | 99,296,986 |
#include <bits/stdc++.h>
using namespace std;
int h[110];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
for(int i=0;i<n;i++)cin>>h[i];
int ans=0;
for(;;)
{
int cnt=0;
bool zero=true;
for(int i=0;i<n;i++)
{
if(zero)
{
... | #include <bits/stdc++.h>
using namespace std;
bool skill(vector<long>& scores, long m, long x) {
for (int i = 0; i < m; i++) {
if (scores[i] < x) {
return false;
}
}
return true;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long n, m, x;
cin >> n >> m >> x;... | 0 | 74,741,033 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | #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 | 94,855,716 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char vowel;
cin >> vowel;
if(vowel=='a' || vowel=='i' || vowel=='u' || vowel=='e' || vowel=='o'){
cout << "vowel" << endl;
}else{
cout << "consonant" << endl;
}
} | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | 0 | 91,153,818 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
bool ans = false;
int d = 0;
int c = 0;
while(4*d <= N){
while(4*d+7*c <= N){
if(4*d+7*c == N){
ans = true;
break;
}
c++;
}
if(a... | 0 | 88,117,926 |
#include<cstdio>
#include<cstring>
const int MAXN = 100 + 10;
char s[MAXN], t[MAXN];
int main()
{
int n;
scanf("%d", &n);
getchar();
scanf("%s %s", s, t);
for (int i = 0; i < n;i++)
printf("%c%c", s[i], t[i]);
return 0;
} | #include<iostream>
using namespace std;
int main(){
int H,W;
cin >> H >> W;
char m[H][W];
int dp[H][W];
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> m[i][j];
dp[i][j] = 0;
}
}
if(m[0][0]=='#'){
dp[0][0] = 1;
}
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
... | 0 | 2,501,130 |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
int main(){
int time[100000];
int n;
while(cin>>n,n!=0){
memset(time,0,sizeof(time));
for(int i = 0;i<n;i++){
int h,m,s;
scanf("%d:%d:%d",&h,&m,&s);
time[h * (60*60) + m * 60 + s]++;
scanf("%d:%d:%d"... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 39,369,254 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define N 100005
vector<int> adj[N];
int a[N], dp[N];
bool dfs(int node, int p) {
if (adj[node].size() == 1) {
dp[node] = a[node];
return true;
}
int maxi = 0;
long long sum = 0;
int sz = adj[no... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int W[N];
int sum = 0;
for (int i = 0; i < N; i++)
{
cin >> W[i];
sum += W[i];
}
int ans = INT_MAX;
int suml = 0;
for (int i = 0; i < N - 1; i++)
{
sum -= W[i];
suml +=... | 0 | 81,719,144 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
string n;
cin >> s >> n;
int count = 0;
for(int i = 0; i < s.size(); i++){
if(s[i] != n[i]){
count++;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
constexpr ll mod = ll(1e9 + 7);
int main () {
ios::sync_with_stdio(0); cin.tie(0);
int TT = 1;
while (TT--) {
ll n,a,b;
cin >> n >> a >> b;
vector<ll> A(n);
for (auto& aa : A) cin >> aa;
ll na = 0, nb = 0, nm = 0;
for (ll x ... | 0 | 17,690,770 |
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<cmath>
#include<ctime>
#include<complex>
using namespace std;
#define ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using ... | 0 | 13,502,316 |
#include<iostream>
#include<stdlib.h>
using namespace std;
int a,b,cnt;
int* p;
void rec(int x,int y){
if(x==a-1&&y==b-1){cnt++;return;}
if(x<a-1&&p[(x+1)+y*a]==0)rec(x+1,y);
if(y<b-1&&p[x+(y+1)*a]==0)rec(x,y+1);
}
int main () {
while(cin>>a>>b,a|b){
cnt=0;
int d[a*b]={};p=d;int k;cin>>k;
for(int i=... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | 0 | 6,804,363 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
#define vi vector<int>
#define INF 1000000000
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int S, W;
cin >> S >> W;
string safety = W >= S ? "unsafe" : "safe";
cout << safety << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void){
string s;
cin >> s;
vector<int> a(26);
for(int i = 0;i < s.size();i++){
a[s[i] - 'a']++;
}
for(int i = 0;i < 26;i++){
if(a[i] == 0){
char ans = 'a' + i;
cout << ans << endl;
... | 0 | 29,645,130 |
#include <bits/stdc++.h>
using namespace std;
string s,ans;
int n,num,now;
int csize[10]={0,5,3,3,3,3,3,4,3,4};
char btn[10][5]={
{'-','-','-','-','-'},
{'.',',','!','?',' '},
{'a','b','c','-','-'},
{'d','e','f','-','-'},
{'g','h','i','-','-'},
{'j','k','l','-','-'},
{'m','n','o','-','-'},
{'p','q','r',... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
int main(void)
{
int N, K;
cin >> K >> N;
vector<int> A(N);
REP (i, N) {
cin >> A[i];
}
vector<int> B(N);
int maxValue = -1;
int total = 0;
REP (i, N) {
if (i... | 0 | 62,756,718 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, d, x;
cin >> n >> d >> x;
int ans = 0;
for(int i = 0; i < n; i++)
{
int a;
cin >> a;
ans += 1 + (d - 1) / a;
}
ans += x;
cout <... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int nums[n];
for(auto i = 0; i < n; ++i){
cin >> nums[i];
}
int count = 1;
int mx = nums[0];
for(int i = 1; i < n; ++i){
if(nums[i] >= mx){
count++;
}
m... | 0 | 123,454 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
ty... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 0 | 76,907,927 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
long long MOD = 1000000007;
int popcount( int a ) {
int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> A[n+1];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
A[a].push_back(b);
A[b].push_back(a);
}
queue<int> nodes;
... | 0 | 5,176,016 |
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
#define nl cout<<"\n";
#define ll long long int
#define REP(i,a,n) for(i=a;i<=n;i++)
#define F(i,a,b) for(i=a;i<b;i++)
#define RF(i,b,a) for(i=b;i>=a;i--)
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const ll mod=1e15;
const ll MAXN=5200;
ll... | #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, m;
cin >> n >> m;
multiset<int> money;
int a;
rep(i,n){
cin >> a;
money.insert(a);
}
rep(i,m){
auto itr = money.end();
itr--;... | 0 | 34,135,461 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void solve() {
ll n;
cin >> n;
vector<ll> ret;
ret.resize(50);
for(int i = 0; i < 50; i++) ret[i] = 49;
ll fullInc = n/50;
n %= 50;
for(int i = 0; i < 50; i++) ret[i] += fullInc;
i... | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
LL a[100005];
int main() {
LL n, m, v, p;
cin >> n >> m >> v >> p;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, [](LL x, LL y) { return x > y; });
LL ans;
LL agg... | 0 | 90,151,573 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main(void) {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
ans +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
string s;ll n;
cin>>s>>n;
for(int i=0;i<s.size();i+=n){
cout << s[i];
}
return 0;
} | 0 | 49,659,786 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
vector<int> v(26, 0);
int len = s.size();
sort(s.begin(), s.... | 0 | 56,547,531 |
#include <bits/stdc++.h>
#define Int int64_t
#define pb push_back
using namespace std;
Int find(Int n)
{
Int count = 0;
for (Int i = 5; n / i >= 1; i *= 5)
count += n / i;
return count;
}
int main()
{
Int N;cin>>N;
if(N&1){
cout<<0<<"\n";
return 0;
}
cout<<find(N/2)<<"\n";... | #include <iostream>
#include <limits>
using namespace std;
int solve(int *cr, int n) {
int m[101][101];
for (int i = 1; i <= n; i++) m[i][i] = 0;
for (int length = 2; length <= n; length++) {
for (int begin = 1; begin <= n - length + 1; begin++) {
int end = begin + length - 1;
m[begin][end] = nume... | 0 | 16,325,017 |
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <functional>
#include <string>
#include <queue>
#include <vector>
using namespace std;
int main() {
int d;
while (scanf("%d", &d) == 1) {
int a = 0;
for (int x = 0; x < 600; x += d)
a += d * x * x;
... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
using namespace std;
const int INF = 1e8;
int main() {
int K, res;
cin >> K;
std::vector<bool> is_visited(K, false);
std::deque<pair<int, int>> deq;
deq.push_back(std::make_pair(1, 0));
w... | 0 | 52,341,468 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
int main(void) {
double x;
cin >> x;
x /= 3;
double res = x * x * x;
printf("%.10f\n", res);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int cnt = 0;
for (int i=1; i<=n; i++){
int note = to_string(i).length();
if ( note%2!=0 ){
cnt++;
}
}
cout << cnt << endl;
} | 0 | 42,589,226 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N,M;
cin >> N >> M;
vector<ll... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
#define ull unsigned long long
#define ld long double
#define uint unsigned int
struct debug {
~debug() {cerr << "\n";}template<class C> debug& operator<<(C c) {cerr << c;return *this;}
};
#define var(x) " [" << #x << ": " << x << "]"
c... | 0 | 73,301,472 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int n;
cin >> n;
if(n==0)break;
string s;
int r=0,l=0,sum=0,ans=0;
rep(i,n){
cin >> s;
if(s[0] == 'l'){
if(l) l=0;
else l=1;
}
if(s[0] == 'r'){
if(r) r=0;
else r=1;
... | #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>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
bool seen[200010];
int dist[200010... | 0 | 9,875,517 |
#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>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll MAXN = 802... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i,n) for(long long i=0; i<n; i++)
#define repr(i,n,m) for(long long i=m; i<n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#defi... | 0 | 11,061,479 |
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int s;
cin>>s;
map<int,int> mp;
int tmp =1,ans;
mp[s]=tmp;
while(true){
tmp++;
if(s%2==0){
s/=2;
if(mp.count(s)){
ans=tmp;
break;
}
... | 0 | 25,046,229 |
#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>;
const ll MOD = 1e9 + 7;
int main(void){
int s;
cin >> s;
vector<int> dp(s + 1);
fill(dp.begin(), dp.end(), 0);
dp[0] = 1;
for(int i = 3; i <= s; ++i){
... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, _s, n) for(int i = _s, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
#define repi(itr, ds) for(auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T>
ist... | 0 | 54,156,542 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#define LL long long
#define PP std::pair<LL,int>
LL W, H;
LL SW[100010], SH[100010];
std::vector<PP> P;
LL ans;
LL a[2];
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
std::cin >> W >> H;
a[0] = W + 1, a[1] = H + 1;
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# d... | 0 | 77,489,283 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<P>ab(N);
vector<P>cd(N);
for(int i = 0; i < N; i++) {
int a,b;
cin >> a >> b;
... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) {
cin >> a.at(i);
}
sort(a.begin(),a.end());
if(k >= n) {
cout << 0;
}
else {
rep(i,k) {
... | 0 | 38,080,240 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'a') {
cout << "vowel" << endl;
}
else if (c == 'i') {
cout << "vowel" << endl;
}
else if (c == 'u') {
cout << "vowel" << endl;
}
else if (c == 'e') {
cout << "vowel" << endl;
}
else if (c == 'o')... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,sum,owt;
cin >>N>>K;
int A[N];
for(int i=0;i<N;i++){
cin >> A[i];
}
map<int,int> S;
int a=0;
for(int i=0;i<N;i++){
S[A[i]]++;
}
int T[S.size()];
for(int i=0;i<S.size();i++){
if(S[i]!=0) sum++;
T[i] = S[i];
}
sort... | 0 | 60,438,268 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int v,s,t;
cin>>v>>t>>s;
if (t*s>=v)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 32,789,657 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int nCr(int A, int B) {
ll ans = 1;
for (int i = 0; i < B; i++) {
ans*= A - i;
}
for (int i = 0; i < B; i++) {
ans /= i + 1;
}
return a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
int dp[n+1];
for(int i = 0; i < n; i++){
cin >> arr[i];
dp[i+1] = INT_MAX;
}
dp[0] = 0;
for(int i = 0; i < n; i++){
for(int j = i+1; j <= i+k; j++){
if(j < n){
dp[j] = min(dp[j], dp[i]+abs(arr[j]-arr[i])... | 0 | 22,420,248 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | #include<iostream>
#include<vector>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<map>
#define INF 0xFFFFFF
#define ull unsigned long long
#define ll long long
#define ms(x,a) memset(x,a,sizeof(x))
#define endl "\n"
#define M(a,b) (a+b)/2
#define L(x) 2*x
#define R(x) 2*x+1
using namespace std;
ty... | 0 | 40,024,683 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
double input[n];
rep(i, n) cin >> input[i];
sort(input, input+n);
double res = input[0];
for(int i=0; i<n; i++) res = (res + input[i])/2;
cout << res ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,k,x,y;
cin>>n>>k>>x>>y;
int sum=0;
if(k>n)
{
cout<<n*x<<endl;
}
else
{
sum+=(k*x);
... | 0 | 17,245,675 |
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> Que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
string s;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a.at(i);
vector<int> b = a;
sort(b.begin(),b.end(),greater<int>());
int first_v = b.at... | 0 | 31,146,897 |
#include<bits/stdc++.h>
using namespace std;
#define INFTY 10000000000
typedef long long int ll;
const int MOD=1000000007;
using Graph = vector<vector<int>>;
using ipair = pair<ll,ll>;
bool operator< (const ipair a, const ipair b){return a.first < b.first;};
#define rep(i,n) for (int i = 0; i < (n); ++i)
ll gcd(ll a, l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const ll MX = 1e18;
int main() {
int n;
cin >> n;
ll ans = 1;
bool ng = false;
rep(i,n){
ll a;
cin >> a;... | 0 | 5,889,119 |
#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<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include <iostream>
#include <vector>
#include <stack>
using namespace std;
struct Counter
{
int radix;
vector<int> value;
vector<int> index;
Counter(int radix)
{
this->radix = radix;
value.push_back(0);
index.push_back(0);
}
void add(int b)
{
if (b > inde... | 0 | 35,681,822 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
#define INF ((1<<30)-1)
#define LLINF (1LL<<60)
#define EPS (1e-10)
vector<int> divisor(int n) {
vector<int> ret;
for (int i = 1; i * i <= n; ++i... | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 96,105,516 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long ans = 0;
long long ma = A[0];
for (int i = 0; i < N; i++) {
ma = max(ma, A[i]);
ans += ma - A[i];
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m, k; cin >> n >> m >> k;
for(int i=0; i<=n; i++){
for(int j=0; j<=m; j++){
int tmp = i*(m-j) + j*(n-i);
if(tmp == k){
cout << "Yes" << endl;
return 0;
}
}
}
... | 0 | 45,517,457 |
#include<iostream>
#include<vector>
using namespace std;
void primeCal()
{
const int N = 1000000;
vector<bool> prime(N, true);
prime[0] = prime[1] = false;
for (int i = 2; i*i < N; ++i)
{
if (!prime[i])
{
continue;
}
for (int j = i*i; j < N; j += i)
... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | 0 | 87,533,408 |
#include<bits/stdc++.h>
using namespace std;
using ll =long long int ;
int main()
{
ll n,k,sum=0;
cin>>n>>k;
ll arr[n];
for(int i=0;i<n;i++)
{
ll x;
cin>>x;
sum+=x;
arr[i]=x;
}
sort(arr,arr+n);
if(k==0)
cout<<sum<<endl;
else
{
if(n-k>0)
{
ll sum1=0;
for(int j=... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(),(x).end()
#define re... | 0 | 32,943,724 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
#define INF 1e9
int main(){
int n,k;
cin>>n>>k;
vector<int>cost(n,0);
for(int i=0;i<n;i++){
cin>>cost[i];
}
vector <int> dp(n,INF);
dp[0]=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<=i+k;j++){
if(j... | 0 | 19,261,374 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void)
{
int x, y;
int i, st, large, small;
for(i = 1; i <= 3000; i++){
scanf("%d", &x); scanf("%d", &y);
small = x;
large = y;
if(y < small){
small = y;
large = x;
... | #include <iostream>
#include <string>
using namespace std;
int main(void){
string A,B;
cin >> A >> B;
if(A.size() != B.size()){
if(A.size() > B.size()){
cout << "GREATER" << endl;
}
else{
cout << "LESS" << endl;
}
return 0;
}
for(int i=... | 0 | 14,913,857 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
int main(void)
{
ll n,m;
cin >> n >> m;
Graph g(n+1);
for(int i=0;i<m;i++)
{
ll a,b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
... | #include"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
const ll M = (1LL << N);
vector<ll> A(M);
for (ll i = 0; i < M; i++) {
cin >> A[i];
}
vector<pair<ll, ll>> dp(M, { 0, 0 });
for (ll i = 1; i < M; i++) {
vector<ll> candidate;
... | 0 | 88,020,715 |
#include<bits/stdc++.h>
using namespace std;
int dx[2] = {0,1};
int dy[2] = {1,0};
int area[17][17]={0};
int x,y;
int xg,yg;
int ans=0;
int saiki(int a,int b){
for(int i=0;i<2;i++){
if(a+dx[i] > x || b+dy[i] > y || area[a+dx[i]][b+dy[i]] == -1);
else if(area[a+dx[i]][b+dy[i]] == 2){
ans++;
}
els... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin>>S;
int count=0;
for(int i=1;i<3;i++){
if(S[i]==S[i-1]){
count++;
}
}
if(count==2){
cout<<"No"<<endl;
return 0;
}
else{
cout<<"Yes"<<endl;
}
return 0;
} | 0 | 67,448,398 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
while(true){
int ans = mod;
int N; cin >> N;
if(N == 0) break;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(A.begin(... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<cassert>
using namespace std;
int inf = 1000000000;
int func(string a){
string s = "";
if( 'a' <= a[0... | 0 | 42,968,542 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i-... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n, 0);
for (... | 0 | 93,826,393 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int cnt = 0;
rep(i, S.siz... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 26,497,646 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char str;
cin >> str;
if(str == 'A') cout << "T";
else if(str == 'T') cout << "A";
else if(str == 'C') cout << "G";
else if(str == 'G') cout << "C";
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<pair<int, int>> red(n), blue(n);
rep(i, n) {
int a, b;
cin >> a >> b;
red[i] = make_pair(a, b);
}
rep(i, n) {
... | 0 | 1,598,401 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int ans;
if (B <= C || D <= A) ans = 0;
else ans = min(B, D) - max(A, C);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1e9+7,INF=mod*mod*3ll;;
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define pb push_back
struct edge {ll to; ll cap; ll rev;} ;
vector<edge> G[205];
ll level[205];
ll iter[205];... | 0 | 61,436,552 |
#include<stdio.h>
int solve (int d)
{
int ans = 0;
int i=d;
while(i<600)
{
ans+=d*i*i;
i=i+d;
}
return ans;
}
int main()
{
int d;
while(scanf("%d",&d)==1)
{
printf("%d\n",solve(d));
}
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
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; retur... | 0 | 99,132,782 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k,i,j;
cin >> k >> i >> j;
bool t=true;
for(int d=i;d<=j;d++){
if(d%k==0){
t=false;
cout << "OK" <<endl;
break;
}
}
if(t)cout << "NG" << endl;
} | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;... | 0 | 67,456,656 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debug cout<<"debugged\n";
#define minval... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[])
{
int N;
string S;
cin >> N;
cin >> S;
int a = 0;
int b = 0;
int cnta = 0;
for (char c : S)
{
if ('(' == c)
{
cnta += 1;
}else
{
i... | 0 | 81,707,073 |
#include <bits/stdc++.h>
using namespace std;
#define _USES_MATH_DEFINES
#define x first
#define y second
int cmp(pair<int, int> a, pair<int, int> b) {
auto f = [](long double Rad) -> long double {
if( Rad < 0 ) Rad += (2*M_PI);
return Rad;
};
return f(atan2l(a.y, a.x)) < f(atan2l(b.y, b.x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
con... | 0 | 88,455,865 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
string s = to_string(n);
for (int i = 0; i < s.length(); ++i) {
if(s[i] == '1') cout << '9';
else cout << '1';
}
} | #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)
int main() {
int n, y;
cin >> n >> y;
int a = -1, b = -1, c = -1;
for (int i=0; i<=n; i++) {
for (int j=0; i+j<=n; j++) {
int k = n - i - j;
... | 0 | 12,657,140 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<cassert>
#include<numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 SORT(s) sort((s).begin(),(s).end())
#define SORTD(s) sort((s).rbegi... | 0 | 56,226,369 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<l... | 0 | 89,311,079 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int par[100010];
int rank_[100010];
void init(int n){
for(int i=0; i<n; i++){
par[i] = i;
rank_[i] = 0;
}
}
int find(int x){
if(x==par[x]){
return x;
}el... | #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 N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) {
... | 0 | 39,015,982 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){ci... | #include <iostream>
#include <string>
#include <math.h>
#include <stdio.h>
#include <ctype.h>
using namespace std;
int main() {
double ax,ay,bx,by,cx,cy,dx,dy;
int n;
cin>>n;
while(cin>>ax>>ay>>bx>>by>>cx>>cy>>dx>>dy){
if((ax-bx)==0&&(cx-dx)==0){
cout<<"YES"<<endl;
}else if((... | 0 | 33,698,789 |
#include<bits/stdc++.h>
typedef long long ll;
const ll mod=1e9+7;
const ll maxn=1e5+7;
const double pi=acos(-1);
using namespace std;
int a[maxn];
int main()
{
ios::sync_with_stdio(false);
int n,m,sum;
cin>>n>>m>>sum;
for(int i=0;i<m;i++)
{
if(i%2==0)
{
a[i/2]=sum;
}
else
{
... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <bitse... | 0 | 4,362,570 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[1001][1001];
int main()
{
string s,t;
cin >> s >> t;
int n = s.size(),m = t.size();
for(int i = 0;i<n+1;i++)
{
dp[i][0] = i;
}
for(int i = 0;i<m+1;i++)
{
dp[0][i] = i;
}
for(int i = 1;i<n+1;i++)
{
for(int j = 1;j<m+1;j++)
{
i... | #include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int S;
cin >> S;
map<int, int> list;
list[S]++;
while (true)
{
int tmp;
if (S % 2 == 0)
tmp = S /= 2;
else
... | 0 | 75,147,779 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MAXN = 110;
const int MAXK = 1e5+10;
const int MOD = 1e9+7;
int N, K;
int dp[MAXK];
void add_self(int& a, int b) {
a+=b;
if(a>=MOD){
a-=MOD;
}
}
void sub_self(int& a, int b) {
a-=b;
if(a<0){
a+=MOD;
}
}
i... | #include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N;
ll L, T;
while (cin >> N >> L >> T) {
vector<ll> X(N), W(N);
... | 0 | 14,054,540 |
#include <iostream>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[])
{
string input_line;
int *heights;
heights = new int[0];
int lineNum = 0;
while(cin)
{
getline(cin, input_line);
lineNum++;
int line = atoi(input_line... | #include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB(a) push_back(a)
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep... | 0 | 54,661,183 |
#include <iostream>
using namespace std;
int day(int y, int m, int d) {
int ans = 0;
for (int i=1; i<y; i++) {
if (i%3 == 0) {
ans += 200;
} else {
ans += 195;
}
}
bool dai = (y%3 == 0);
for (int i=1; i<m; i++) {
if (dai || i%2 != 0) {
ans += 20;
} else {
ans += 19;... | #include <bits/stdc++.h>
#include <string>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
long long lcm2(long long a, lon... | 0 | 73,295,819 |
#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<string> s(N);
rep(i, N) cin >> s.at(i);
int M;
cin >> M;
vector<string> t(M);
rep... | #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 | 6,952,418 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n; cin>>n;
double ans=0;
while(n--){
int x; cin>>x;
ans+=1.0/x;
}
cout<<pow(ans, -1)<<endl;
} | #include <bits/stdc++.h>
using namespace std ;
#define rep(i,n) for( int i = 0 ; i < n ; i++ )
typedef long long ll ;
int main(){
string s,t;
cin>>s>>t;
int n = s.length(); int k = t.length();
int st = -1;
for(int i=0;i<=n-k;i++)
{
bool flag = true;
for(int j=0;j<k;j++){
if(s[i+j] != t... | 0 | 38,713,307 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
const int INF = 1e9;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
#define PI 3.14159265358979323846264338327950L
#define MOD 100000000... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
int main(){
int N; std::cin >> N;
std::vector<int> H(N);
for (auto& r : H) std::cin >> r;
int count = 0;
int i = 1;
for (auto& r : H) {
if (i == r) {
++count;
++i;
}
}
std... | 0 | 27,355,826 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.