code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include<chrono>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
using namespace chrono;
const ll MOD = 1000000007;
const ll N = 300... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | 1 | 89,562,499 |
#include <iostream>
using namespace std;
int main(void) {
int N, K, X, Y;
int ans = 0;
int sab = 0;
cin >> N >> K >> X >> Y;
sab = N - K;
if (sab < 0) {
cout << N * X << endl;
}
else {
ans = (K * X) + (sab * Y);
cout << ans << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main (void) {
int N, K, X, Y;
int sum = 0;
cin >> N >> K >> X >> Y;
for (int i = 1; i <= N; i++ ){
if (N > K) {
sum = ((K * X) + (N - K) * Y) ;
}else {
sum = N * X;
}
}
cout << sum << endl;
retu... | 1 | 41,168,583 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include<bits/stdc++.h>
using namespace std;
long long l,r;
int main()
{
scanf("%lld%lld",&l,&r);
long long ans=2019;
for(long long i=l;i<=r;++i)
{
for(long long j=i+1;j<=r;++j)
{
ans=min(ans,(i*j)%2019);
if(ans==0)
{
cout<<ans<<endl;
return 0;
}
}
}
cout<<ans<<endl;
return 0;
} | 1 | 73,622,252 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll k=1,n,a,b;cin>>n>>a>>b;
if(n<a+b-1 || n>a*b)return cout<<"-1" , 0;
vector<ll> arr;
for(ll i=0;i<a;i++){
for(ll j=0;j<b && a-i-1+k<=n;j++)ar... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n) - 1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
const long long MOD = 1e9 + 7, INF = 1e18;... | 1 | 78,079,031 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
cin >> s;
int n = s.size(), maxlen = 0;;
for(int i = n-1; i > 0; i--){
string ans = s.substr(0,i);
int len = ans.size();
if(len % 2 == 1){
continue;... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define debug(x) cerr<<#x<<": "<<x<<endl;
#define MOD 1000000007ULL;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
char S[222];
cin>>... | 1 | 90,966 |
#include<stdio.h>
#include<string.h>
char inp[16];
int main (void) {
int m, n, i, j, ox, oy;
scanf(" %d %d", &m, &n);
for(i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf(" %s", &inp);
if(!strcmp(inp, "snuke")) {
ox = i;
oy = j;
goto prre;
}
}
}
prre:
printf("%c%d\n", 'A' + oy, ox + 1... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <functional>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespac... | 1 | 74,098,312 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | #include<iostream>
using namespace std;
int main() {
int N; cin >> N;
long cnt = 0;
for (int a = 1; a < N; a++) {
cnt += (N-1)/a;
}
cout<<cnt<<endl;
} | 1 | 11,814,695 |
#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>
using namespace std;
int main(){
int n[101];
int i;
for( i = 0;i < 101;i++){
n[i] = 0;
}
for( i = 1;i != 0;i){
i = 0;
cin >> i;
n[i]++;
}
int max = 1;
for( i = 2;i < 101;i++){
if(n[max] <= n[i]){
max = i;
}
... | 1 | 70,047,856 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(vr) vr.begin(),vr.end()
const int N=1e5+10,inf=2e9;
ll a[N],val[N],n,ps[N],ans[N];
ll get(ll x)
{
int tmp=upper_bound(val+1,val+n+1,x)-... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<long long> b(n);
vector<pair<int, int>> c(n);
for (int i = 0; i < n; i++) c[i] = make_pair(~a[i], i);
sort(c.begin(),... | 1 | 29,135,211 |
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << a / b << ' ' << a % b << ' ' << fixed << setprecision(5) << (double)a / b << endl;
} | #include<stdio.h>
int main(){
int a=0,b=0,d=0,r=0;
double f;
scanf("%d %d",&a,&b);
d=a/b;
printf("%d ",d);
r=a%b;
printf("%d ",r);
f=(double)a/(double)b;
printf("%f\n",f);
return 0;
} | 1 | 12,145,139 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N,M;
cin >> N >> M;
vector<int64_t> A(N),B(N);
for ( int64_t i = 0; i < N; ++i){
cin >> A.at(i) >> B.at(i);
}
vector<vector<int64_t>> AB;
AB.resize(M+1);
for ( int i = 0; i < N; ++i){
if ( A.at(i) > M ) co... | #include <bits/stdc++.h>
#define rp(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll=long long;
using P=pair<int,int>;
using G=vector<vector<int>>;
int main(){
int n,m;
cin >> n >> m;
priority_queue<P> job;
priority_queue<int> ok;
rp(i,n){
int a,b;
cin >> a >> b;
job... | 1 | 34,421,135 |
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define MAXN 30001
int first[10];
int last[10];
bool syutugen[10];
int main() {
int n;
string s;
cin >> n >> s;
memset(syutugen, false, sizeof(syutugen));
for (int i = 0; i < n; i++) {
if (!(syutugen[s[i] - '0'])) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n;
string s;
cin >> n >> s;
vector<vector<bool>> l(n, vector<bool>(10, false)),r(n, vector<bool>(10, false));
for(int i = 1; i < n-1; i++) {
l[i]=l[i-1];
... | 1 | 100,561,191 |
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <... | #include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define ... | 1 | 67,853,233 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
int main() {
ll n;cin >> n;
vector<ll> e(100001,0);
vector<ll> o(100001,0);
ll emax = -1;
ll omax = -1;
ll eid = -1;
ll oid = -1;
rep(i,n){
ll num;cin >> num;
if( i%2 == 0 ){
o.at(nu... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n; cin>>n;
map<int, int> even;
map<int, int> odd;
for (int i=0; i<n; i++){
int v; cin>>v;
if(i%2==0){
if(even.count(v)){
even[v]=even[v]+1;
}
else even[v... | 1 | 87,645,003 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
LL x, y, z, u, d;
vector<LL> a, b, c;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> x >> y >> z >> d;
for(int i = 0; i < x; i++) cin >> u, a.push_back(u);
for(int i = 0; i < y; i++) cin >> u, b.push_back(u);
for(int i = 0; ... | #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>
#include <cctype>
#in... | 1 | 94,223,193 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | 1 | 7,361,926 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
namespace io
{
#define SIZ (1 << 21 | 1)
#define gc() (io::iS == io::... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define PI 3.141592653589793
using namespace std;
typedef long long ll;
template<class T> void chmax(T &a,T b) { if (a<b) a=b;}
template<class T> void chmin(T &a,T b) { if (a>b) a=b;}
int gcd(int a, int b){
if (a < b) gcd(b,a)... | 1 | 23,703,791 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 1 | 13,758,028 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | 1 | 79,574,743 |
#include <iostream>
#include <algorithm>
using namespace std;
int H,N;
long long sum = 0;
int main(){
cin>>H>>N;
int A[N];
for(int i =0;i<N;i++){
cin>>A[i];
sum+=A[i];
}
if(sum>=H){cout<<"Yes";}
if(sum<H){cout<<"No";}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main() {
ll h,n;
cin >> h >> n;
ll total = 0;
rep(i,n) {
int x;
cin >> x;
total += x;
}
if (h <= total) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 23,573,576 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const string YES = "Yes";
const string NO = "No";
void solve(long long H, long long W, std::vector<std::string> s) {
vector<pair<ll, ll>> dir{pair<ll, ll>(-1, 0), pair<ll, ll>(1, 0), pair<ll, ll>(... | 1 | 93,064,332 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
vector<ll> a(n),b(n);
for(ll i = 0; i < n; i++) cin >> a[i];
for(ll i = 0; i ... | #include<bits/stdc++.h>
#define endl "\n"
#define int long long
#pragma GCC optimize(3)
using namespace std;
int n,a[10005],b[10005],s1,s2;
signed main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n*2;i++)
(i>n)?(cin>>b[i-n]):(cin>>a[i]);
for(int i=1;i<=n;i++)
(a[i]>b[i])?(s1+=(a[i]-b[i])):(s2+=(b[i]... | 1 | 71,849,658 |
#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... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
set<int> s;
cin >> n >> k;
while (k --> 0) {
int d;
cin >> d;
for (int i = 0; i < d; ++i) {
int a;
cin >> a;
s.emplace(a);
}
}
cout << ... | 1 | 75,613,868 |
#include <bits/stdc++.h>
int main() {
int A[3][3];
for (int i = 0; i < 3; ++i)
for (int j = 0; j < 3; ++j)
std::cin >> A[i][j];
int N; std::cin >> N;
std::vector<int> b(N);
for (int i = 0; i < N; ++i) std::cin >> b[i];
for (int p : b)
for (int i = 0; i < 3; ++i)
for (int j = 0; j < 3; ++... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb push_back
#define ld long double
#define f first
#define s second
#define in insert
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define speed io... | 1 | 56,041,220 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
priority_queue<int, vector<int>, greater<int>> train;
priority_queue<int, vector<int>, greater<int>> bus;
vector<int> tmp(4);
for (int i = 0; i < 4; i++)
cin >> tmp.at(i);
for (int i = 0; i < 4; i++)
{
if (i < 2)
train.p... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin>>A>>B>>C>>D;
int E =min(A,B);
int F=min(C,D);
cout<<E+F<<endl;
} | 1 | 97,916,103 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#define pi 3.14159265358979323846264338327950
int main() {
long long H, W; std::cin >> H >> W;
long long m = W * H;
if (H == 1 || W == 1) {
std::cout << 1 << std::endl;
return 0;
}
if (H % 2 == 1... | #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 | 55,322,744 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <map>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<int, int>;... | 1 | 62,069,590 |
#include<iostream>
using namespace std;
int main(void){
int first,last,input,i,times;
times = 0;
cin >> first >> last >> input;
for(i=first; i<last+1; i++){
if(input < i) break;
if(input % i == 0)
times++;
}
cout << times << endl;
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b,c;
int rmd=0,i=0,ans=0;
cin >>a >>b >>c;
do{
if(rmd==c%(a+i)){
ans++;
}
i++;
}while(a+i<=b);
cout <<ans <<endl;
return 0;
} | 1 | 37,417,616 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
ll q,h,s,d,n;
cin>>q>>h>>s>>d... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 1 | 89,585,969 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define Graph vector<vector<ll>>
#define INF (1ll<<60)
#define mod 1000000007
int main(){
string N;ll K;
cin>>N>>K;
ll dp[110][2][5];
rep(i,110)rep(j,2)rep(k,5) dp[i][j][k]=0;
dp[0][0][0]=1;
fo... | #include <iostream>
#include <string>
#include <vector>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using vvll = vector<vll> ;
int main(){
string s ; cin >> s ;
ll n = s.size();
ll k ; cin >> k ;
vvll dp1(n,vll(k+1,0)),dp2(n,vll(k+1,0)) ;
dp1.at(0).at(0) = (s.at(0)!='0') ;
dp1.at(0).at(1... | 1 | 10,771,002 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <cmath>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
#define rep(i, o) for (ll i = 0; i < (o);i++)
#define rep_s(i, o) for (int i = 1; i <= (o);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<(int)(b);i... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 1 | 63,897,663 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
}
int kan_hyaku(int n){
... | #include <iostream>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int cnt = 0;
for (int i = 0; i < n; i++)
{
if (i + k - 1 < n)
{
cnt++;
}
}
cout << cnt << endl;
return 0;
} | 1 | 23,443,926 |
#include <bits/stdc++.h>
using namespace std;
string s1,s2,s3;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>s1>>s2>>s3;
char c =toupper(s1[0]);
cout<<c;
c =toupper(s2[0]);
cout<<c;
c =toupper(s3[0]);
cout<<c;
return 0;} | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i= (a); i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() { string s1, s2, s3;
cin >> ... | 1 | 93,444,881 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " <<... | #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 | 29,699,424 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | 1 | 12,083,972 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
int n; cin >> n;
V<int> dp(n + 1, n);
dp[0] = 0;
for(int i = 1; i <= n; i++){
for(int p6 = 1; p6 <... | 1 | 56,127,673 |
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
string s,t;
cin >> s;
bool flag = 0;
for(char ch = 'a'; ch <= 'z'; ch++) {
for(int i = 0; i < s.size(); i++) {
if(ch == s[i]) {
flag = 0;
break;
... | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string s;
cin >> s;
vector<int>arr(26,0);
for (auto ss: s) {
... | 1 | 66,244,722 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n, k;
cin >> n >> k;
ll ans = pow(n/k, 3);
if (k%2==0)
ans += pow((n+k/2)/k, 3);
cout << ans;
return 0;
} | #include<iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
int main()
{
long N,K;
cin >> N >> K;
long num = N / K;
long longCount = num*num*num;
if (K % 2 == 1)
{
cout << longCount << endl;
return 0;
}
else
{
long num2 = 0;
for (int... | 1 | 90,163,372 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
int a[n+1];
int b[n+1];
int cnt = 0;
rep(i, n)
{
cin >> a[i];
}
rep(i , n)
{
if(a[a[i]] == i)
cnt++;
}
cout << cnt / 2 << endl;
return (0);
} | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
long long getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),... | 1 | 90,641,814 |
#include <stdio.h>
#include <iostream>
using namespace std;
#define MAX_N 100000
#define NIL -1
struct Node {
int parent;
int left;
int right;
};
void print_node(Node nodes[], int i, int depth[]) {
printf("node %d: parent = %d, depth = %d, ", i, nodes[i].parent, depth[i]);
if(nodes[i].parent == NIL) {
pri... | #include <stdio.h>
#define debug
#define NMAX 100010
#define NIL -1
int left[NMAX];
int right[NMAX];
int parent[NMAX];
int depth[NMAX];
void setDepth(int i, int d) {
debug("setDepth %d %d\n", i, d);
if (i == NIL) {
return;
}
depth[i] = d;
setDepth(left[i], d + 1);
setDepth(right[i], d)... | 1 | 95,693,830 |
#include <cmath>
#include <iostream>
#include <iomanip>
using namespace std;
#define PI 3.141592653589793238
int main(){
int a , b , c;
cin >> a >> b >> c;
cout << fixed << setprecision(9) << a*b*sin(PI/180*c)/2 << endl;
cout << fixed << setprecision(9) << a+b+sqrt(a*a+b*b-2*a*b*cos(PI/180*c)) << endl;
cout << fix... | #include <iomanip>
#include <iostream>
#include <cmath>
using namespace std;
int main(){
double a, b, deg, rad;
cin >> a >> b >> deg;
rad = deg / 180 * 3.141592653589793;
double bsin = b * sin(rad);
cout << fixed << setprecision(5);
cout << a * bsin / 2 << endl;
cout << a + b + sqrt(a*a + b*b - 2*a*b*cos(rad)) <... | 1 | 11,307,313 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,t;
cin >> n >> t;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
long long count = t;
for(int i = 0; i < n-1; i++){
count += min(a[i+1]-a[i],t);
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<n;i++)
#define ll long long int
int main(){
int n;
cin>>n;
ll T,t[n];
cin>>T;
ll count=T;
cin>>t[0];
for(int i=1;i<n;i++){
cin>>t[i];
if(t[i]-t[i-1]>T){
count+=T;
}
else
{
count+=t[i]-t[i-1];
}
}
cout<<count<<endl;
return 0;
} | 1 | 29,738,699 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string S;
cin >> S;
ll cnt = 0;
if(S[0] != 'A'){
cout << "WA" << endl;
return 0;
}
for(int i = 2; i < S.size() - 1; i++){
if(S[i] == 'C') cnt++;
}
if(cnt != 1){
cout << "WA" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
bool b = true;
if(S[0] != 'A') {
b = false;
}
bool c = false;
for(int i = 2; i < N - 1; i++) {
if(S[i] == 'C' && c) {
c = false;
break;
}
if(S[i] == 'C' && !c) {
c = true;
... | 1 | 64,730,573 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main (void){
int N,M;
ll X;
cin >> N >> M >> X;
vector<ll> C(N);
vector<vector<ll>> A(N,vector<ll>(M));
rep(i,N){
cin >> C[i];
rep(j,M){
cin >>... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define MOD 1000000007
#define oo 1000000000000000000
#define forr(i,n) for(ll i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin()... | 1 | 28,388,171 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstre... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 1 | 15,033,831 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string _... | #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i,n) for(int i=0;i<n;i++ )
#define rep2(i,f,n) for(int i=f;i<n;i++ )
#define SORT(A) sort(A.begin(),A.end())
#define REV(A) reverse(A.begin(),A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vector<std::vector<... | 1 | 66,868,658 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> t(n+2), a(n+2), h(n+2, 0);
t[0] = 0;
a[n+1] = 0;
for(int i = 1; i <= n; i++){
cin >> t[i];
if(t[i] != t[i-1]) h[i] = t[i];
}
for(int i = 1; i <= ... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <fstream>
#include<cstdio>
#include<iomanip>
#include<stack>
#include<queue>
#include<string>
#include <cstdlib>
#include <typeinfo>
#include <math.h>
#include <list>
#define REP(i, n) for(int i=0;i<n;i++)
#define REP2(i, s, n) for(int i... | 1 | 34,355,526 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define P 1000000007
#define inf 1e18
int main()
{
ll i, n;
cin >> n;
cout << (n * (n - 1)) / 2 << "\n";
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << (long long)n * (n-1) /2 << endl;
} | 1 | 43,354,680 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>
#include <stack>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef long long ll;
typed... | #include<bits/stdc++.h>
using namespace std;
int n,maxa,vis[100005];
vector<int> v[505];
int main()
{
int sum=1;vis[1]=2;
for(int i=2;i;i++){if(sum+i>100000) break;sum+=i;vis[sum]=i+1;maxa=max(maxa,vis[sum]);}
cin>>n;if(!vis[n]) return !puts("No");int m=1,gg=0;
while(gg<n){for(int i=1;i<=m;i++) v[i].push_back(i+gg)... | 1 | 35,188,419 |
#include<algorithm>
#include<iostream>
#include<functional>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
char s[16];
for(int i=0;i<12;i++){
cin>>s[i];
char a=s[i];
cout<<a;
if(i==3)
cout<<" ";
}
cout<<endl;
} | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | 1 | 51,020,948 |
#include <cstdio>
#include <algorithm>
#define fail return puts("-1"), 0
const int N = 1e3 + 5;
int n, sz;
long long x[N], y[N], bin[33];
void solve(long long x, long long y) {
for (int i = sz - 1; i >= 0; i--) {
if (std::labs(x) > std::labs(y)) {
putchar(x < 0 ? 'L' : 'R');
x < 0 ? x += bin[i] : x -= bin[i];
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, x[1003] = {}, y[1003] = {}, b = 0;
cin >> n;
for (int i = 0; i... | 1 | 79,077,742 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int lld;
const lld mod = 1e9+7;
const lld INF = 1e9;
const lld MAXN = 1e5;
vector<lld> fact,inv;
lld f(lld a,lld b, ll... | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=(... | 1 | 25,516,483 |
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <vector>
#include <numeric>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <sstream>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <cassert>
#include <bits... | #include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
ll BigN = 1000000007;
ll powmod(ll a, ll n){
ll ret = 1;
for(ll i=0;i<60;i++){
if(n&(1LL<<i)) ret*=a;
a=(a*a)%BigN;
ret%=BigN;
}
return ret;
}
int N,K;
int visit[100001]={1,1,};
ll dp[100001]={0,1,};
ll sol(int k, int r){
if(r... | 1 | 16,006,779 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<int> sum;
int n,m,x,max;
while(cin>>n>>m,n||m){
cin>>x;
sum.push_back(0);
sum.push_back(x);
max=-1000000;
for(int i=2;i<=n;i++){
cin>>x;
sum.push_back(sum[i-1]+x);
}
for(int i=0;i<n-m+1;i++){
if(sum[m+i]-sum[i]>max)
max=sum[m+... | #include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
ty... | 1 | 35,895,741 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
string S;cin >> S;
string T = S;
int Ans = 0;
int A = 0, B = 0;
for(int i = 0; i < S.length(); i++){
if(i%2 == 0 && S.at(i) == '1'){
S.at(i) = '0';A++;}
if(i%2 == 1 && S.at(i) == '0'){
S.at(i) = '1';A++;}
}
S = T;
for(int i = 0; i < S.length()... | #include<bits/stdc++.h>
using namespace std;
int main() {
int c=0;
string s; cin>>s;
for(int i=0;i<s.size();i++) if((i%2&&s[i]=='1')||(i%2==0&&s[i]=='0')) c++;
cout<<min(c,(int)s.size()-c);
} | 1 | 69,211,140 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
string S;
cin >> S;
int countB = 0;
int countW = 0;
for (int i = 0; i < S.size(); i++) {
if ((S[i] == '0' && i % 2 == 0) || (S[i] == '1' && i % 2 != 0)) {
coun... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin>>S;
int a=S.size();
int b=0;
int c=0;
rep(i,a){
if(i%2==0)
{
if(S[i]=='0'){
b++;
}
}
else{
... | 1 | 7,086,789 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
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(a > ... | #include<bits/stdc++.h>
using namespace std;
#define N 100000 + 5
#define rep(i, l, r) for(int i = l; i <= r; ++i)
int n, l, q, a, b, tot, siz, x[N], nxt[N], last[N], cntb[N], block[N];
int read(){
char c; int x = 0, f = 1;
c = getchar();
while(c > '9' || c < '0'){ if(c == '-') f = -1; c = getchar();}
w... | 1 | 83,420,744 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int n,m;
pair<int,int> ab[100005];
priority_queue<int> que;
bool cmp(const pair<int,int>&a,const pair<int,int>&b)
{
if(a.first!=b.first) return a.first<b.first;
return a.second>b.second;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i<n... | 1 | 82,045,474 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
map<int,int64_t> p;
void fl(int64_t n){
if(n==1){
return ;
}
int tmp = n;
while(tmp%2==0 ){
tmp /= 2;
p[2]++;
}
for(int i=3;i*... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 1 | 35,795,510 |
#include <bits/stdc++.h>
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define DECIM8 fixed<<setprecision(8)
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b)... | #include <algorithm>
#include <numeric>
#include <map>
#include <vector>
#include <iostream>
using namespace std;
int main() {
while (true) {
int n, a, b, c, x;
cin >> n >> a >> b >> c >> x;
if (!n) break;
int d[110];
for (int i = 0; i < n; i++) {
cin >> d[i];
}
int u = 0;
int i = 0;
for (i = 0; i... | 1 | 56,172,160 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<... | 1 | 75,098,883 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k; cin>>n>>k;
vector<int> a(n);
for(auto& e: a) cin>>e;
sort(rbegin(a), rend(a));
int res=n;
long s=0;
for(int i=0; i<n; ++i) {
s+=a[i];
if (s>=k) { res=min(res, n-i-1); s-=a[i]; }
}
cout<<res<<endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
int main()
{
int N, K;
cin >> N >> K;
vector<long long> a(N);
REP(i, N) cin >> a[i];
sort(a... | 1 | 82,849,401 |
#include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <numeric>
#include <vector>
#include <iterator>
#include <set>
#include <map>
using namespace std;
const double PI=acos(-1);
int main(){
long a, b, c, n, cnt = 0;
cin >> a >> b >> c >> n;
... | #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;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
#define INF 1e9
#define LINF __LONG_LONG_MAX__
int main() {
int ... | 1 | 25,603,006 |
#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>;
int main() {
string s;
cin >> s;
bool ok = true;
int cnt = 0;
if(s[0] != 'A') ok = false;
for(int i = 1; i < (int)s.size(); i++) {
if(isupper(s[i])) {
if... | #include "bits/stdc++.h"
using namespace std;
int main()
{
string s,ans;
int c,p,n;
c=0;
cin>>s;
n=s.size();
ans="AC";
if(s.at(0)!='A')
ans="WA";
else
{
s.at(0)='a';
for(int i=2;i<n-1;i++)
{
if(s.at(i)=='C')
{
c++;
p=i;
}
}
if(c!=1)
ans="... | 1 | 87,425,132 |
#include<bits/stdc++.h>
#define l(i,a,n)for(int i=a;i<n;i++)
#define pb push_back
#define in insert
#define mp make_pair
#define lw(v) sort(v.begin(),v.end());
#define hi(v) sort(v.begin(),v.end(),greater<long long>());
#define all(v) v.begin(),v.end()
#define filein freopen ("input.txt", "r", stdin)
#define fileout fr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll r, d;
cin >> r >> d;
vector<ll> x(100);
cin >> x[0];
rep(i, 0, 10) x[i+1] = r*x[i] - d;
rep(i, 1, 11) cout << x[i] << endl;
return ... | 1 | 43,403,448 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
vector<ll> a, p;
ll dfs(ll n, ll x) {
if (n == 0)
return x <= 0 ? 0 : 1;
else if (x <= a[n - 1] + 1)
return dfs(n - 1, x - 1);
else
return p[n - 1] + 1 + dfs(n - 1, x - 2... | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll calc_size(int level) {
return (1LL << (2 + level)) - 3LL;
}
ll calc_patty(int level) {
return (1LL << (1 + level)) - 1LL;
}
ll solve(int level, ll x) {
if (level == 0 && x == 1) return 1LL;
--x;
if (... | 1 | 6,825,438 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, x, first;
cin >> n >> x >> first;
int ret = abs(x - first);
for (int i = 1; i < n; i++) {
int a;
cin >> a;
ret = __gcd(ret, abs(x - a));
}
cout << ret << endl;
return 0... | 1 | 89,676,956 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
int N;
cin >> N;
int total = 0;
int candy = 1;
for (int i = 1; i <= N; i++){
total += candy;
candy += 1;
}
cout << total << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int N; cin >> N;
int ans =0;
rep(i,N) ans += i+1;
cout << ans << endl;
} | 1 | 47,574,256 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) begin(x), end(x)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
const int MAX = 5000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define mp make_pa... | 1 | 46,872,809 |
#include<iostream>
using namespace std;
int main()
{
int d,s_d;
int fx;
for(;cin >> d;)
{
fx=0;
for(s_d=d;d<600;d+=s_d)
fx+=d*d*s_d;
cout << fx << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int d, ans;
while(scanf("%d", &d)!=EOF){
ans=0;
for(int i=d; i<600; i+=d) ans+=pow((double)i, 2.0)*d;
printf("%d\n", ans);
}
return 0;
} | 1 | 199,862 |
#include <bits/stdc++.h>
#include "atcoder/dsu"
typedef long long int ll;
using namespace std;
using namespace atcoder;
int main() {
int n, q;
cin >> n >> q;
vector<int> ans;
dsu d(n);
for (int i = 1; i <= q; i++) {
int t, u, v;
cin >> t >> u >> v;
if (t == 0) {
d... | #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 pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
#incl... | 1 | 26,857,668 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n,L;cin>>n>>L;
int a[n]; for(int i = 0; i < n; i++) cin>>a[i];
bool flag = false;
int left,right;
for(int i = 0; i < n-1; i++){
if(a[i]+a[i+1] >= L){
flag = true;
left = i;
right = i+1;
}
}
if(flag == false){
cout<<"Impossible"<<en... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(int... | 1 | 44,934,600 |
#include <bits/stdc++.h>
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define fr(i,a,b) for(int i=a;i<b;i++)
#define frr(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define pp pop_back
#define pi pair<int ,int >
#define mk make_pair
... | #include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include <ctime>
using namespace std;
int main()
{
string s; cin>>s; int max=0;
for(int i=0; i<=(int)s.size()-1; ++i)
{
int sum=0;
if(s[i]=='R'){
int j=i;
while(s[j]=='R')
{
sum++;
j++;
... | 1 | 26,091,359 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
bool kai(string s, int b, int e) {
int n = e - b;
bool tf = true;
for(int i = b; i < n/2; i++) {
if(s[i] != s[n-1-i])
tf = false;
}
return tf;
}
int main() {
string s;
cin >> s;
... | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i =... | 1 | 54,095,294 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> Bingo(3, vector<int>(3));
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) cin >> Bingo.at(i).at(j);
}
int N, S;
cin >> N;
vector<int> Bi(N);
for(int i = 0; i < N; i++) {
cin >> Bi.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 9;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
int Q;
cin >> Q;
while (Q--) {
int b;
cin >> b;
for (int i = 0; i < N; i++) {
if (A.at(i) == b) A.at(i) = -1;
}
}
bool b = 0;
if (A.at(0) + A.at(1) ... | 1 | 87,833,649 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
int N,L;
cin>>N>>L;
vector<int> a(N);
R... | 1 | 15,193,708 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<bits/stdc++.h>
using namespace std;
static const long long maxLL = (long long) 1 << 62;
int main(void) {
int n;
cin >> n;
vector<int> A(n);
for (auto &a: A) cin >> a;
long long cost = maxLL;
for (int x = -100; x <= 100; ++x) {
long long sum = 0;
for (int i = 0; i < n; ++... | 1 | 82,890,811 |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main(){
int N,X,Y;
char x[1024],y[1024];
int dp[1024][1024];
scanf("%d",&N);
while(N--){
scanf("%s%s", x, y);
X = strlen(x); Y = strlen(y);
memset(dp, 0, sizeof dp);
for(int i=0;i<X;i++){
for(int j=0;j<Y;j... | #include<stdio.h>
int hantei(char x[], char y[]) {
int xn = 0, yn = 0, flag = 0, i, j, max = 0;
int c[1001][1001];
while (flag == 0)
{
if (x[xn] != '\0')
{
xn++;
}
else
{
flag = 1;
}
}
flag = 0;
while (flag == 0)
{
if (y[yn] != '\0')
{
yn++;
}
el... | 1 | 49,874,017 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,k,i;
string s;
cin >> n >> s >> k;
for(i=0;i<n;i++){
if(s.at(i)!=s.at(k-1)){
s.at(i)='*';
}
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | 1 | 71,512,419 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | #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 | 86,718,326 |
#include<iostream>
#include<algorithm>
#include<climits>
using namespace std;
#define INF INT_MAX
int a,b,T,flag=1,minn;
long long num;
int main()
{
minn=INF;
scanf("%d",&T);
for(int i=1;i<=T;i++)
{
scanf("%d%d",&a,&b);
num+=a;
if(a>b)minn=min(minn,b);
if(a!=b)flag=0;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) FOR(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define ve vector
#define vi vector<int>
#d... | 1 | 26,970,234 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
usi... | #include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
cout << (100*N+1800*M)*(1<<M) << endl;
} | 1 | 1,567,949 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define show(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define show(x)
#endif
typedef long long int ll;
typedef pair<int,int> pii... | #include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <queue>
using namespace std;
int n,q,com,x,y;
int rank[10000],parent[10000];
int find(int x){
if(x == parent[x])return x;
else{
return parent[x] = find(parent[x]);
}
}
bool isSame(int x,int y){
return find(x) == find(y);
}
void u... | 1 | 1,101,168 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a,b;
cin>>a>>b;
if(a=='H'&&b=='H'){cout<<'H'<<endl;}
else if(a=='D'&&b=='D'){cout<<'H'<<endl;}
else if(a=='H'&&b=='D'){cout<<'D'<<endl;}
else{cout<<'D'<<endl;}
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define All(V) v.begin(), v.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
char a, b; cin >> a >> b;
if((a == 'H' && b == 'H') || (a == 'D' && b == 'D')){
cout <<... | 1 | 46,128,249 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ld long double
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rrep(i, a, b) for(ll i = a; i >= b; --i)
#define pii pair<i... | 1 | 43,930,125 |
#include <iostream>
#include <vector>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> t(N), v(N);
for (int i = 0; i < N; i++) cin >> t[i];
for (int i = 0; i < N; i++) cin >> v[i];
t.insert(t.begin(), 0);
for (int i = 0; i < N; i++) t[i+1] += t[i];
t.insert(t.begin(),... | #include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
int N;
int main() {
cin >> N;
vector<int> t(N), v(N), s(N + 1);
for (int i = 0; i < N; i++) {
cin >> t[i];
t[i] <<= 1;
s[i + 1] = t[i] + s[i];
}
for (int i = 0; i < N; i++) {
cin >> v[i];
... | 1 | 27,017,667 |
#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>
#include <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i, n) ;for (int i = 0;i < (int)(n);i++)
#define rep2(i, s, n) ;for (int i = s; i < (int)(n);i++)
#define ALL(vec) (vec).begin(),(vec).end()
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_IN... | 1 | 26,410,173 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE(v... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x[n],i=0;
int z=0;
for (;i<n;i++){
cin>>x[i];
if(z==0&&i>0){
int j=i-1;
if(x[j]==x[i]||x[j-1]==x[i])
z++;
}
}
if(z==0){
sort(x,x+n);
int j=n-1;
int m=n/2+1;
int k=n/2-1;
for (int i=0;i<n/4+2;i++){
if(x[i+1]==x[i]||x[j]==x[j-1]||x[m]==x[m-1]||... | 1 | 13,594,669 |
#include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | #include <math.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack... | 1 | 96,783,734 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
const int maxn = 1e5 + 5;
#define INF 1000000000
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
using pii = pair<int, int>;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i < n; i++) {
cout << s[i] << t[i];
}
cout << endl;
} | 1 | 58,462,368 |
#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... | #include<iostream>
using namespace std;
using ll=long long;
int main(){
ll A,B,C,D;
cin>>A>>B>>C>>D;
ll sum=B-A+1;
ll C_cnt=B/C-((A-1)/C);
ll D_cnt=B/D-((A-1)/D);
ll x=C*D;
if(C<D){
ll temp=C;
C=D;
D=temp;
}
ll r=C%D;
while(r!=0){
C=D;
D=r;... | 1 | 58,152,213 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FAST_IO std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define setpre(n) fixed << setprecision(n)
#define F first
#define S second
#define pii ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define Time (doub... | 1 | 28,704,380 |
#include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(ll i=0; i<sum.size(); i++)
#define fixed cou... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typed... | 1 | 89,558,360 |
#include <iostream>
#include <cstdlib>
#include <list>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void)
{
int64_t N, K;
cin >> N >> K;
int64_t p[1000];
for (int64_t i = 0; i < N; ++i)
{
cin >> p[i];
}
sort(p, p+N);
int64_t... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
using ll = long long;
using Graph = vector<vector<pair<int, int>>>;
const ll INF = 1001001001;
int main(){
int n, k; cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end())... | 1 | 93,942,943 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PB push_back
#define MP make_pair
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int w, h, x, y; cin >> w >> h >> x >> y;
cout << setprecision(10) << double(w) * double(h) / 2 << " " << (2 * x == w && 2 * y == h) << "\n";
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 1 | 54,481,076 |
#include <bits/stdc++.h>
using namespace std;
#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 LL long long
#define INF INT_MAX
const double EPS = 1e-14;
const double PI = acos(-1.0);
int ma... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
using tii = tuple<int, int>;
#def... | 1 | 64,572,202 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, p;
cin >> s >> p;
if ((s + s).find(p) == (size_t) -1) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
string n,s;
cin>>n>>s;
n+=n;
int i,j;
int flg=0;
for(i=0;i<n.size();i++){
for(j=0;j<s.size();j++){
if(n[i+j]!=s[j]){
break;
}
}
if(j==s.size()) flg=1;
}
cout<<((flg)?"Yes":"No")<<endl;
return 0;
} | 1 | 18,282,069 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a,b;
cin >> a >> b;
if(a + b == 15) cout << '+' << endl;
else if(a * b == 15) cout << '*' << endl;
else cout<< 'x' <<... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i,j,k) for(int i = j ; i < k ; ++i)
#define RREP(i,j,k) for(int i = j ; i >=k ; --i)
#define A first
#define B second
#define mp make_pair
#define pb emplace_back
#define PII p... | 1 | 52,126,321 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int x = (int)s.size();
for (int i = 0; i < pow(2,x - 1); ++i) {
string ans = "";
ans += s[0];
int sum = s[0] - '0';
for (int j = 0, p = 0; j < x - 1; ++j,p++) {
if ((i >> j) & 1) {
sum = (s... | 1 | 49,853,707 |
#include <cstdio>
int main()
{
char ch;
int n = 0;
while ((ch = getchar())!= '0' || n != 0)
{
if (ch == '\n')
{
printf("%d\n",n);
n = 0;
}
else
{
ch &= 0x0F;
n += ch;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
string line;
int s;
while(getline(cin, line))
{
if(line.length() == 1 && line[0] == '0')
break;
s = 0;
for(int i = 0; i < line.length(); i++)
{
s += line[i] - '0';
}
cout << s <<... | 1 | 74,025,864 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.