code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int h,w,i=0,j,c=0,k,a,b;
cin >> k >> a >> b;
while(1)
{
i++;
if(a<=k*i && b>=k*i)
{
cout << "OK" << endl;
return 0;
}
if(k*i>1000)
{
break;
}
}
co... | #include <stdio.h>
int main(){
int K, A, B;
scanf("%d", &K);
scanf("%d %d", &A, &B);
int L = B - A;
int count = 0;
for(int i = 0; i <= L ; i++){
int total = A % K;
A++;
if(total == 0){
count++;
}
else{
count = count + 0;
}
}
... | 1 | 59,470,228 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
string s;
cin >> s;
int n = s.length();
ll ans = 0, b = 0;
rep(i, n)
{
if (s[i] == 'B')
b++;
else
... | 1 | 80,537,710 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int H,W;
cin >> H >> W;
vector<string> A(H);
for(int i=0;i<H;i++){
cin >> A[i];
}
set<int> Hset,Wset;
for(int i=0;i<H;i++){
bool flag=true;
for(int j=0;j<W;j++){
if(A[i][j]=='#'){
flag=false;
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int h,w;cin>>h>>w;
vector<string> m(h);
for(int i=0;i<h;++i){
cin>>m[i];
}
vector<bool> hi(h,false);
vector<bool> wi(w,false);
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
if(m[i][j]=='#')... | 1 | 4,351,783 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... | 1 | 77,189,492 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define fi first
#define se second
#define pf push_front
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define debug(val) cerr << "Value " << #val << " : " << val << '\n... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define digit(a) to_string(a).size()
#define INF 10e12
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
int main(void)
{
... | 1 | 70,370,234 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n, m;
cin >> n >> m;
vector<vector<ll>> hune(2, vector<ll>(n, 0));
for(ll i = 0; i < m; i++){
ll a,b;
cin >> a >> b;
if(min(a, b) == 1) hune[0][max(a, b) - 1] = 1;
if(max(a, b) == n) hune[1]... | #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,m;
cin>>n>>m;
vector<int>to[n];
rep(i,m){
int a,b;
cin>>a>>b;
a--; b--;
to[a].push_back(b);
to[b].push_back(a);
}
for(int u:to[0]... | 1 | 42,221,789 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n_a = 0, n_b = 0;
for(int i = 0; i < 3; i++) {
char c;
cin >> c;
if(c == 'A') {
n_a++;
}
else {
n_b++;
}
}
if(n_a == 0 || n_b == 0) {
cout << "No\n";
}
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string S; cin >> S;
if(S.find("AAA") == 0 || S.find("BBB") == 0) cout << "No" << endl;
else cout << "Yes" << endl;
} | 1 | 59,169,816 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#i... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
#include<deque>
#include<bitset>
#include<map>
#include<set>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
inline ... | 1 | 5,416,224 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define y... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be() , (a).en()
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define REP2(i,s,n) for(int (i)=(s);(i)<(n);(i)++) ... | 1 | 52,694,760 |
#include <iostream>
#include <vector>
int main()
{
int data_count = 0;
while ((std::cin >> data_count) && (data_count > 0)) {
std::vector<long> dataset;
for (int i = 0; i < data_count; ++i) {
int data = 0;
std::cin >> data;
dataset.push_back(data);
}
long max_sum = dataset[0];
for (int i = 0; i < d... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
int n;
while(cin >> n, n){
vector<int> dp(n), vec(n);
for(int i=0;i<n;i++)cin >> vec[i];
dp[0]=vec[0];
for(int i=1;i<n;i++)dp[i]=max(dp[i-1]+vec[i],vec[i]);
cout << *max_element(dp.begin(), dp.end()... | 1 | 85,418,556 |
#pragma GCC optimize (3)
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<unordered_map>
#define ll long long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int64_t S; cin>>S;
int64_t x1=0,y1=0,x2=1,y2=1e9,x,y;
x=S/y2+(S%y2>0);
if(S%y2) y=y2-S%y2;
e... | 1 | 63,466,668 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int k, a, b;
cin>>k>>a>>b;
if((b/k)*k>=a)
cout<<"OK";
else
cout<<"NG";
} | #include<iostream>
using namespace std;
int main(void){
int A, B, K;
bool result{false};
cin >> K >> A >> B;
if(A%K == 0){
result = true;
}
else if((A/K+1)*K<=B){
result = true;
}
if(result){
cout << "OK" << endl;
}
else{
cout << "NG" << endl;
... | 1 | 18,998,981 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char A;
cin>>A;
if(A=='a'||A=='e'|| A=='i'|| A=='o'|| A=='u') cout<<"vowel"<<endl;
else cout<<"consonant"<<endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
string c;
cin >> c;
string B = "aiueo";
if(B.find(c) != string::npos) {
cout << "vowel" << endl;
} else {
cout << "consonant" << endl;
}
return 0;
} | 1 | 79,815,136 |
#include<string>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
char ctable[4] = {'m', 'c', 'x', 'i'};
int table[4] = {1000, 100, 10, 1};
int rmcxi(){
int r = 0;
string s;
cin>>s;
int start = 0;
for(int i = 0; i < s.size();i++){
for(int j = 0; j < 4; j++){
if(s[i] == ctable[j]){
if(start == i){... | #include <bits/stdc++.h>
using namespace std;
char mcxi[] = {'i', 'x', 'c', 'm' };
int calc(string s){
int res = 0;
for(int i = 0; i < s.size(); ++i){
int t = 1;
if('2' <= s[i] && s[i] <= '9'){
t = s[i] - '0';
++i;
}
if(s[i] == 'm'){
res += t * 1000;
}
else if(s[i] == 'c'){
res += t * 100;
}... | 1 | 29,264,161 |
#include <bits/stdc++.h>
using namespace std;
#define li long long int
#define FOR(i,l,r) for( li i = l-(l>r); i != r-(l>r); i += 1-2*(l>r) )
int main() {
li m,k; cin>>m>>k;
li u = (1ll<<m)-1;
if( k > u || ( k == 1 && m <= 1 ) ) {
cout<<"-1\n";
return 0;
}
if( k == 0 ) {
FOR(... | #include <iostream>
#include <cstdio>
using namespace std;
int n, k;
int main() {
int i;
cin >> n >> k;
if(k >= 1<<n) return puts("-1")*0;
if(n==1) {
if(k==0) return puts("0 0 1 1")*0;
else return puts("-1")*0;
}
printf("%d ", k);
for(i=0; i<1<<n; i++) if(i!=k) printf("%d ", i);
printf("%d ", k);
for(i=(1<... | 1 | 51,167,233 |
#include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int X,T;
cin >> X >> T;
if (X-T>=0) {
cout << X-T << endl;
} else if (X-T<0) {
cout << 0 << endl;
}
} | #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);... | 1 | 43,601,230 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
int h,w;
cin >> h >> w;
string s;
rep(i,h){
for(char c = 'A';c < 'A'+w;++c){
cin >> s;
if(s == "snuke"){
cout << c << i+1 << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
#define EACH(i,a) for (auto& i : a)
#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) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define debug(x) cerr << #x << ":" << x... | 1 | 62,232,522 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int intager[100]={0};
int num;
while(cin>>num)
intager[num-1]++;
int flag=0;
for(int i=100;i>0;i--){
for(int j=0;j<100;j++){
if(intager[j]==i){
cout<<j+1<<endl;
flag=1;
}
}
if(flag==1)
break;
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<cstring>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main()
{
int a[100];
memset(a,0,sizeof(a));
int in;
while(cin>>in)a[in-1]++;
vector<pair<int,int>> P;
rep(i,100)P.push_back(make_pair(a[i],i));
sort(P.begin(),P.end(),[](const pair<int,int> p... | 1 | 44,870,152 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main()
{
vector<int> c(3);
int i = 0;
for (int i = 0; i < 3; i ++)
cin >> c.at(i);
sort(c.begin(), c.end(), greater<>());
cout << c.at(0) * 10 + c.at(1) + c.at(2) << endl;
return 0;
} | #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;
int main(int argc, char*... | 1 | 46,367,656 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin>>h>>w;
char a[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a[i][j];
}
}
int l[h][w],r[h][w],u[h][w],d[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(a[i][j]=='#') l[i][j]=0;
else if(j==0... | 1 | 40,466,490 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n; cin>>n;
int an[n]; rep(i,n) cin >> an[i];
int cnt=0;
rep(i,n) {
int j = an[i]-1;
if (an[j]-1 == i) cnt++;
}
cnt /= 2;
cout<<cnt<<endl... | #include <iostream>
#include <vector>
int main()
{
int N;
std::cin >> N;
std::vector<int> a(N);
for(int i = 0; i < N; i++)
{
std::cin >> a[i];
}
int ans = 0;
for(int usa = 0; usa < N; usa++)
{
int aiteUsa = a[usa];
if(a[aiteUsa - 1] <= -1) continue;
if... | 1 | 21,047,480 |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <queue>
#include <map>
using namespace std;
const int M=200010;
int n, m,r[M];
int root(int x){
if (r[x] < 0) return x;
return r[x] = root(r[x]);
}
bool... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod=1e9+7;
int f[200005]={0};
int sz[200005]={0};
int n,m;
int ans=1;
int get(int x)
{
if(x==f[x])return x;
return f[x]=get(f[x]);
}
void merge(int x,int y)
{
int xx=get(x);
int yy=get(y);
if(xx!=yy){
f[xx]=yy;
sz[yy]+=sz[xx];
ans=ma... | 1 | 76,953,918 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int a, b;
cin >> a >> b;
if(a * b % 2) cout << "Odd" << endl;
else cout << "Even" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(a%2==0||b%2==0){
cout<<"Even"<<endl;
}else cout<<"Odd"<<endl;
return 0;
} | 1 | 84,526,492 |
#include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--... | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
ll n,ans = 1;
cin >> n;
ll a[n],t[n];
ll h[n];
for(int i=0;i<n;i++){
cin >> t[i];
if(i==0||t[i]!=t[i-1]){... | 1 | 69,014,076 |
#include<bits/stdc++.h>
using namespace std;
long long n,m,v,p,a[100010];
bool check(int x){
long long cnt=0;
if(a[x]+m<a[p-1])
return 0;
cnt+=(p-1)*m+(n-x)*m;
for(int i=p-1;i<x;i++)
cnt+=a[x]+m-a[i];
return (cnt>=m*v);
}
int main(){
cin>>n>>m>>v>>p;
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
reverse(a... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
const ll INF = 2e18;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
int ... | 1 | 55,221,312 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> s(N);
for (int i = 0; i < N; i++) {
char c;
cin >> c;
s[i] = (c == 'x');
}
if (N % 3 == 0) {
string ans(N, 'S');
for (int i = 1; i < N - 1; i++) {
if (ans[i] == 'S' && ans[i - 1] ... | 1 | 26,446,019 |
#include<vector>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007LL;
const ll INF=1000000000LL;
const int MAX=100001;
int ch(char c){
if(c=='m'){
return 1000;
}else if(c=='c'){
return 100;
}else if(c=='x'){
return... | #include <iostream>
#include <cctype>
#include <cstdlib>
using namespace std;
int main()
{
int n;
cin >> n;
for (int j = 0; j < n; j++) {
char num1[10], num2[10];
cin >> num1 >> num2;
int m = 0, x = 0, c = 0, i = 0;
int pos = 0;
while (num1[pos]) {
bool flag = false;
int tmpi;
if (isdigit(num1[pos... | 1 | 4,710,241 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<string,int> m;
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
sort(s.begin(),s.end());
m[s]++;
}
ll ans = 0;
for (auto it = m.begin(); it != m.end(); ++it) {
if (it->second > 1) {
ans += 1LL * ((... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int INF = 2e9;
int main(){
int n;
cin >> n;
vector<string> s(n);
map<string,ll> x;
ll ans = 0;
rep(i,n){
cin >> s[i];
sort(s[i].begin()... | 1 | 58,512,157 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typede... | #include<iostream>
using namespace std;
int main() {
int N;
cin >> N;
while (1) {
if (N % 111 == 0) {
cout << N << endl;
break;
}
else {
N++;
}
}
} | 1 | 33,601,273 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 1 | 46,503,715 |
#include <iostream>
using namespace std;
int main(void) {
string s,p;
bool flag = false;
cin >> s;
cin >> p;
s += s;
if(s.find(p) != string::npos)
flag = true;
if(flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include<cmath>
#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cctype>
#include<cstring>
using namespace std;
int main() {
char s[202]; cin >> s;
char p[101]; cin >> p;
char s1[202];
for (int i = 0; i < strlen(s); i++)s1[i] = s[i];
strcat(s, s1);
if (strstr(s, p))cout << "Yes" << endl;
else cout ... | 1 | 937,105 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
const int N = 2e7+5;
ll a[N];
void solve(){
int n;
cin>>n;
ll sum = 0;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
sum+=a[i]*a[j];
}
}
cout<<su... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define tc(t) int t; cin>>t; while(t--)
#define f(n) for(int i=0;i<n;i++)
#define endl "\n"
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<int> v(n);
int sum=0;
f(n)cin>>v[i];
for(int i=0;i... | 1 | 79,945,221 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a + b >= c){
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define each(it,v) for(auto &it : v)
#define mod 1000000007
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vl vector<long>
#define P pair<int,int>
using namespace std;
char c[26];
main()
{
... | 1 | 38,124,117 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
ll a[100005];
int main() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << k << endl;
return 0;
}
ll ans = k;
int i = 1;
while (i != n ) {
i++;
ans *= (k - 1);
}... | #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<int, int> 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; } re... | 1 | 95,382,520 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N;
cin >> N;
vector<ll> a(N);
for ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int) n; i++)
using ll = long long;
template <class T>
using vt = std::vector<T>;
using vvi = std::vector<vt<int>>;
int main(){
int n,cnt = 0;
std::cin >> n;
vt<int> a(n,-1);
rep(i,n) {
int num;
std::cin >> num;
--num;
a[i] = num;
i... | 1 | 33,375,870 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
vector<int> filho[100005];
ll dp[100005][2];
ll dfs(int pai, int cor, int pos)
{
if(dp[pos][cor] > 0)
return dp[pos][cor];
for (int i = 0; i < (int)filho[pos].size(); ++i)
{
int viz = filho[pos][i];
ll valor = 0;
if(vi... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<bool> vb;
typedef vector<ull> vul;
ty... | 1 | 29,106,905 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 1 | 16,190,818 |
#include<bits/stdc++.h>
using namespace std;
long long k=9,n;
struct node
{
long long a,b;
};
queue<node>Q;
int main()
{
cin>>n;
for(int i=1;i<=9;i++)
{
node tmp;
tmp.a=tmp.b=i;
Q.push(tmp);
}
while(!Q.empty())
{
node tmp=Q.front();
Q.pop();
long long a=tmp.a,b=tmp.b,t=tmp.a%10;
if(b==n)
{
c... | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f3f
using namespace std;
queue... | 1 | 72,307,609 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long a, b, c, k;
cin >> a >> b >> c >> k;
const long long inf = pow(10, 18);
long long ans = a - b;
if(abs(ans) > inf){
cout << "Unfair" << endl;
return 0;
}
if(k % 2) cout << -ans << endl;
else cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 100000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
typedef int64_t ll;
ll A, B, C, K;
int main() {
cin >> A >> B >> C >> K;
if... | 1 | 20,897,579 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<vector<int>>retu(8,vector<int>(3));
vector<vector<int>>card(3,vector<int>(3));
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin >> card.at(i).at(j);
}
}
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
retu.at(i).at(j)=card.at(i... | #include <stdio.h>
int main() {
int box[3][3];
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
scanf("%d",&box[i][j]);
}
}
int tc;
scanf("%d",&tc);
int bingo[10];
for (int i = 0; i < tc; i++)
{
scanf("%d",&bingo[i]);
}
int ctr[3][3] = {0};
for (int i = 0; i < tc; i++)
{
for (int j... | 1 | 96,094,934 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
int main() {
int n;
cin >> n;
cout << n / 3 << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n; cin>>n;
cout<<n/3<<endl;
} | 1 | 56,921,454 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int A, B, K;
cin >> A >> B >> K;
for (int i=0; i<K; i++) {
if (i%2==0) {
if (A%2!=0) A--;
B += A/2;
A /... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A, B, K;
cin >> A >> B >> K;
for(int i=0; i<K; i++){
if(i %2 == 0){
if(A %2 == 1){
A--;
}
B += A / 2;
A = A / 2;
}
if(i %2 != 0){
if(B %2 == 1){
B--;
}
A += B / 2;
B = B / 2;
}
... | 1 | 56,830,997 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
string s;
cin>>s;
n=s.size();
int pos=0;
long long int ans=0;
while(pos<n)
{
int coun1=0;
while(s[pos]=='<' && pos<n){
++pos;
coun1++;
}
int coun2=0;
while(s[p... | #define _GLIBCXX_DEBUG
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<string>
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define rep2(i,s,n) fo... | 1 | 5,803,396 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[100];
int main(){
ll k; int n=50;
cin>>k;
cout<<n<<endl;
for (int i=1; i<=n; ++i)
a[i]=n-1+k/n;
k%=n;
for (int i=1; i<=k; ++i)
a[i]+=n-k+1;
for (int i=k+1; i<=n; ++i)
a[i]-=k;
for (int i=1; i<=n; ++i)
cout<<a[i]<<" "... | #include <iostream>
#include <stdio.h>
#include <string.h>
#define int long long
using namespace std;
signed main()
{
int n=50,K;
scanf("%lld",&K);
int avg=K/n,rst=K%n;
printf("%lld\n",n);
for(int i=1;i<=rst;i++) printf("%lld ",n-1+avg-rst+n);
for(int i=rst+1;i<=n;i++) printf("%lld ",n-1+avg-rst);
printf("\n");
... | 1 | 90,443,035 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << ceil(n/111.0)*111 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
int a[9];
int cnt=111;
rep(i,9){
a[i]=cnt;
cnt+=111;
}
rep(i,9){
if(n<=a[i]){
cout << a[i] << endl;
return 0;
}
}
} | 1 | 63,858,027 |
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | #include<cstdio>
#include<cstdlib>
#include<string>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
#include<functional>
#include<ios>
#include<iomanip>
using names... | 1 | 74,938,961 |
#include<bits/stdc++.h>
#define speed_up ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ara(A,N) sort(A,A+N)
#define rev(A,N) sort(A,A+N,greater<long long>())
using namespace std;
int main()
{
int m, n, i, j, k, l;
cin>>n>>m;
vector<string> a(n), b(m);
for(i = 0; i<n; i++)
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n... | 1 | 83,808,854 |
#include<stdio.h>
int main(){
int a[3];
int i,j,tmp;
scanf("%d%d%d",&a[0],&a[1],&a[2]);
for(i=0;i<3;i++){
for(j=1;i<=j;j--){
if(a[j]>a[j+1]){
tmp = a[j];
a[j] = a[j+1];
a[j+1] = tmp;
}
}
}
printf("%d %d %d\n"... | #include <iostream>
int main(){
int data[3];
int tmp;
std::cin >> data[0] >> data[1] >> data[2];
for (int i = 0; i < 3; i++){
for (int j = 2; j > 0 + i; j--){
if (data[j] < data[j - 1]){
tmp = data[j];
data[j] = data[j - 1];
data[j - 1] = tmp;
}
}
}
std::cout << data[0] << " " << data[1] << ... | 1 | 40,286,589 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef ... | #include<iostream>
using namespace std;
int main(){
int a[10];
int temp;
for(int m=0; m<10; m++)
{
cin >> a[m];
}
temp=a[0];
for(int i=0; i<10; i++)
{
for(int j=0; j<10;j++)
{
if(a[i] > a[j])
{
temp=a[i];
... | 1 | 71,456,178 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
string T = "keyence",S1 = " ", S2 = " ",T1;
int k = 0;
bool flag = true;
for(int i = 0; i < S.size(); i++){
if(S[i] != T[k] && flag == true){
flag = false;
S1 = S.substr(0,i);
... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 1 | 26,280,006 |
#include <bits/stdc++.h>
#define long long long int
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, p;
cin >> n >> p;
string s;
cin >> s;
if (p < 10) {
vector<int> cnt(p);
int cur = 0;
long res = 0;
cnt[0]++;
for (int i = 0; i < n; i+... | #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, P;
string S;
cin >> N >> P >> S;
if (P == 2 || P == 5) {
ll ans = 0;
rep(i, N) {
if ((S[i] - '0') % P == 0) ans += i + 1;
}
co... | 1 | 32,941,858 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N; cin >> N;
ll ans = 0;
for(int i = 0; i < N; i++){
ll l, r; cin >> l >> r; ans += r-l+1;
}
cout << ans << endl;
} | #include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
int n;
cin >> n;
int ans = 0;
repi(i, n, 0)
{
int l, r;
cin >> l >> r;
ans += r ... | 1 | 478,950 |
#include <bits/stdc++.h>
using namespace std;
#define MorsheD ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
typedef long long ll;
bool mew(int n) {
while (n) {
if (n%10 == 7) {
return true;
}
n /= 10;
}
return false;
}
int main(){
MorsheD;
int n;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string N;
cin >> N;
rep(i, 3) {
if (N[i] == '7') {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
} | 1 | 54,052,850 |
#include <iostream>
#include <iomanip>
using namespace std;
constexpr int MAXT = 2 * 101 * 200, MAXV = 2 * 101;
constexpr double inf = 1e9;
double dp[MAXT][MAXV];
int main(){
cin.tie(0); ios_base::sync_with_stdio(false);
int N; cin >> N;
int T[100], V[100];
for(int i=0; i < N; ++i) cin >> T[i];
for(... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, L, R;
double count = 0, ans = 0;
pair<double, double> P[100];
map<double, double> mpL, mpR, mp;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P[i].first;
count += P[i].first;
if (i != 0) P[i].first += P[i - 1].first;
}
for (int i = 0; i < ... | 1 | 45,422,313 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int cnt[110] = {};
int num(int n) {
int res = 0;
for (int i = 0; i < 110; ++i) {
if (cnt[i] >= n - 1) res++;
}
return res;
}
void prime_factor(int n) {
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 1 | 28,750,969 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
string s0;
int n, a, b;
string str[3] = {"replace", "reverse", "print"};
cin >> s0 >> n;
rep(i,n) {
string s1;
cin... | #include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#include <vector>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
ostringstrea... | 1 | 34,284,794 |
#include <bits/stdc++.h>
using namespace std ;
int main()
{
ios_base::sync_with_stdio(false) ;
cin.tie(0) ;
cout.tie(0) ;
int n ;
cin >> n ;
int flag = 0 ;
while(n)
{
if(n % 10 == 7)
{
flag = 1 ;
break ;
}
n = n / 10 ;
}
if(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define INF 1e9
#define DEBUG(x... | 1 | 58,161,840 |
#include <iostream>
#include <iomanip>
#include <unordered_map>
#include <vector>
#include <queue>
#include <algorithm>
#include <unordered_set>
#include <cmath>
using namespace std;
struct point {
int x;
int y;
};
int main() {
int n;
cin >> n;
vector<point> points(n);
for (int i = 0; i < n; i++) {
int ... | #define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | 1 | 80,141,223 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #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 int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T>
void print_vec(vector<T> v) {
for (T i : v) cout << i << " ";
cout << end... | 1 | 77,474,225 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N;
cin >> N;
ll ans = 0;
ll n = 5;
if (N % 2) {
cout << 0 << endl;
return 0;
} else {
while (n <= N) {
ans += N / (n*2);
n *= 5;
}
cout << ans << endl;
}
} | #include<bits/stdc++.h>
#include<cstring>
#include<cmath>
#include<iterator>
#include<cstdlib>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define test long long t;cin >> t;while(t--)
#define ses "\n"
#define whp " "
#define mxi 1000000
#define REP(i,a,b) for(int i=a; i<b; i++)
#define rep0(i,n... | 1 | 71,632,833 |
#include <cstdio>
using namespace std;
int main() {
int n = 0;
double N = 0;
int M = 0;
int L = 100;
int c = 0;
scanf("%d", &n);
for (int i = 0;i < n; i++) {
N = L;
M = L;
c = 0;
N *= 1.05;
N -= M;
while (N > 1) {
N -= 1;
c += 1;
}
if ( N > 0) {
L += 1;
}
L += c;
... | #include <iostream>
using namespace std;
int main(void)
{
int y = 100000;
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
y += y * 0.05;
if (y % 1000 != 0)
{
y = ((y / 1000) + 1) * 1000;
}
}
cout << y << endl;
} | 1 | 36,457,696 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#includ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll a,b,c,d; cin>>a>>b; c=min(a,b); d=max(a,b);
ll l=__gcd(c,d);
ll r=(a*b);
cout<<r/l;
} | 1 | 67,586,369 |
#include<iostream>
using namespace std;
int f(int x){
return x*x;
}
int integral(int d, int d0){
if(d >= 600){
return 0;
}
return(f(d)*d0 + integral(d+d0, d0));
}
int main(){
int d;
while(cin >> d){
cout << integral(d, d) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i <= _##i poi i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i < _##i poi i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i... | 1 | 46,248,807 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
int max = (a > b) ? a : b;
int min = (a > b) ? b : a;
while (max % min)
{
int tmp = max % min;
max = min;
min = tmp;
}
return min;
}
int main()
{
int n, x, ans(0);
cin >> n >> x;
int city[n]... | #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++)
#define ve vector
int main(){
int n;
cin >> n;
ve<int> a(n+1);
rep(i,n+1) cin >> a[i];
sort(a.begin(), a.end());
ve<int> sa(n);
rep(i,n) sa[i] = a[i+... | 1 | 82,619,684 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,m;
const int N = 200005;
int par[N], rnk[N];
int get(int x){
if(x==par[x]) return x;
else return par[x] = get(par[x]);
}
void union_set(int c, int d){
c=get(c);
d=get(d);
if(c!=d){
if(rnk[c]>rnk[d])swap(c, d);
par[c]=d;
rnk[d] += rnk[c];... | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const ll oo = 1e18 + 7;
const ll mod = 1e9 + 7, maxn = 2e5 + 10;
const long double PI = acos(-1);
int cnt = 1, ps[maxn], sz[maxn];
int find(int x){
if ... | 1 | 92,207,099 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
vector<int> cnt(26);
ll ans =0;
for(auto c:s)
{
for(int i =0 ;i<26;i++)
{
if(i+'a'==c)continue;
ans+=cnt[i];
}
cnt[c-'a']++;
}
cout<<ans+1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200000 + 10;
char s[N]; int c[30];
int main() {
scanf("%s",s+1);
for(int i=1;s[i];i++) c[s[i]-'a']++;
LL n=strlen(s+1);
LL tot=n*(n-1)/2;
for(int i=0;i<26;i++){
tot=tot-1LL*c[i]*(c[i]-1)/2;
}
tot++;
cout<<tot<<endl;
} | 1 | 29,119,531 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
char maze[1005][1005];
int d[1005][1005];
int dirx[4] = {0, -1, 0, 1};
int diry[4] = {1, 0, -1, 0};
int h, w, n, hard;
int si, sj;
const int INF = 1<<30;
int tot = 0;
void BFS(int ai, int aj){
queue<P> que;
for(int i = 0; i < h; i++){
for(int... | #include<cstdio>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<queue>
using namespace std;
typedef pair<int,int> P;
#define INF 1000000
int dx[4]={1,0,0,-1}, dy[4]={0,1,-1,0};
int d[1010][1010];
char r[1010][1010];
char point[10]={'S','1','2','3','4','5','6','7','8','9'};
int H,W,N;
int res=0;
int ... | 1 | 58,590,079 |
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int>P;
vector<int>E[100];
int d[100];
int main(){
int n;cin>>n;
rep(i,n){
int u,k;cin>>u>>k;u--;
rep(i,k){
int v;cin>>v;v--;
E[u].push_back(v);
}
}
memset(d,0x3f,sizeof(d));
queue<P... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
int inf = 1000000000;
class Graph{
public:
int v;
int cost = inf;
int ftime = -1;
int... | 1 | 94,112,956 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <iomanip>
#include <cstring>
using namespace std;
typedef long long ll;
typed... | #include <iostream>
#include <cstdio>
using namespace std;
char c;
long long a, b;
long long ans;
bool check()
{
return a%b==0;
}
void solve()
{
if (check())
ans = -1;
else
ans = a*(b-1);
return;
}
main()
{
cin.tie(0);
ios::sync_with_stdio(0);
cin >> a >> b;
solve();
... | 1 | 25,258,436 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
int a,b,c; cin >> a >> b >> c;
int d = a%b;
int s = d;
while(1){
if(d == c) break;
else{
d += s;
d %= b;
if(d == s) bre... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x... | 1 | 93,460,018 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | 1 | 59,159,217 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll a,b;
cin >> a >> b;
vector<ll>ans(10,0);
if(a>b){
for(ll i=0;i<a;i++){
ans[i]=b;
}
}
else {
for(ll i=0;i<b;i++){
ans[i]=a;
}
}
for(ll i=0;i<10;i++){
if(ans[i]==0) bre... | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int x=max(a,b);
int y=min(a,b);
for(int i=0;i<x;i++){
cout << y;
}
} | 1 | 85,876,803 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | #include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
string S;
cin >> S;
if (S == "keyence" || S.substr(0,7) == "keyence" || S.substr(S.size()-7,7) == "keyence") {
cout << "YES" << endl;
return 0;
}
vector<vector<string>> v = {
{"k", "eyence"},
... | 1 | 78,669,231 |
#include<bits/stdc++.h>
using namespace std;
const int MAX = 2 * 1000 * 100 + 11;
int parent[MAX];
int sizeOfSet[MAX];
int n, m;
void make_set(int node) {
parent[node] = node;
sizeOfSet[node] = 1;
}
int find_set(int node) {
if(node == parent[node]) {
return node;
}
return parent[node] = find_set(parent[node]);
}... | #include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
int n,q,p[maxn];
int find(int u)
{
if(p[u]!=u) p[u]=find(p[u]);
return p[u];
}
void read(int& ret)
{
ret=0;
char ch=getchar();
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9') ret=(ret<<3)+(ret<<1)+ch-'0',ch=getchar();
}
int main()
{
r... | 1 | 41,865,845 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | #include <iostream>
#include <cstdio>
using namespace std;
int X;
int main () {
scanf ("%d", &X);
for (int i = 1; ; ++i) if (i * X % 360 == 0) { printf ("%d\n", i); return 0; }
return 0;
} | 1 | 59,230,895 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | #include <bits/stdc++.h>
using namespace std;
int64_t leftPs(int n, int64_t x) {
int64_t sz = (1LL << (n + 2)) - 3;
if (x == sz) return (1LL << (n + 1)) - 1;
if (x == 1) return 0;
if (x == sz / 2 + 1) return 1LL << n;
if (x < sz / 2 + 1) return leftPs(n - 1, x - 1);
if (x > sz / 2 + 1) return (1... | 1 | 98,708,083 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<math.h>
using namespace std;
const float TH = 60.0 * M_PI/180.0;
typedef struct {
float x;
float y;
} Vertex;
void Koch(int d, Vertex p1, Vertex p2);
int main() {
int deep;
Vertex p1;
Vertex p2;
p1.x = 0; p1.y = 0;
p2.x = 100; p2.y = 0;
cin >> deep;
cout <<... | #include<iostream>
#include<cmath>
#include<iomanip>
#define PI 3.141592
using namespace std;
struct coordinate{
double x;
double y;
};
void kock(int n,struct coordinate left,struct coordinate right){
if (n == 0) return;
struct coordinate s,t,u;
s.x = (left.x * 2 + right.x * 1)/3;
s.y = (left.y * 2 + right.y * 1)... | 1 | 28,425,236 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string ABCD;
cin >> ABCD;
int A = ABCD[0] - '0';
int B = ABCD[1] - '0';
int C = ABCD[2] - '0';
int D = ABCD[3] - '0';
if(A+B+C+D==7) {
cout<<A<<"+"<<B<<"+"<<C<<"+"<<D<<"=7"<<endl;
}else if(A-B+C+D==7) {
cout<<A<<"... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
long a,b,c,d;
string abcd;
cin >> abcd;
a=abcd[0]-'0';
b=abcd[1]-'0';
c=abcd[2]-'0';
d=abcd[3]-'0';
vector<int> p(3);
p[0] = b;
p[1] = c;
... | 1 | 58,890,641 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main() {
int N;
cin >> N;
int X = 0, Y = 0, T = 0;
for(int i=0; i<N; i++) {
int x, y, t;
cin >> t >> x >> y;
X = abs(x - X);
Y = abs(y - Y);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin>>n;
int t[n+1],x[n+1],y[n+1]; t[0]=0,x[0]=0,y[0]=0;
for(int i=1;i<n+1;i++) cin>>t[i]>>x[i]>>y[i];
for(int i=0;i<n;i++){
int d=abs(x[i+1]-x[i])+abs(y[i+1]-y[i]);
int u=t[i+1]-t[i];
if(d>u||(d<u&&(u-d)%2)){cout<<"No"; return 0;}
}... | 1 | 18,770,970 |
#include <stdio.h>
#define EPSILON 1.0e-6
int main(int argc, char** argv)
{
double x1, y1, x2, y2, x3, y3, xp, yp;
while (fscanf(stdin,
"%lf %lf %lf %lf %lf %lf %lf %lf",
&x1, &y1, &x2, &y2, &x3, &y3, &xp, &yp) == 8) {
double s = (x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1);
double u = ((xp - x1) * (y3... | #include <iostream>
using namespace std;
int main()
{
double x1,y1,x2,y2,x3,y3,xp,yp;
double m,n;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp)
{
m = ((xp - x1) * (y3 - y1) - (yp - y1) * (x3 - x1)) /
((x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1));
n = ((xp - x1) * (y2 - y1) -... | 1 | 19,669,996 |
#include <iostream>
#include <cstdio>
using namespace std;
const int MAX = 100005;
int main() {
int N;
int A[MAX];
int counting[MAX] {0};
cin >> N;
int maxv {0};
for (int i = 0; i < N; i++) {
cin >> A[i];
if (maxv < A[i]) maxv = A[i];
counting[A[i]]++;
}
int ans {0};
int tmp_ans {0};
for... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n,ans=0;
int a[200005],visited[200005];
signed main()
{
cin>>n;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=n;i++) visited[a[i]]++;
for (int i=1;i<=200000;i++) ans=max(ans,visited[i]+visited[i-1]+visited[i+1]);
cout<<ans<<endl;
retur... | 1 | 56,695,560 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RRE... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=105;
struct node{
int x,y;
bool operator<(const node&o)const{
return atan2(y,x)<atan2(o.y,o.x);
}
}a[N<<1];
int n;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d%d",&a[i].x,&a[i].y);
sort(... | 1 | 100,349,311 |
#include <stdio.h>
int main(){
int n;
scanf("%d", &n);
int T, K;
scanf ("%d %d", &T, &K);
for (int i = T; i <= K; i++){
if (i % n == 0){
puts("OK");
return 0;
}
else continue;
}
puts("NG");
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >>a>>b>>c;
if(b/a==c/a&&b%a!=0){
cout << "NG"<<endl;
}
else{
cout <<"OK" <<endl;
}
} | 1 | 4,051,620 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<ll>>;
using Graph = vector<vector<ll>>;
using VI = vector<int>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VC = vector<char>;
using PI = pair<int, int>;
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#d... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define doub... | 1 | 7,993,454 |
#include<bits
using namespace std;
int main(){
set<int> st;int n;
for(int i = 0; i <3;i++){
cin >> n;st.insert(n);
}cout <<st.size()<<endl;
} | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}
int lcm(int a, int b)
{
return a * b / gcd(a, b);
}
int main() {
int A,B,C;
cin>>A>>B>>C;
if(A==B&&B==C&&C==A) c... | 1 | 74,729,096 |
#include<bits/stdc++.h>
#define ssg set<long long int , greater<long long int>>
using namespace std;
int main()
{
long long int a, b, c, d, e, f, max1, max2, max3, max4;
cin>>a>>b>>c>>d;
e=a;
f=c;
max1=e*f;
e=b;
f=c;
max2=e*f;
e=a;
f=d;
max3=e*f;
e=b;
f=d;
max4=e*... | #include<cstdio>
#include<set>
#include<stack>
#include<queue>
int main()
{
long long int a,b,c,d,x,ans;
scanf("%lld %lld %lld %lld",&a,&b,&c,&d);
ans=a*c;
x=a*d;
if(ans<x){ans=x;}
x=b*c;
if(ans<x){ans=x;}
x=b*d;
if(ans<x){ans=x;}
printf("%lld",ans);
} | 1 | 87,934,523 |
#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 per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 111;
int a[N];
int sq(int x) {
return x * x;
}
int32_t main() {
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
string str; cin >> str;
int l = -1, r = -1;
for(int i = 0; i < str.size() - 1; ++i) {
if(str[i] == str[i + 1]... | 1 | 55,974,337 |
#include<iostream>
using namespace std;
int main(){
int x,y;
while(cin>>x>>y && (x!=0 || y!=0)){
if (x>y){
cout << y << " " << x << endl;
} else {
cout << x << " " << y << endl;
}
}
return 0 ;
} | #include <stdio.h>
int main(){
int a,b,tmp;
scanf("%d %d",&a,&b);
while(a||b){
if(a>b){
tmp = a;
a = b;
b = tmp;
}
printf("%d %d\n",a,b);
scanf("%d %d",&a,&b);
}
} | 1 | 31,632,184 |
#include <bits/stdc++.h>
using namespace std;
#define Maxn 107
#define inf 1000007
char s[Maxn][Maxn];
int last[1000007],pre[1000007],other[1000007],len[1000007],cnt=0;
int n,m;
int calc(int x,int y)
{
return (x-1)*m+y;
}
void insert(int u,int v,int l)
{
other[++cnt]=v,pre[cnt]=last[u],last[u]=cnt;
len[cnt]... | #include <bits/stdc++.h>
#define rep(i, a) for (ll i = 0; i < (a); ++i)
#define pb push_back
#define all(v) v.begin(),v.end()
#define sort_1(v) sort(v.begin(),v.end())
#define sort_2(v) sort(v.begin(),v.end(),greater<ll>())
#define reverse(v) reverse(v.begin(),v.end())
typedef long long ll;
typedef long double la;
usin... | 1 | 98,033,771 |
#include<iostream>
#include<algorithm>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
int a[A], b[B];
rep(i,0,A-1) cin >> a[i];
rep(i,0,B-1) cin >> b[i];
int mina = *min_element(a, a+A);
int minb = *min_element(b, b+B);
int ans = mina + minb... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M;
cin>>A>>B>>M;
vector<int> a(A,0);
vector<int> b(B,0);
vector<int> c(M,0);
vector<int> x(M,0);
vector<int> y(M,0);
int min_a;
int min_b;
int min_mix=INT_MAX;
for (size_t i = 0; i < A; i++)
{
cin>... | 1 | 96,267,027 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_bas... | 1 | 47,522,140 |
#include<bits/stdc++.h>
using namespace std;
int main () {
string s;
int a = 0, ans = 0;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == 'R') {
a ++;
}
if (s[i] != 'R' || i == 2) {
ans = max(a,ans);
a = 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char arr[10];
scanf("%s", arr);
int rCount = 0, ans = 0;
for (int i = 0; i < 3; ++i) {
if (arr[i] == 'R') {
rCount++;
} else {
ans = max(ans, rCount);
rCount = 0;
}
}
ans = max(ans, rCount);
printf("%d\n", ans);
ret... | 1 | 1,622,379 |
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first... | 1 | 68,430,790 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int64_t K;
cin >> S;
cin >> K;
int64_t ini = 300;
int64_t ini_num = -1;
for ( int64_t i = 0; i < S.size(); ++i){
if ( S[i] != '1' ){
ini = i;
ini_num = S[i] - '0';
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
string S;
ll K;
cin >> S >> K;
int cnt1... | 1 | 15,976,092 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int N;
cin >> N;
set<int> A;
for (int i = 0; i < N; ++i) {
int input;
cin >> input;
if(A.count(input) == 0) A.insert(input);
else{
cout << "NO" << "\n";
return 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
map<ll,ll>ch;
for(ll i=0;i<n;i++){
ll x;
cin>>x;
ch[x]++;
if(ch[x]==2){
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
} | 1 | 56,293,286 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
int main(){
int N,M; cin >>N >>M;
vector<int> a(N);
vector<int> b(N);
rep(i,0,N) cin >>a[i] >>b[i];
vector<int> c(M);
vector<int> d(M);
rep(i,0,M) cin >>c[i] ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<ll, ll>;
int main(){
int n,m;
cin >> n >> m;
vector<p> stu, check;
for(int i = 0; i < n; i++){
ll a,b;
cin >> a >> b;
stu.push_back(p(a, b));
}
for(int i = 0; i < m; i++){
ll c,d;
... | 1 | 21,043,337 |
#include <iostream>
using namespace std;
int main(){
int n;
long long a;
long long min = 1000000;
long long max = -1000000;
long long sum = 0;
cin >> n;
for(int i=1;i<=n;i++) {
cin >> a;
if(a < min) min = a;
if(max < a) max = a;
sum += a;
}
cout << min <<" "<< max <<" "<< sum << "\n";
... | #include<stdio.h>
#include<climits>
#include<algorithm>
using namespace std;
int main(){
int n,x;
int min_num = INT_MAX,max_num = INT_MIN;
long long sum = 0;
scanf("%d",&n);
for(int i = 0;i < n;i++){
scanf("%d",&x);
min_num = min(min_num,x);
max_num = max(max_num,x);
... | 1 | 47,939,289 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if(N / 1000 == (N % 100) / 10 && (N % 1000) / 100 == (N % 100) / 10){
cout << "Yes" << endl;
}
else if((N % 1000) / 100 == (N % 1000) % 100 / 10 && (N % 1000) / 100 == (N % 10) / 1 ){
cout << "Yes" << endl;
}
else{
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int a,b,c,d;
cin >> N;
a = N % 10;
b = (N % 100 - a) / 10;
c = (N % 1000 - 10 * b - a) / 100;
d = (N % 10000 - 100 * c - 10 * b - a) / 1000;
if ( a == b && b == c){
cout << "Yes" << endl;
}
else if ( b == c && c == d){
cout << ... | 1 | 13,671,035 |
#include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for(ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int M... | using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define infile "../test/sample-1.in"
#define int long long
#define INF 1000000000000000000LL
#define MOD 1000000007LL
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define ... | 1 | 39,420,271 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include<bits/stdc++.h>
#define int long long
#define rao(i,n) for(int i=0;i<n;i++)
using namespace std;
signed main(){
int n,a,b,c[100000],d[1000000],z=0;
cin>>n>>a>>b;
for(int i=0;i<n;i++){
cin>>c[i]>>d[i];
}
for(int i=0;i<n;i++){
if(a<=c[i] && b<=d[i]){
z++;
}
}
cout<<z<<"\n";
} | 1 | 25,377,482 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.