code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#define rep(i,j,k) for(int i = j; i <= k; i++)
#define dow(i,j,k) for(int i = j; i >= k; i--)
using namespace std;
const int N = 2e5 + 100;
int n, a[N];
vector<pair<int,int> > mp;
bool che... | #include<cstdio>
#include<map>
int n,a[200100],ans;
bool bo=true;
std::map<int,int> mp;
bool check(int x){
mp.clear();
for(int i=2;i<=n;i++)
if(a[i-1]>=a[i]){
while(!mp.empty()){
int maxn=mp.rbegin()->first;
if(maxn>a[i])mp.erase(maxn);
else break;
}
int j=a[i];
while(mp[j]+1==x)
mp.era... | 1 | 49,946,784 |
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define int long long
string per(int n) {
string s;
if (n == 0) {
s += '0';
return... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#def... | 1 | 8,080,138 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
#define ote(x) cout<<(x)<<endl
#define all(x) (x).begin(),(x).end()
#define rp(i,s,e) for(int i=(s);i<(e);++i)
template<class T> T in(){T x;cin>>x;return x;}
int main(){
int N; cin>>N;
vector<string> S(... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<stack>
#include<vector>
#include<queue>
#include<bitset>
using namespace std;
#define LL long long
#define DB double
#define MOD 998244353
#define Pr pair<DB,int>
#define X first
#define Y second
#define MAXN 50
#define I... | 1 | 37,750,012 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric... | #include <iostream>
using namespace std;
int min(int x, int y, int z)
{
return min(min(x, y), z);
}
int dp(string x,string y, int m)
{
int count(0);
for (int i = 0; i <= m; i++) {
if (x[i] != y[i]) count++;
}
return count;
}
int main()
{
string x,y;
cin>>x>>y;
cout<<dp(x,y... | 1 | 83,359,109 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
int main()
{
string s;
ll k;
cin >> s >> k;
int n = s.size();
vector<int> cnt = {1};
for(int i = 1; i < n; i++)
{
if(s[i] == s[i - 1])
{
cnt.back()++;
}
else
... | #include <bits/stdc++.h>
typedef long long ll;
const int N = 105;
char s[N];
int k, n, tot, len[N];
ll ans;
int main()
{
bool is = 1;
scanf("%s%d", s + 1, &k); n = strlen(s + 1);
for (int i = 1; i <= n; i++) if (s[i] != s[1]) is = 0;
if (is) return std::cout << 1ll * n * k / 2 << std::endl, 0;
for (int i = 1, c = ... | 1 | 100,595,782 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
string S;
cin >> A >> B >> S;
bool f=1;
for (int i = 0; i < A+B+1; i++)
{
if(i==A)
{
if(S[i]!='-') f=0;
continue;
}
if(isdigit(S[i]));
else f=0;
}
if(f) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
... | #include<iostream>
#include<string>
using namespace std;
int main ()
{
int a, b, k = 0, t = 0;
cin >> a >> b;
string s;
cin >> s;
if(s[a] == '-')
{
s.erase (a,1);
for(int i = 0; i < a + b; i++)
{
if(s[i] == '0' + 0 || s[i] == '0' + 1 || s[i] == '0' + 2... | 1 | 66,514,904 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int W,H,x,y;
scanf("%d %d %d %d",&W,&H,&x,&y);
printf("%.15lf %d\n",((double)W*(double)... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 1 | 74,795,483 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
vector<ll> X(N);
REP(i, 0, N) cin >> X[i];
int L; cin >> L;
int k = 1; while ((1 << k) < N) k++;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
#define MAX 20
signed main() {
int n;
cin >> n;
int x[n ... | 1 | 40,106,692 |
#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()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,m,ans=0;
cin >> n >> m;
vector<vector<long>> p(n,vector<long>(3));
for(long i=0;i<n;i++) cin >> p[i][0] >> p[i][1] >> p[i][2];
for(long i=0;i<8;i++) {
vector<long> psum(n);
for(long j=0;j<n;j++) {
if(i&1) psum[j]+=p[j][0];
... | 1 | 75,607,921 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
using namespace std;
int solve(){
string c, s;
map<string, bool> mp;
int n;
cin >> n;
for (int i = 0; i < n; i++){
cin >> c >> s;
if (c == "insert") mp[s] = true;
else {
if (mp[s]) cout << "yes" << endl;
else co... | 1 | 38,093,447 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector
#define pb push_back
#define ff first
#define ss second
using namespace std;
int main()
{
ll n,m,i,a=0,b=0,k,t,j;
cin>>n;
if(n%2) cout<<"0";
else
{
a=5*2;
ll ans=0;
while(a<=n)
{
... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | 1 | 58,829,223 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 1e5 + 5;
int a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> an(N);
for (int i = 0; i < N; i++) {
cin >> an[i];
}
sort(an.begin(), an.end());
int ans = 0;
for (int i = 0; i < N; i++) {
if (i == 0 && an[i] > 0) ans -= an[0];... | 1 | 94,848,004 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
string words[4] = { "dream", "dreamer", "erase", "eraser" };
reverse(S.begin(), S.end());
for (int i = 0; i < 4; i++) {
reverse(words[i].begin(), words[i].end());
}
for (int i = 0; i < S.size();) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
string data[] = {"dream", "dreamer", "erase", "eraser"};
for(int i = 0 ; i < 4 ; i++){
reverse(data[i].begin(), data[i].end());
}
int now = 0;
while(1){
bool flag =... | 1 | 53,040,578 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
string s; cin >> s;
for(int i = 0; i < s.size() - 2; i++){
if(s[i] == s[i+1] || s[i] == s[i+2] || s[i+1] == s[i+2]){
cout << i+1 << " " << i + 3 << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
void fast(){
cin.tie(0);
cin.sync_with_stdio(0);
}
int main()
{
fast();
string s;
cin>>s;
if(s.size()==2&&s[1]==s[0]){cout<<"1 2";return 0;}
for(int i=0;i<s.size()-2;i++){
int freq[130]={};
for(int j=i;j<i+3;j++){
freq[s[j]]++;
if(j==i+2){for(int k=97;k<=122... | 1 | 76,897,928 |
#include<iostream>
using namespace std;
int main()
{
int a, b;
cin >> a>>b;
if (a < b){
cout << "a < b\n";
}
else if(a > b){
cout << "a > b\n";
}
else if (a = b){
cout << "a == b\n";
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
string op;
if(a == b)
op = " == ";
else if(a > b)
op = " > ";
else
op = " < ";
cout << "a" << op << "b" << endl;
return 0;
} | 1 | 15,810,382 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #include <iostream>
using namespace std;
int n,a[1000010];
int st[1000010];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]),st[a[i]]++;
int cnt=n;
for(int i=1;i<=n;++i){
for(int j=1;j*j<=a[i];++j){
if(a[i]%j==0){
int x=a[i]/j,y=j;
... | 1 | 100,538,129 |
#include <iostream>
using namespace std;
typedef unsigned long long ull;
ull fact (int n) {
if (n < 2) return 1;
else return (ull)n * fact(n - 1);
}
int main (void) {
int n;
cin >> n;
cout << fact(n) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main( void )
{
while ( !cin.eof() )
{
int n;
cin >> n;
if ( cin.eof() )
break;
long long f = 1;
for ( int i = 2; i <= n; i++ )
{
f *= i;
}
cout << f << endl;
}
} | 1 | 30,292,844 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,d;
cin>>n>>d;
int x[n][d];
int cnt=0;
rep(i,n)rep(j,d)cin>>x[i][j];
int ians=0;
double fans=0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
for(int k=0;k<d;k++){
ians+=(x[i][k]-x[j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> X(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> X.at(i).at(j);
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {... | 1 | 76,854,291 |
#include <iostream>
using namespace std;
int main(){
int ans = 100000;
int n;
cin >> n;
for(int i=0;i<n;i++){
ans += ans*0.05;
if(ans%1000!=0)
ans = ans-ans%1000 + 1000;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
int debt = 100000;
scanf("%d", &n);
for (int i = 0; i < n; i++){
debt = debt / 100 * 105;
if (debt % 1000 != 0){
debt = (debt / 1000 + 1) * 1000;
}
}
printf("%d\n", debt);
return (0);
} | 1 | 49,432,643 |
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int... | 1 | 27,757,511 |
#include <iostream>
using namespace std;
int main(){
int n,k,max,buf,*a;
while(1){
cin >> n >> k;
if(n || k){
max = buf = 0;
a = new int[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
for(int i = 0; i < k-1; i++){
buf += a[i];
}
for(int i = k-1; i < n; i++){
buf += a[i];
max =... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,... | 1 | 1,494,996 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#def... | #include<iostream>
#include<algorithm>
using namespace std;
#define df 0
int lg(int n){
int cnt=1;
while(n){
cnt++;
n/=2;
}
return cnt;
}
int main(){
if(df) printf("*debug mode*\n");
int n; cin >> n;
int x[n];
for(auto& a:x){
cin >> a;
}
int l,q; cin >> l >> q;
int lmax=lg(n);
int d... | 1 | 13,340,947 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
void solve(long long N, std::vector<std::string> S){
ll ans = 0;
REP(B, N){
vector<string> T;
REP(i, N){
T.push_back(
S.at(i).substr(N - B, B) +
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1000000007;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<... | 1 | 23,828,494 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll x, y, z, k; cin >> x >> y >> z ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(long long i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll INF=(1ll<<60);
constexpr ll mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<typename T... | 1 | 53,017,992 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#define rep(i,j,k) for(int i = j; i <= k; i++)
#define dow(i,j,k) for(int i = j; i >= k; i--)
using namespace std;
const int N = 2e5 + 100;
int n, a[N];
vector<pair<int,int> > mp;
bool che... | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)
using ii=pair<int,int>;
const int mxN = 2e5+... | 1 | 78,837,614 |
#include <bits/stdc++.h>
#define int long long
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
typedef long long ll;
const int N = 10005;
inline int input() {
int x; char ch; while (!isdigit(ch = getchar()));
for (x = ch ^ 48; isdigit(ch = getchar()); x = x * 10 + (ch ^ 48));
return x;
}
inline ... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 1 | 4,381,458 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[200000];
int main()
{
int i,n,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
flag=1;
break;
}
}
if(flag==1)
{
printf("NO\n");
}
else
{
pri... | #include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>... | 1 | 73,448,121 |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long ... | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int b = a[0];
for (int i = 1; i < n-1; i++ ) {
if (abs(a[i] * 2 - a[n-1]) < abs(b * 2 - a[n-1])) {
b... | 1 | 57,046,403 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main() {
char ch;
char ring[200],search[100],change[100];
scanf("%s %s",ring , search);
strcpy(change, ring);
strcat(ring, change);
if ( strstr(ring, search) == NULL ) printf("No\n");
else printf("Yes\n");
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
char p[128] = { '\0' }, s[128] = { '\0' };
fscanf(stdin, "%s", s);
fscanf(stdin, "%s", p);
string ss = string(s) + string(s), pp(p);
string ans = "No";
if (ss.find(p, 0) != string::npos) {
ans = "Yes";
... | 1 | 90,237,486 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
typedef struct st
{
double x;
double y;
}st_Coordinate;
int n;
void Koch_curve(st_Coordinate p1, st_Coordinate p2, int n);
int main(void)
{
st_Coordinate st_start,... | #include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
const double PI = 3.1415926535;
const double th = 60 * PI / 180;
class p
{
public:
double x;
double y;
void print();
};
void p::print()
{
printf("%.8f %.8f\n", x, y);
}
void koch(int d, p p1, p p2)
{
if (d == 0)return;
p s, u, t;
s.x = (2... | 1 | 60,208,582 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 1 | 51,055,510 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{ll to,cost;};
const int inf = 1<<27;
const ll INF = 1LL<<60;
const int COMBMAX = 1001001;
const ll MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for(const auto& e : (v))
#define... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < (n); i++)
using namespace std;
void solve() {
long N, K;
ci... | 1 | 40,676,198 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define IN(type, n) type n; cin >> n
ll solve(int N, int K, vector<int> P, vector<int>C) {
vector<vector<int> > loops = {};
vector<ll> sum = {};
bitset<5000> flag_check;
ll max_score = LLONG_M... | 1 | 22,177,652 |
#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<int, int>;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
template<class T> inline bool chmax(T &a, T b) { if (a<b) {a=b; return 1;} return 0;}
t... | #include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cs... | 1 | 11,811,418 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
#ifdef LOCAL
freopen("input.in" , "r" , stdin);
#endif
int n;
string s;
cin >> n >> s;
int R = 0 , G = 0 , B = 0;
for (char &c : s) {
R += c == 'R';
G += c == 'G';
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, ans = 0;
cin >> N;
string S;
cin >> S;
vector<int> R(N + 1, 0), G(N + 1, 0), B(N + 1, 0);
for (int i = 0; i < N; i++)
{
if (S[i] == 'R')
R[i + 1]++;
else if (S[i] == 'G')
G[i + 1]++;
else
B[i + 1]++;
R[... | 1 | 67,516,596 |
#include <iostream>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int count = 0;
for (int x = 0; x <= k; x++) {
if (x > s) continue;
int ypz = s - x;
if (ypz < k)
count += (ypz + 1);
else if (ypz >= k && ypz <= 2 * k)
count += (k - (yp... | #include<bits/stdc++.h>
using namespace std;
int x,y,z;
int main() {
cin >> x >> y;
for (int i = 0; i <= x; i++) {
int tmp = y-i;
if (tmp >= 0) {
z += max(0, min(tmp+1, x-(tmp-x)+1));
}
}
cout << z << "\n";
} | 1 | 60,306,669 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.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;
typ... | #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 S;
cin>>S;
if(S.size()>=4){
if(S.at(0)=='Y'){
if(S.at(1)=='A'){
if(S.at(2)=='K'){
if(S.at(3)=='I'){
... | 1 | 45,700,088 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
#define LM 1000000000000000000
int main() {
int n;
ll ans = 1;
int chk = 0;
ll buf;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
if (a[i] == 0)chk = 1;
}
if (chk == 0) {
rep(i, n) {
i... | #include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | 1 | 16,820,555 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
char current = S[0];
int cnt = 0;
for (const char &c : S) {
if (current != c) {
cnt++;
current = c;
}
}
cout << cnt << endl;
} | 1 | 67,300,798 |
#include <iostream>
#include <string>
#include <vector>
int sum_digits(std::string s) {
int sum = 0;
for (int i = 0; i < s.length(); i++) {
sum += s[i] - '0';
}
return sum;
}
int main() {
std::ios::sync_with_stdio(false);
std::vector<int> sums;
std::string s;
while (true) {
... | #include <iostream>
int main(void) {
std::string x;
std::cin >> x;
while(x != "0") {
int sum = 0;
for (int i = 0; i < x.size(); i++) {
sum += x[i] - '0';
}
std::cout << sum << std::endl;
std::cin >> x;
}
return 0;
} | 1 | 30,914,836 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const i... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
... | 1 | 88,230,113 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N;
cin >> N;
vector<int> P(N);
vector<int> Q(N);
for(int i = 0; i < N; i++) cin >> P.at(i);
for(int i = 0; i < N; i++) cin >> Q.at(i);
vector<int> kaijou(N+1, 1);
for(int i = 1; i < N+1; i++) kaijou.at(... | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = to - 1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename... | 1 | 46,791,642 |
#include<bits/stdc++.h>
typedef long long ll;
typedef std::pair<ll, ll> P;
#define rep(i,n) for(int i = 0; i < int(n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, const T& b) { if (b < a) { a = b;... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 1 | 1,353,361 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli n, m;
int main(void){
cin >> n >> m;
lli c = 1;
rep(i, m) c*=2;
cout << c*(1900*m+100*(n-m)) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,X;
cin >> N >> M;
X = (1900 * M + 100 * (N-M))*pow(2,M);
cout << X;
} | 1 | 17,844,405 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <string.h>
#include <string>
using namespace std;
int main()
{
int n, d, x;
cin >> n >> d >> x;
int a[n];
for (int i=0; i<n; i++) {
cin >> a[i];
}
int choco = 0;
for (int i=0; i<n;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,d,x;
cin>>n>>d>>x;
vector<int> A(n);
for(int i=0;i<n;i++){
cin>>A.at(i);
}
int sum=0;
for(int i=0;i<n;i++){
int eating_day=0;
for(int j=0;j<d;j++){
if(j==0){
sum++;
eating_day=A.at(i)+1;
}
else i... | 1 | 38,697,119 |
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 1145141919454519;
ll ans = INF;
void solv(ll H, ll W){
for(ll i = 1; i < W; i++){
ll a = i * H... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
ll check(ll x, ll y) {
ll ans = LINF;
if (x >= 3) {
for (int i = 1; i <=... | 1 | 72,784,419 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
ll n;
cin>>n;
n--;
cout <<a[n];
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
int arr[100]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int n;
scanf("%d", &n);
printf("%d\n", arr[n-1]);
} | 1 | 40,347,211 |
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
int ans = 100000;
int tmp;
for (int i=0; i<n; i++) {
ans *= 1.05;
tmp = ans / 1000 * 1000;
if (tmp != ans) ans = tmp + 1000;
}
cout << ans << endl;
return 0;
} | #include<stdio.h>
int main(void)
{
int a,s,d,f,g,i;
s=100000;
scanf("%d",&a);
for(i=1;i<=a+1;i++){
s=s+d;
d=(s/100)*5;
if(d%1000!=0){
g=d/1000;
d=(g+1)*1000;
}
}
printf("%d\n",s);
return 0;
} | 1 | 30,481,698 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
int... | 1 | 33,631,570 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using Graph = vector<vector<ll>>;
using P = pair<int,int>;
#define MOD 1000000007
#define INF 1000000
#define PI 3.14159265358979323846264338327950L
#define MAX_N 200010
#define lb lower_bound
ll... | #include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | 1 | 17,151,804 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
#define REP(i,n) for(int i = 0; i < n; i++)
#define RREP(i,n) for(int i = n - 1; i >= 0; i--)
#define ALL(v) v.begin(),v.... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1; finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv... | 1 | 65,829,828 |
#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;
vector<int> num_list(N);
int count = 0;
int min = 0;
rep(i,N){
int tmp;
cin >> tmp;
num_list.push_back(tmp);
if (count == 0){... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 1 | 71,329,118 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template<typename T1,typename T2> inline void chmin(T1 ... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | 1 | 62,052,902 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
const ... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
cons... | 1 | 20,737,287 |
#include<cstdio>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n; scanf("%d",&n);
rep(_,n){
int y,m,d; scanf("%d%d%d",&y,&m,&d);
int ans=0;
for(;y<1000;ans++){
if(d<(y%3==0||m%2==1?20:19)) d++;
else if(m<10) d=1, m++;
else d=1, m=1, y++;
}
printf("%d\n",ans);
}
retu... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<list>
#include<map>
#include<set>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define MAX_n 105
int n;
int Y[MAX_n],M[M... | 1 | 43,061,263 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
using namespace std;
using ll = long long;
int main(){
ll k,a,b;cin>>k>>a>>b;
ll ans=1;
ll coin=0;
if(b-a>1){
for(ll i=0;i<k;i++){
if(coin>0){
ans+=b;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll k, a, b; cin >> k >> a >> b;
ll ans = 0;
if (a + 1 < b) {
ll quo = k / (a + 1);
ll mod = k % (a + 1);
if (quo == 0) {
ans = 1;
ans += k;
}
else {
k -= a + 1;
ans = b;
ll quo2 = k / 2;
ll mod2 = k % 2;
... | 1 | 70,620,366 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a*b%2==0){
cout<<"Even";
return 0;
}
cout<<"Odd";
} | 1 | 9,872,419 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char c;
cin>>c ;
if(c>='A'&&c<='Z')
{
cout<<"A";
}else
cout<<"a";
} | #include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typed... | 1 | 86,174,975 |
#include <bits/stdc++.h>
using namespace std;
int v[100002];
int n, maxx, sol;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
maxx = max(maxx, v[i]);
}
int p = 1;
while (v[p] != maxx)
p++;
v[p] = -1;
int nr1, nr2;
if (maxx & 1)
nr1 = maxx / 2, nr2 = maxx / 2 + 1;
el... | #include <iostream>
#include <cstdio>
using namespace std;
int n, mx, m, x, i, j, t, a[100005];
int main()
{
cin >> n;
for (i = 0; i < n; i++) {
scanf ("%d", &a[i]);
mx = max(mx, a[i]);
}
for (i = 0; i < n; i++) {
t = min(a[i], mx - a[i]);
if (t > m) {
m = t;
x = a[i];
}
}
cout << mx << " " << x;
... | 1 | 22,582,787 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
usi... | #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;
vector<ll> enum_div(ll n){
vector<ll> ret;
for (ll i=1; i*i<=n; i++){
if (n%i==0){
ret.push_back(i);
if (i!=1&&i*i!=n) ret.p... | 1 | 83,946,345 |
#include<bits/stdc++.h>
using namespace std;
int n,f[100010],p;
vector<int> a[100010];
inline void dfs(int i,int j)
{
int k;
for(k=0;k<a[i].size();k++)
if(a[i][k]!=j)
{
dfs(a[i][k],i);
if(!f[a[i][k]])
if(!f[i])
f[i]=1;
else
p=1;
}
}
int main()
{
int i,j,k;
scanf("%d",&n);
fo... | #include <bits/stdc++.h>
using namespace std;
const int N = 1 * 100 * 1000 + 1;
int n, sz[N];
vector <int> adj[N];
bool dfs(int u, int par) {
int odd = 0, res = 0;
sz[u] = 1;
for (auto v: adj[u])
if (v ^ par) {
res |= dfs(v, u);
sz[u] += sz[v];
odd += (sz[v] & 1);... | 1 | 14,396,821 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (n) ; ++i)
#define orep(i,n) for(long long i = 1; i <= (n); ++i)
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for(long long i = (s); i < (t); ++i)
#define rng(x) (x).begin(),(x).end()
#define rrng(a) (a).rbeg... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
if(n & 1) {
cout << 0;
exit(0);
}
n /= 2;
long long c = 0;
while(n) {
c += n / 5;
n /= 5;
}
cout << c;
return 0;
} | 1 | 36,980,779 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | # include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | 1 | 78,706,347 |
#include<bits/stdc++.h>
using namespace std;
string t[]={"qazwsxedcrfvtgb","yhnujmikolp"};
int tp(string s){
int rl,cnt=0;
for(int i=0;i<2;++i)
if(t[i].find(s[0])!=string::npos) rl=i;
for(int i=1;i<s.size();++i)
for(int j=0;j<2;++j)
if(t[j].find(s[i])!=string::npos)
if(j!=rl) cnt++, rl=j;
... | #include<cstdio>
using namespace std;
char right[12] = "yhnujmikolp";
bool check(char c) {
for (int i = 0; i < 11; i++) if (right[i] == c) return true;
return false;
}
int main() {
char s[50];
while (1) {
scanf("%s", s);
if (s[0] == '#') break;
int counter = 0;
bool now = check(s[0]);
for (... | 1 | 17,681,106 |
#include <bits/stdc++.h>
#define uint uint64_t
#define mx 100001
#define ll long long int
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define mp make_pair
#define pb push_back
#define inf INT_MAX
#define pi acos(-1)
#define eps 1e-8
#define gcd(a, b) __gc... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
long long b; cin >> b;
... | 1 | 55,977,315 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, std::string S) {
char before = S[0];
ll ans = 1;
for (ll i = 1; i < N; i++) {
if (S[i] != before) {
ans++;
}
before = S[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,ans;
string s;
cin >> n >> s;
ans = n;
for(int i=1;i<n;i++)
{
if(s.at(i-1)==s.at(i))
{
ans--;
}
}
cout << ans << endl;
} | 1 | 97,072,493 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | #include<bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define MOD 1000000007
#define int long long
#define pii pair<int,int>
#define vi vector<int>
using namespace std;
const int N = 1e5 + 10;
string s;
int dp[N][2];
int modpow(int a, int b, int mod){
int res = 1;
a %= mo... | 1 | 100,555,554 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
int main(void){
int n, k;
cin >> n >> k;
vi s(n, 1);
for(int i=0; i<k; i++){
int d;
cin >> d;
for(int j=0; j<d; j++){
int a;
cin >> a;
s[a... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>
#include <numeric... | 1 | 20,751,320 |
#include <bits/stdc++.h>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
typedef long long ll;
using namespace std;
int main(){
int n;
ll ans = 1;
cin >> n ;
bool over = false;
bool zero = false;
rep(i, n){
ll a;
cin >> a;
if(a==0){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
int n;
ll t=1, a;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a;
if(t == 0 || a == 0){
t = 0;
}
else if ( t > 0 && t <= 1000000000000000000 / a) {
t *= a;
}
else{
t = -1;
}
}
cout... | 1 | 12,865,804 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n+1);
v[0] = 2;
v[1] = 1;
for(int i = 2; i < n+1; i++) {
v[i] = v[i-1]+v[i-2];
}
cout << v[n];
} | #include <bits/stdc++.h>
using namespace std;
int lyuka(int i) {
int64_t L;
if (i==0) L=2;
else if (i==1) L=1;
else L = lyuka(i-1) + lyuka(i-2);
return L;
}
int main() {
int N;
cin >> N;
long long L[87];
L[0] = 2LL;
L[1] = 1LL;
for(int i=2; i<=N; i++) L[i]=L[i-2]+L[i-1];
cout << L[N] << endl;
... | 1 | 21,857,415 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
int main(){
int A, B, C, D, E;
std::cin >> A >> B >> C >> D >> E;
std::vector<int> v = {A, B, C, D, E};
int amari = 0;
int max = v.at(0);
for (int x : v){
if (x % 10 != 0){
int temp = 10 - x % 10;
if ... | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int sum = 0;
int r = 10;
REP(i, 5) {
int tmp;
cin >> tmp;
sum += (tmp + 9) / 10;
if (tmp % 10 && r > tmp % 10)
r ... | 1 | 95,989,845 |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 100010
typedef long long LL;
LL n, p[100];
int main( int argc , char * argv[] ){
int i, L, l, r, m; p[0] = 1;
char c;
for(i = 1; i <= 12; ++i){
p[i] = p[i - 1] * 10;
}
printf("? %lld\n", p[12]);
fflush(stdout);
scanf(" %c", &c);
if(c... | #include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
inline bool query(ll x) {
char buf[10];
printf("? %ll... | 1 | 60,375,131 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <limits>
#include <iomanip>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int... | #include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ss second
#define ar array
#define int long long
#define ld long double
#define pb push_back
#define mp make_pa... | 1 | 45,303,448 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N,M;
cin >> N >> M;
vector<pair<int,int> > vec(N);
rep(i,N){
cin >> vec[i].... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 1 | 88,872,717 |
#include<iostream>
int main(){
int a, b, c, f = 0;
std::cin >> a >> b >> c;
for(int x = a; x <= b; x++ ){
if(c % x == 0) f++;
}
std::cout<< f <<"\n";
return 0;
} | #include <iostream>
int count_divisors(int a, int b, int c) {
int count = 0;
for (int i = a; i <= b; i ++) {
if (c % i == 0) {
count += 1;
}
}
return count;
}
int main() {
int a, b, c;
std::cin >> a >> b >> c;
std::cout << count_divisors(a, b, c) << std::endl;
return 0;
} | 1 | 31,645,665 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
using namespace std;
int main(){
int n, m, total=0, can=0;
cin >> n >> m;
vector<int> a(n);
rep(i,n){
cin >> a[i];
total += a[i];
}
rep(i,n){
if(a[i]*4*m<total) continue;
can++;
}
if(can >= m) cout << "Yes" << endl;
els... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
vector <int> n;
int main(){
int n,m,t,cnt=0;
double al=0;
vector <int> a;
cin>>n>>m;
for(int i=0;i<n;i++){
cin>>t;
al+=t;
a.push_back(t);
}
al/=4*m;
sort(a.begin(),a.end());
for(int i=0;i<n;i++){
if(a[i]>=al){
cnt++;
}... | 1 | 94,822,560 |
#include<iostream>
using namespace std;
int n;
main()
{
while(cin>>n,n)
{
string s;int flag=0,r=0,l=0,cnt=0;
for(int i=0;i<n;i++)
{
cin>>s;
if(s=="lu")
{
l=1;
if(flag==0&&r==l)cnt++,flag=1;
}
else if(s=="ru")
{
r=1;
if(flag==0&&r==l)cnt++,flag=1;
}
else if(s=="ld")
{
... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n,r[3],l[3];
while(true){
cin>>n;
if(n==0)
break;
string f;
for(int i=0;i<3;i++)
r[i]=0,l[i]=0;
int count=0;
for(int i=0;i<n;i++){
cin>>f;
if(f=="ru")
r[0]=min(1,r[0]+1);
if(f=="rd")
r[0]=max(0,r[0]-1);
if(f=="lu")
l[0... | 1 | 58,090,357 |
#include<iostream>
#include<vector>
#include<algorithm>
typedef long long ll;
int main(){
int n;
std::cin >> n;
std::vector<ll> a(n+1);
for(int i=0; i<=n; i++){
std::cin >> a[i];
}
std::vector<ll> up(n+1);
std::vector<ll> error(n+1);
up[n] = a[n];
error[n] = a[n];
for(int i=n-1; i>=0; i--){
up[i] = up[i+... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long n;
cin>>n;
vector<long long> A(n+1), B(n+1, 1e18);
for(int i=0;i<n+1;i++) cin>>A[i];
B[0]=1;
if(A[0]>B[0]){
cout<<-1<<endl;
return 0;
}
for(int i=0;i<n;i++){
B[i+1] = (B[i]-A[i])*2;
if... | 1 | 72,361,593 |
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#defin... | #include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
int main(){
string st1,st2;
int n;
cin>>n;
for(int iii=0;iii<n;iii++){
cin>>st1>>st2;
int d=1,a=0,s1=0,s2=0;
int S=0;
for(int i=0;i<st1.size();i++){
if(st1[i]=='m'){s1+=d*1000;d=1;}
else if(st1[i]=='c'){s1+=d*100;d=1;}
else if(st1[i]=='x'){s1+=d... | 1 | 17,834,352 |
#include<iostream>
using namespace std;
char v[256];int n,m;
int main(){
while(true){
cin>>n;for(int i=32;i<127;i++){v[i]=i;}
if(n==0)break;
for(int i=0;i<n;i++){char p,q;cin>>p>>q;v[p]=q;}
cin>>m;
for(int i=0;i<m;i++){
char f;cin>>f;cout<<v[f];
}
cout<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (t... | 1 | 89,381,922 |
#define _GLIBCXX_DEBUG
#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<vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = { 0, 1, 0, -1 };
static const int dy[4] = { 1, 0, -1, 0 };
static const char dir[4] = { 'u', 'r', 'd', 'l' };
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
static... | 1 | 1,397,769 |
#include<stdio.h>
#include<queue>
#include<assert.h>
#include<tuple>
#include<string>
#include<algorithm>
#include<iostream>
#include<map>
#include<string.h>
#include<vector>
#include<math.h>
#include<stdlib.h>
#include<set>
#include<ctype.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef... | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <valarray>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include ... | 1 | 86,524,029 |
#include <cstdio>
int main()
{
int a,b;
scanf("%d %d",&a,&b);
if((a+b)%2 == 0)
{
printf("%d",(a+b)/2);
}
else if((a+b)%2 != 0)
{
printf("%d",((a+b)/2)+1);
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int x;
x = (a + b) * 10 / 2;
if (x % 10 == 0) {
cout << x / 10 << endl;
} else {
cout << x / 10 + 1 << endl;
}
return 0;
} | 1 | 36,966,035 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<string> s(n);
vector<int> t(n);
string x;
for(int i = 0; i < n; i++) { cin >> s.at(i) >> t.at(i); }
cin >> x;
int ans = 0;
for(int i = 0; i < n; i++) {
if(s.at(i) == x) {
i++;
for(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
ll sum = 0;
ll a = 0;
vector<string> s(n);
vector<ll> t(n);
for(i = 0;i < n;++i){
cin >> s.at(i) >> t.a... | 1 | 14,974,714 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | #include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using ll = long long;
const double PI=3.14159265358979323846;
int ma... | 1 | 12,947,426 |
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limit... | #include<iostream>
#include<vector>
#include<algorithm>
#define INF 100000
using namespace std;
int main()
{
while (true) {
int m, n_min, n_max;
cin >> m >> n_min >> n_max;
if (m==0 && n_min ==0 && n_max == 0) {
return 0;
}
vector<int> pv(m);
for (int i = ... | 1 | 99,195,918 |
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define IO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
const int INF = 1e9 + 7;
const int N = 1e5+5;
int main() {
IO;
int a, b, c;
cin >> a >> b >> c;
if (c <= b && c >= a) {
cout << "Yes";
}
els... | #include <stdio.h>
#include <stdlib.h>
int main()
{
int a,b,e;
while(~scanf("%d%d%d",&a,&b,&e))
{
if(e>=a&&e<=b)
printf("Yes\n");
else
printf("No\n");
}
return 0;
} | 1 | 15,873,197 |
# include "bits/stdc++.h"
using namespace std;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
inline void fastio(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
inline void setPrecision(int n){cout.precision(n);}
#define BR cerr<<endl
#define dbg(x) cerr<<(#x)<<": "<<x<<endl
#defi... | #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() {
... | 1 | 27,757,928 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <string>
using namespace std;
int hiniti(int y,int m,int d){
int result=0;
for(int s=1;s<=y;s++){
for(int j=1;j<=10;j++){
if(y==s&&m==j){
return result+=d;
... | #include"bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = b - 1; i >= a; i--)
#define RREP(i, n) RFOR(i, 0, n)
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define rrep(i, a, b) for (auto i = a; i > b; i--)
#define range(i, a, b) (a <... | 1 | 25,999,213 |
#include <iostream>
using namespace std;
int main()
{
int x,y,z;
int i,l;
l=0;
cin >> x;
cin >> y;
cin >> z;
for(i=x;i<=y;i++){
if((z%i)==0){
l++;
}
}
cout<<l<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ... | 1 | 72,957,948 |
#include<iostream>
#include<cstdio>
using namespace std;
#define MAX 300
int main(void)
{
int H,W;
while(1){
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int i = 0;i < H;i++){
for(int j = 0;j < W;j++){
if(i == 0 || i == H - 1 || j == 0 || j == W - 1) printf("#");
else printf(".")... | #include <iostream>
using namespace std;
void printRectangle(int height, int width) {
for (int row = 0; row < height; ++row) {
string line;
bool isTopBottom = (row == 0 || row == height - 1) ? true : false;
for (int column = 0; column < width; ++column) {
bool isLeftRightEnd = (c... | 1 | 84,943,617 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int n,a[101000];
int f[110000];
vector<int> e[101000];
void dfs(int x,int dad){
if(e[x... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> P;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec seco... | 1 | 33,694,931 |
#include <iostream>
#include <cstdio>
#include <stack>
#include <queue>
#define MAX 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define NO -1
using namespace std;
int adjacencyList[MAX + 1][MAX + 1];
int color[MAX + 1];
int d[MAX + 1];
int n;
void bfs(int o)
{
queue<int> S;
S.push(o);
color[o] = GRAY;
d[o] =... | #include<bits/stdc++.h>
#include<limits.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define MAX 200
int n;
vector<vector<int>> adj_mat(MAX, vector<int>(MAX, 0));
queue<int> q;
vector<int> visited(MAX, -1);
vector<int> d(MAX, -1);
void add_queue(int node){
rep(i, n){
if(adj_mat.at(no... | 1 | 56,055,233 |
#include <fstream>
#include <iostream>
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = (b-1); i >= (a); i--)
#define RF0(i,b) RFO(i,0,b)
#define lli long long int
#define pii pair<int,int>
#define add(a,b) ((int) (... | #include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int l = 1;
int r = N;
if (N %... | 1 | 39,177,240 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
map<int,int> m;
for(auto &i:a){
m[i... | 1 | 53,972,797 |
#include<cstdio>
#include<cstring>
int main() {
char s[201];
int m, h, i, n;
while (true) {
scanf("%s", s);
if (strcmp(s, "-") == 0)break;
scanf("%d", &m);
n = 0;
for (i = 0; i < m; i++) {
scanf("%d", &h);
n = (n + h) % strlen(s);
}
printf("%s", s + n);
s[n] = '\0';
printf("%s\n", s);
}
ret... | #include <cstdio>
#include <string>
using namespace std;
char word[201];
void copy_word(char* s, char* t, int n){
for(int i = 0; i<n; ++i){
t[i] = s[i];
}
}
int main(){
while(1){
scanf("%s", word);
if(word[0] == '-'){
break;
}
int length =0;
while(word[length]!='\0'){
++length;
}
int m, b;
ch... | 1 | 67,092,588 |
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | 1 | 38,522,171 |
#include <cstdio>
using namespace std;
int main() {
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
printf(( a < b && b < c)?"Yes\n":"No\n");
return 0;
} | #include<stdio.h>
#include<stdbool.h>
int main(void){
int a,b,c;
scanf("%d",&a);
scanf("%d",&b);
scanf("%d",&c);
printf(a<b&&b<c ? "Yes\n" : "No\n");
return 0;
} | 1 | 68,385,815 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
int ans = 1e9;
for(int i=1; i<=100; i++){
int now = 0;
rep(j,n){
now += (x[j]-i)*(x[j]-i);
... | #include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<stdio.h>
#include<queue>
#include<map>
#include<stack>
using namespace std;
int dx[] = { -1,0,0,1,-1,-1,1,1,0 };
int dy[] = { 0,1,-1,0,1,-1,1,-1,0 };
int main()
{
int n;
cin >> n;
vector<int>x(n);
for (int i = 0; i < n; i++)
{
cin >>... | 1 | 292,130 |
#include<bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
vector<string> split(string,string);
int main()
{
int N;
cin >> N;
int w = N*N;
int A;
... | #include <iostream>
#include <math.h>
int main() {
double DDblCulCells, DDblAllCells, DDblWhiteCells;
double DDblBlackCells;
std::cin >> DDblCulCells >> DDblWhiteCells;
DDblAllCells = pow(DDblCulCells, 2);
DDblBlackCells = DDblAllCells - DDblWhiteCells;
std::cout << DDblBlackCells << std::endl;
} | 1 | 52,445,402 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.