code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
char ch[] = {'m', 'c', 'x', 'i'};
int value[] = {1000, 100, 10, 1};
int to_val(string s) {
int ret = 0;
for(int i = 0; i < s.size(); i++) {
int v = 1;
if('2' <= s[i] && s[i] <= '9') {
v = s[i] - '0';
i++;
}
for(int j = ... | #include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define VA... | 1 | 49,752,239 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
int main() {
... | 1 | 31,983,628 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
ll mod=998244353;
int main()
{
ll a;
string b;
cin>>a;
cin>>b;
ll first=b[0]-'0';
ll second=((b[2]-'0')*10)+b[3]-'0';
ll num=first*100+second;
cout<<(a*num)/100<<endl;
} | #include <bits/stdc++.h>
#define rep(i,a,n) for (int i = (a); i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll a; double b;
cin >> a >> b;
ll aa = a;
int bb = b*100+0.1;
printf("%lld\n",(aa*bb)/100);
return 0;
} | 1 | 11,288,872 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
using namespace std;
int main(){
int n;
while(cin>>n,n){
string str="";
string bef="",aft="";
for(int i=0;i<n;i++){
char b,a;
cin>>b>>a;
bef+=b;
aft+=a;
}
int n2;
cin>>n2;
for(int i=0;i<n2;i++){
char a;... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <map>
#include <sstream>
#include <queue>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iterator>
#include <stack>
#include <list>
using namespace std;
typedef long long int lli;
typedef pair<int,int> P;
#define F... | 1 | 37,525,821 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
int index = 0;
int cnt = 1;
while (true) {
if (index == n) {
break;
}
if (a[index] == cnt) {
cnt++;
}
else {
ans++; ... | #include <bits/stdc++.h>
using namespace std;
#define f0r(a, b) for (long long a = 0; a < b; a++)
#define f1r(a, b, c) for (long long a = b; a < c; a++)
#define f0rd(a, b) for (long long a = b; a >= 0; a--)
#define f1rd(a, b, c) for (long long a = b; a >= c; a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define m... | 1 | 67,243,526 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
const int N = 100000 + 100;
const int MOD = 1000000007;
const int oo = 1e9;
int n , a , b;
vector<int> g[N];
int so... | 1 | 27,087,745 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int _ = 2003;
int X[_] , Y[_] , len[_] , N , M , all , sum;
void work(int p , int q){
int x = p + q , y = p - q , nposx = (all + x) / 2 , nposy = (all + y) / 2;
for(int i = 0 ; i < M ; ++i){
int flgx = (nposx >> i & 1) || nposx == all , flgy =... | #include<cstdio>
#include<cstdlib>
#define llong long long
#define ldouble long double
#define uint unsigned int
#define ullong unsigned long long
#define udouble unsigned double
#define uldouble unsigned long double
#define modinc(x) {if(x>=P) x-=P;}
#define pii pair<int,int>
#define piii pair<pair<int,int>,int>
#defi... | 1 | 39,197,347 |
#include <iostream>
using namespace std;
int main(){
int sum, d, tmp;
while(cin>>d){
sum = 0;
tmp = d;
while(tmp < 600){
sum += tmp*tmp*d;
tmp += d;
}
cout<<sum<<endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int f( int x ) {
return x * x;
}
int main(void){
int d;
while( scanf("%d",&d) != EOF ) {
unsigned long long int ans = 0;
for( int i = d; i <= 600 - d; i += d )
ans += f( i ) * d;
cout << ans ... | 1 | 97,450,716 |
#include<iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
int N[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 };
int K;
cin >> K;
cout << N[K-1] << endl;
return 0;
} | #include<iostream>
int main(){
int a[]={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 k;
std::cin>>k;
std::cout<<a[k-1]<<std::endl;
} | 1 | 37,678,105 |
#include<bits/stdc++.h>
#define ll long long int
#define rep(i,n) for(ll i=0;i<n;i++)
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1}... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 1 | 2,667,791 |
#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++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include<bits/stdc++.h>
using namespace std;
int ar[105];
int cur=10000;
int main(){
int n;cin>>n;for(int i=1;i<=n;i++)cin>>ar[i];int ans=0;
for(int i=1;i<=n;i++){
if(ar[i+1]==ar[i]){
ar[i+1]=cur--;ans++;
}
}
cout<<ans;
} | 1 | 25,687,290 |
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
void solve(){
int k,n;
cin >> k >> n;
if(k*500 >= n) cout <<"Yes";
else cout <<"No";
}
int main(){
fastio;
#ifndef ONLINE_JUDGE
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
template<typename T1,typename T2> inline void chmin(T1 &a, T2 b){ if(a > b) a = b; }
template<typename T1,typename T2> inline void chmax(T1 &a, T2 b){ if(a < b) a = b; }
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.... | 1 | 33,615,309 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
#define FOR(i, n) for(int i = 1; i<=n; i++)
#define F0R(i, n) for(int i = 0; i<n; i++)
#define mp make_pair
#define pb push_back
#define f first
#define s second
string s;
int ac, bc;
int main(){
ios_base::sync_with_stdio(0);... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int, int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
string s; cin >> s;
int cnt = 0;
rep(i,s.size()){
if(s... | 1 | 29,768,737 |
#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 all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 1 | 77,455,220 |
#include <iostream>
#include <string>
using namespace std;
typedef struct{
int x,y,t;
} acord_t;
int main(void)
{
int N;
cin >> N;
acord_t point[N];
for(int i=0; i<N; i++){
cin >> point[i].t;
cin >> point[i].x;
cin >> point[i].y;
}
for(int j=0; j<N; j++){
int x_... | #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 ll INFS=1e18;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main() {
int n;
c... | 1 | 40,514,458 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F(i,a,b) for(long long i=a;i<b;i++)
#define pb push_back
#define ff first
#define ss second
#define yes cout << "YES\n"
#define no cout << "NO\n"
ll gcdExtended(ll a, ll b){
if (b == 0){
return a;
}
else
return gcdExt... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
cin>>a[0]>>a[1];
int dp[n];
dp[0]=0;dp[1]=abs(a[1]-a[0]);
for(int i=2;i<n;i++)
{
cin>>a[i];
dp[i]=min(dp[i-1]+abs(a[i]-a[i-1]),dp[i-2]+abs(a[i]-a[i-2]));
}
cout<<dp[n-1];
return... | 1 | 79,129,431 |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
if (n < 1 || n > 100){
cout << "No" << endl;
return 0;
}
if ((n % 2) == 1){
cout << "No" << endl;
return 0;
}
if (n != s.size()){
cout << "No" <... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 1 | 39,265,012 |
#include<iostream>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define fr(i,n) for(int i=0;i<n;i++)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
void trace(int a[], int n){
for (int i = 0; i < n; i++) {
if (i > 0) cout << " ";
cout << a[i];
}... | #include <iostream>
using namespace std;
void printA(int A[], int N){
for(int i = 0; i < N - 1; ++i){
cout << A[i] << " ";
}
cout << A[N - 1] << "\n";
}
int selectionSort(int A[], int N){
int nSwap = 0;
for(int i = 0; i < N - 1; ++i){
int minIdx = i;
for(int j = i; j < N; ++j... | 1 | 41,789,599 |
# include <algorithm>
# include <iostream>
# include <functional>
int m[10];
int main() {
for (int i = 0; i < 10; ++i)
std::cin >> m[i];
std::sort(m, m + 10, std::greater<int>());
for (int i = 0; i < 3; ++i)
std::cout << m[i] << std::endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int a[10];
for(int i = 0; i < 10; i++){
cin >> a[i];
}
sort(a, a + 10,greater<int>());
cout << a[0] << endl;
cout << a[1] << endl;
cout << a[2] << endl;
} | 1 | 22,763,586 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
ll a,b,k;cin>>a>>b>>k;
rep(i, k){
if(i%2==0){
if(a%2)a--;
b+=(a/=2);
}else{
if(b%2)b--;
a+=(b/=2);
}
}
cout<<a<<' '<<b;
return 0;
} | 1 | 95,031,284 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(a<=c && b+a>c){
cout<< "YES";
}
else{
cout<< "NO";
}
return 0;
} | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 1 | 60,978,467 |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
int main() {
int a, p;
cin >> a >> p;
a *= 3;
a = a + p;
cout << a / 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int a,p;
cin>>a>>p;
cout<<(3*a+p)/2<<endl;
} | 1 | 12,746,380 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int ans = N;
for(int i = 0; i <= N; i++) {
int cnt = 0;
int X = i;
int Y = N-i;
while(X != 0) {
cnt+=X%6;
X/=6;
}
while(Y != 0) {... | 1 | 90,619,399 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 1;
int cnt[N];
void sieve()
{
for (int i = 1; i < N; ++i)
{
for (int j = i; j < N; j += i)
cnt[j]++;
}
}
int main()
{
sieve();
int n;
scanf("%d", &n);
long long ans = 0;
for (int c = 1; c < n; ++c)
... | #include<bits/stdc++.h>
using namespace std;
#define sl1(a) scanf("%lld",&a)
int main(){
long long n,ans=0ll;
sl1(n);
for (long long i=1;i<n;i++) ans+=(n-1)/i;
printf("%lld\n",ans);
return 0;
} | 1 | 53,817,868 |
#include<bits/stdc++.h>
#define rint register int
#define ll long long
using namespace std;
int N,A[101010],tong[110100],Max,Min;
int main(){
cin>>N;
Max=-1,Min=10000;
for(rint i=1;i<=N;++i) cin>>A[i],tong[A[i]]++;
for(rint i=1;i<=N;++i) {
Max=max(Max,A[i]);
Min=min(Min,A[i]);
}
if(Max==1) {
if(N==2) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
#define ge (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
#define ri read_int()
#define rl read_ll()
#define FILE(s) freopen(s"in", "r", stdin),... | 1 | 1,483,665 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) str... | #include<bits
using namespace std;
typedef long long ll;
#define req(i,n) for(int i = 1;i <= n;i++)
#define ALL(a) (a).begin(),(a).end()
ll n,m, ans = 0;
int main() {
cin >> n >> m; priority_queue<int> pq; int a, b,j =0;
vector<pair<int, int>> v;
req(i, n) {
cin >> a >> b;
v.push_back(make_... | 1 | 15,274,840 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
vector<pair<int,int>>A(100001);
vector<pair<int,int>>B(100001);
for(int i=0;i<100001;i++){
A[i].second=i;
B[i].second=i;
}
for(int i=0;i<N;i++){
int a;cin>>a;
if(i%2==0)A[a].first++;
else B[a].first++;
}
sort(A.b... | 1 | 2,457,755 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, A, B, p;
cin >> N >> A >> B;
vector<ll> n(3);
for ( int i = 0; i < N; i++ ) {
cin >> p;
if ( p <= A ) n[0]++;
else if ( p <= B ) n[1]++;
else n[2]++;
}
ll ans = min({n[0],n[1],n... | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a, b;
cin >> a >> b;
int p[n];
int one = 0,two=0,three=0;
for(int i = 0; i < n; i++){
cin >>p[i];
if(p[i]<=a)one++;
else if(p[i]<=b)two++;
else three++;
}
cout << min(one, min(two,three)) << endl;
return 0;
} | 1 | 71,761,170 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mk make_pair
#define mod 1000000007
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define ff first
#define ss second
#define prec(y,x) fixed<<setprecision(y)<<x
#define inf 1e18
#define pi 3.1415926535
vect... | #include<bits/stdc++.h>
using namespace std;
const int N = 3e5+10;
struct node{
int x,y;
}a[N];
int cx[N],cy[N],idx,idy;
vector<int>xx,yy;
map<long long,int>mp;
int main(){
int n,m,k;
cin>>n>>m>>k;
for(int i=0;i<k;i++){
scanf("%d %d",&a[i].x,&a[i].y);
cx[a[i].x]++,cy[a[i].y]++;
if(cx[a[i].x]>cx[idx])idx=a[i].... | 1 | 78,757,481 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int time=0;
int A, B, C, D, E;
cin >> A >> B >> C >> D >> E;
int N=5;
vector <int> Time={A, B, C, D, E};
vector <int> index={0, 1, 2, 3, 4};
int bestTime=(int)1e9;
do{
int Nowtime=0;
for (int i=0; i<N; i++){
while (Nowtime%10!=0) Nowt... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc123_b.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 1 | 51,679,586 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1000000000000
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
ll n;
cin>>n;
vector<ll> a,b;
ll sn=sqrt(n);
ll ans=INF;
for(ll i=1;i<=sn;i++)
{
if(n%i==0)ans=min(ans,i+n/i-2);
}
cout<<ans... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long n; cin >> n;
long long a = 1, b;
for (long long i = 2; i * i <= n; i++){
if(n % i == 0) a = i;
}
b = n / a;
cout << a + b - 2 << endl;
return 0;
} | 1 | 90,812,100 |
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main(void){
int N; cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
vector<ll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int N; cin>>N;
vector<int64_t> A(N),B(N);
rep(n,0,N) cin>>A.at(n);
rep(n,0,N) cin>>B.at(n);
... | 1 | 7,079,594 |
#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 all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define All(a) (a).begin(),(a).end()
vector<ll> prime_factorization(ll x){
vector<ll> v;
ll i;
for (i=2; i<x; i++){
if(x%i==0){
v.push_back(i);
while(x%i==0)x/=i;
}
}
if(x!=1)v.push_back(x);
return v;
}
int main(){
... | 1 | 85,207,199 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N;
cin >> N;
vector<vector<pair<int,int>>> edge(N,vector<pair<int,int>>());
rep(i,N-1){
int a,b,c;
cin >> a >> b... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 1 | 34,836,142 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
int main(){
ll n,k;
cin>>n>>k;
ll dp[k+1],ans=0;
for(ll i=k;i>=1;i--){
dp[i]=power(k/i,n);
for(ll j=2*i;j<=k;j+=i) dp[i]-=dp[j];
... | #include <stdio.h>
#include <algorithm>
using namespace std;
long long mod = 1000000007;
long long f[100010];
long long get_pow(long long x, long long k, long long mod) {
long long res = 1;
while (k) {
if (k & 1) res = (res * x) % mod;
x = (x * x) % mod;
k >>= 1;
}
return res;
}
... | 1 | 158,906 |
#include<stdio.h>
int main(void){
int a[3000],b[3000],d,e;
int c=0;
while(1){
scanf("%d %d",&a[c],&b[c]);
if(a[c]==0 && b[c]==0){
break;
}
c++;
}
for(d=0;d<c;d++){
if(a[d]>b[d]){
e=a[d];
a[d]=b[d];
b[d]=e;
}
printf("%d %d\n",a[d],b[d]);
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
while(1){
int a ,b; cin >> a >> b;
if(a==0 && b==0)break;
if(a >b) cout << b << " " << a << "\n";
else cout << a << " " << b<< "\n";
}
} | 1 | 44,193,255 |
#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>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
string t = "";
for (int i=0; i<s.size(); i++) {
if (s[i] != 'x') t.push_back(s[i]);
}
auto rev_t = t;
reverse(rev_t.begin(), rev_t.end());
if (t != rev_t) {
cout << -1 << endl;
return 0;
}
vector<int> cn... | 1 | 1,995,707 |
#include <iostream>
#include <string>
#include <vector>
using ll=long long;
using namespace std;
int main(){
int N;
cin>>N;
int p;
int minnum=2e5+1;
int ans=0;
for(int i=0;i<N;i++){
cin>>p;
if(p<=minnum){
ans++;
}
if(minnum>p){
minnum=p;
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n,k;
cin>>n;
int a[n],minv=1e9;
int cnt=0;
for(int i=0;i<n;i++){
cin>>a[i];
minv=min(minv,a[i]);
if(minv==a[i])cnt++;
}
cout<<cnt<<endl;
... | 1 | 11,980,151 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int main(){
ll N, sum = 0; cin >> N;
ll A[N];
for(int i=0; i<N; i++){
cin >> A[i];
sum += A[i];
}
if(sum % (N*(N+1)/2) == 0){
ll cnt = sum/(N*(N+1)/2), chk = 0;
for(int i=0; i<N; i++){
ll gap = A[(i+1)%N] - A[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(),in.end()
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return... | 1 | 79,413,967 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
#include <climits>
int solve(int& A, int& B)
{
int ans = 100001;
for(int i = 0; i < 100001; i++)
{
if(floor(i*0.08)==A && floor(i*0.10)==B) ans = std::min(i, ans);
}
if (ans == 100001)... | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define sz size()
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).begin(), (x).end()
typedef long long ll;
ty... | 1 | 27,337,356 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | #include "bits/stdc++.h"
using namespace std;
#define dump(x) cout << (x) << endl;
typedef int64_t Int;
Int mod = 1e9+7;
int main() {
Int a, b;
cin >> a >> b;
Int k;
cin >> k;
while (k > 0) {
b += a / 2;
a /= 2;
k--;
if (k == 0) break;
a += b / 2;
b /= 2;
k--;
}
cout << a << " ... | 1 | 94,620,784 |
#include <iostream>
using namespace std;
int main(){
int d;
while(cin >> d){
int area = 0;
for(int x = d; x <= 600-d; x += d){
area += x * x * d;
}
cout << area << endl;
}
return(0);
} | #include<iostream>
using namespace std;
int main() {
int d, x, y, s = 0;
while (cin >> d) {
x = 600;
s = 0;
for (x -= d; x > 0; x -= d) {
y = x * x;
s += y * d;
}
cout << s << endl;
}
return 0;
} | 1 | 27,005,404 |
#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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
void solve()
{
int a,b;cin>>a>>b;cout<<a-b+1<<endl;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | 1 | 80,318,239 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <functional>
#include <list>
#define MOD (1000000000 + 7)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const i... | #include <bits/stdc++.h>
using namespace std;
int N;
string S;
int main(){
cin >> N >> S;
string number;
int ans = 0;
for (int i = 0; i < 1000; i++){
number = to_string(i);
if (number.size() == 1){
number = "00" + number;
}
else if (number.size() == 2){
... | 1 | 14,113,648 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N,M;
... | #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)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
int main() {
ll N,M,a,b,c;
cin ... | 1 | 27,486,332 |
#include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
using namespace std;
vector<ll> nex[100009],used(100009,0),col(100009,-1);
int main(){
ll n,m,is=0,nb=0,nnb=0;
cin>>n>>m;
for(int i=0;i<m;i++){
ll x,y;
cin>>x>>y;
nex[x].pb(y);
nex[y].pb(x);
}
for(int i=1;i<=n;i++){
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define dep(i,a,b) for(int i=a;i>=b;i--)
typedef long long ll;
const int MAXN = 100050;
const int MAXM = 400500;
bool vis[MAXN];
int h[MAXN],nx[MAXM],to[MAXM],tot,rk[MAXN];
int color[MAXN],n,m;
void add_edge(int x,int y){to[++tot]=y;n... | 1 | 29,580,640 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define sz size
#define se second
#define fe first
#define mper make_pair
#define all(x) x.begin(), x.end()
#define mal ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
#define vl vector<ll>
#define vi vector<int>
#define vli vector <pair <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll pre[100005];
ll pos[100005];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
int n, k;
cin >> n >> k;
for(int i=1; i<=n; i++){
int x;
ci... | 1 | 26,797,048 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>... | #include<stdio.h>
int main(){
char str[10];
scanf("%s", str);
if (str[2]==str[3] && str[4]==str[5]){
puts("Yes");
}
else puts("No");
return 0;
} | 1 | 75,775,686 |
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> Que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solv... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 1 | 65,335,377 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll d;cin >>d;
string c="Christmas";
string e="Eve";
if(d==25)cout <<c<<endl;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int d;
cin>>d;
cout<<"Christmas";
while(d<25){
cout<<" Eve";
d++;
}
cout<<endl;
return 0;
} | 1 | 76,783,121 |
#include<cstdio>
#include<algorithm>
#include<cstring>
#define ll long long
using namespace std;
int n,size[100005],sa[100005],pa[100005];
ll d[100005];
bool cmp(int a,int b)
{
return d[a]>d[b];
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld",&d[i]);
sa[i]=i;
}
sort(sa+1,sa+n+1,cmp);
for(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int N;
int D[110000], n[110000], d[110000];
unordered_map<int, int> mp;
v... | 1 | 62,785,753 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ll long long
#define ld long double
#define pb push_back
#define MOD 1000000007
#define LLMN LONG_LONG_MIN
#define... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> graph(n+1);
for(int i = 0; i < m; i++){
int a, b; cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
queue<int> que;
que.push(1);
vector<int> seen(n+1, -1);
seen[1] = 1;
vector<in... | 1 | 56,675,299 |
#include <bits/stdc++.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) for(ll i=(a);i>=(b);... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 1 | 72,573,312 |
#include"bits/stdc++.h"
#define rep(i, N) for(int i = 0;i < N;i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
int main(void) {
int L; cin >> L;
long double x = (long double)L / 3.0;
printf("%.10Lf\n", x * x * x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
double l; cin >> l;
cout << fixed << setprecision(10) << (l/3) * (l/3) * (l/3) << endl;
return 0;
} | 1 | 26,217,260 |
#include <iostream>
using namespace std;
int main() {
int w,h,x,y,r; cin >> w>>h>>x>>y>>r;
if((x-r>=0)&&(x+r<=w)&&(y-r>=0)&&(y+r<=h)){cout << "Yes\n";}else{cout << "No\n";}
return 0;
} | #include<cstdio>
using namespace std;
int main() {
int W, H, x, y, r;
scanf("%d %d %d %d %d", &W, &H, &x, &y, &r);
if (x + r > W || y + r > H) {
printf("No");
} else if (x - r < 0 || y - r < 0) {
printf("No");
} else {
printf("Yes");
}
printf("\n");
return 0;
} | 1 | 96,585,363 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MN = 200010;
int N;
int A[MN];
set<pii> st;
bool check(int x) {
st.clear();
for(int i = 1; i < N; i++) {
if(A[i - 1] < A[i]) {
continue;
}
else {
int pos = A[i];
while(p... | #include <stdio.h>
#include <assert.h>
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
#include <map>
#include <unordered_map>
#include <stdlib.h>
#include <time.h>
#include <string>
const int MAX_N = 200050;
int N;
long lon... | 1 | 75,956,077 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
#include<deque>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>... | 1 | 27,451,910 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr first
#define sec second
#define rep(i,n) for(i=0;i<n;i++)
#define vi vector <int>
#define vc vector <char>
#define vl vector <ll>
#define vb vector <bool>
#define pb push_back
#define M 1000000007
#define... | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int k,a,b;
cin>>k;
cin>>a>>b;
if(a%k==0||b%k==0){
cout<<"OK";
}else if((((a/k)+1)*k)<b){
cout<<"OK";
}else cout<<"NG";
return 0;
} | 1 | 30,389,456 |
#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() {
int N, devider = 0;
cin >> N;
for (int n = N; n != 0; n /= 10) {
devider += n % 10;
}
if (N % devider == 0) {
cout << "Yes" << endl;
} else {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string ans = "No";
int a = N/100000000;
int b = N/10000000 - a*10;
int c = N/1000000 - a*100 - b*10;
int d = N/100000 - a*1000 - b*100 - c*10;
int e = N/10000 -a*10000 - b*1000 - c*100 - d*10;
int f = N/1000 - a... | 1 | 7,079,971 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int, int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
string s; cin >> s;
int cnt = 0;
rep(i,s.size()){
if(s... | #include <bits/stdc++.h>
using namespace std;
using f32 = float;
using f64 = double;
using LL = long long;
using ULL = unsigned long long;
#define REP(i, n) for (LL i = 0; i < (int)(n); i++)
signed main()
{
string a;
cin >>a;
REP(i,2){
if(a[i]!=a[i+1]){
cout << "Yes";
return 0;
}
}
cout << "No";
} | 1 | 16,616,898 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main() {
#ifdef LOACL
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int N;
long long ans=0,minb=1e9;
scanf("%d",&N);
for(int i=1;i<=N;i++) {
long long a,b;
scanf("%lld %lld",&a,&b);
ans+=a;
if(a>b)minb=min(minb,b);
}
pr... | #include<cstdio>
#include<algorithm>
using namespace std;
int n;
long long a,b,t=1000000001,ans;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld%lld",&a,&b);
ans+=a;
if(a>b)
t=min(t,b);
}
if(t==1000000001)
printf("0");
else printf("%lld",ans-t);
} | 1 | 88,632,689 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int p, cnt;
while (cin >> p) {
if (p == 0) {
break;
}
cnt = 0;
int otsu = 1000 - p;
if (otsu >= 500) {
otsu -= 500;
cnt++;
}
if (otsu >= 100) {
cnt += otsu / 100;
otsu -= otsu / 100 * 100;
}
... | #include <iostream>
using namespace std;
int main() {
int a,b=0;
while(1){
cin >> a;
if(a==0) break;
a=1000-a;
if(a>=500){
a-=500;
b++;
}
while(1){
if(a<100) break;
a-=100;
b++;
}
if(a>=50){
a-=50;
b++;
}
while(1){
if(a<10) break;
a-=10;
b++;
}
if(a>=5){
a-=5;
... | 1 | 25,862,841 |
#include <stdio.h>
#include <bits/stdc++.h>
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = l; i < r; i++)
#define repb(i, r, l) for (int i = r; i > l; i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a,... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | 1 | 65,793,606 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
int main() {
ios_base... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,-1,sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
const double ... | 1 | 73,192,679 |
#include <cassert>
#include <iostream>
#include <vector>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
ll dp[200010];
int main() {
string a;
cin >> a;
vector<ll> count(26);
dp[0] = 1;
int n = a.size();
for (ll i = 0; i < n; ++i) {
dp[i+1] = dp[i]+i-count[a[i]-'a'];
++co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
string s;cin>>s;
ll n=s.size();
map<char,ll> m;
rep(i,0,n)m[s[i]]++;
ll an=0;
for(auto i:m){
ll num=i.second;
an+=(num-1)*num/2;
}
cout<<n*(n-... | 1 | 34,652,666 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string num;
int ans, digit;
ans = 0;
while(1){
cin >> num;
if(num == "0") break;
for (int i = 0; i < num.length(); ++i)
{
digit = num[i] -'0';
ans += digit;
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int sum;
while (1) {
sum = 0;
cin >> s;
for (int i = 0; i < s.length();i++) {
sum += s[i] - '0';
}
if (!sum) break;
cout << sum << endl;
}
} | 1 | 59,997,973 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 1 | 96,348,679 |
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> vec(n);
for (auto &v : vec)
cin >> v;
partial_sum(vec.begin(), vec.end(), vec.begin());
ll ans = 0;
map<ll, ll> mp;
mp[0] =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N;
cin >> N;
map<ll,ll> mp;
mp[0] = 1;
ll now = 0;
rep(i, 0, N){
ll a;
cin >> a;
now += a;
mp[now]++;
... | 1 | 28,413,310 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main(){
... | #include <bits/stdc++.h>
using namespace std;
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pow(x) x*x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
template < typename ... | 1 | 44,482,918 |
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cassert>
#include <numeric>
#include <string>
#include <cstring>
#include <cmath>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 1 | 71,071,145 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main()
{
int x, y;
cin >> x >> y;
Cout(x + y / 2);
return 0;
} | #include <stdio.h>
#include <stdlib.h>
int main()
{
int x,y;
while(~scanf("%d%d",&x,&y))
{
printf("%d\n",x+y/2);
}
return 0;
} | 1 | 89,877,218 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
using Graph = vector<vector<int>>;
int main(){
int N,R;
cin >> N >> R;
if(N<10) R+=100*(10-N);
cout << R << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n, r;
int main(){
cin >> n >> r;
cin.ignore();
if(n >= 10){
cout << r << endl;
return 0;
}
cout << r + 100 * (10 - n) << endl;
return 0;
} | 1 | 36,113,780 |
#include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(... | #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 | 96,239,709 |
#include <iostream>
using namespace std;
struct Vector
{
double x;
double y;
};
istream& operator>>(istream& stream, Vector& p)
{
return stream >> p.x >> p.y;
}
double slope(Vector p1, Vector p2)
{
return (p2.y - p1.y) / (p2.x - p1.x);
}
int main()
{
int length;
cin >> length;
while(length-- > 0)
{
Vector a, ... | #include <iostream>
#include <cmath>
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)
using namespace std;
int main (int argc, char const* argv[]){
int n;
double x1,x2,x3,x4,y1,y2,y3,y4;
cin >> n;
while(cin >> x1 >>y1 >>x2 >>y2 >>x3 >>y3 >>x4 >>y4){
double ax=x2-x1, ay=y2-y1, bx=x4-x3,by=y4-y3;
... | 1 | 43,606,997 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
ll N, C, K;
cin >> N ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
rep(i, n) cin >> t.at(i);
sort(t.begin(), t.end());
int cnt = 1;
int min_time = t.at(0);
int canPassenger = c;
for (int i = 0; i < n; i++) {... | 1 | 41,776,361 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 998244353;
int main()
{
string A;
cin >> A;
LLONG N = A.size(); ... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846264338327950288419
using namespace std;
int freq[128];
int len;
char str[200005];
long long ans;
int main(){
scanf("%s", str);
len = strlen(str);
ans = 1;
for(int i = 0; i < len; i++){
ans += i - freq[str[i]];
freq[str[i]]++;
}
printf("%lld\n", ans);
... | 1 | 14,579,457 |
#include<iostream>
using namespace std;
int main()
{
int n,a;
while(cin>>n)
{
int x=0;
for(int i=0;i<10;i++){
for(int j=0;j<10;j++){
for(int k=0;k<10;k++){
a=n-i-j-k;
if(a>=0&&a<=9)
x++;
... | #include <cstdio>
#include <iostream>
using namespace std;
int main(){
int n;
while( scanf(" %d", &n) != EOF ){
int count=0;
for(int a=0; a<10; ++a){
for(int b=0; b<10; ++b){
for(int c=0; c<10; ++c){
for(int d=0; d<10; ++d){
if(a+b+c+d == n) ++count;
}
}
}
}
printf("%d\n", count)... | 1 | 81,934,494 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
using Graph = vector<vector<int>>;
const int d... | 1 | 46,931,972 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | #include <bits/stdc++.h>
using namespace std;
long long n, a, b;
int main() {
cin >> n >> a >> b;
if (a > b)
cout << 0 << endl;
else if (n == 1)
cout << (a == b) << endl;
else {
b -= a;
cout << (n - 2) * b + 1 << endl;
}
return 0;
} | 1 | 64,478,358 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a.begin(), a.end());
int maxDiff = -1;
int ans = -1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector <int> a(n);
int mx = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
mx = max(mx, a[i]);
}
int need = (mx + 1) / 2; int ans = 0;
for(int i = 0; i < n; i++) {
if(abs(need - a[i]) < abs(need - ans)) {
ans = a[i... | 1 | 26,761,772 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <iomanip>
#include <algorithm>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N, K, d;
cin >> N >> K;
vector<int> s(N, 0);
for (int i = 0; i < K; ++i) {
int d;
cin >> d;
for (int j = 0; ... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int N,K,d,A,count=0;
bool *b;
cin>>N>>K;
b=new bool[N];
for(int i=0;i<N;i++)
b[i]=false;
for(int i=0;i<K;i++)
{
cin>>d;
for(int j=0;j<d;j++)
{
cin>>A;
b[A-1]=true;
}
}
for(int i=0;i<N;i++)
if(!b[i... | 1 | 62,247,755 |
#include<bits/stdc++.h>
using namespace std;
typedef vector <int> vi;
typedef pair< int ,int > pii;
#define endl "\n"
#define f0(i,n) for(int i=0;i<n;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define sd(val) scanf("%d",&val)
#define ss(val) scanf("%s",&val)
#define sl(val) scanf("%lld",&val)
#define debug(val) printf... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tre... | 1 | 85,266,331 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
u... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
... | 1 | 81,176,474 |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<math.h>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
const int N=10000;
const db pi=acos(-1.0);
#define lowb... | #include <bits/stdc++.h>
using namespace std;
#define MOD (1000000000+7)
int main()
{
int N;
string S;
cin >> N >> S;
long long ans = 1;
if( S[0] == 'W' ) {
ans = 0;
}
else {
int k = 1;
for( int i = 1; i < S.size(); i++ ) {
if( S[i] == 'B' ) {
if( k % 2 ) {
ans *= k;
ans %= MOD;
k--;
... | 1 | 25,165,787 |
#define _GIBCXX_DEBUG
#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()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
ll x, t;
cin >> x >> t;
cout << max(0LL, (x - t)) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
cout << max(0,A-B) << endl;
} | 1 | 40,396,238 |
#include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <utility>
#include <typeinfo>
#include <tuple>... | #include <iostream>
using namespace std;
int main()
{
int num, angles;
angles = 0;
cin >> num;
angles = 180 * (num- 2);
cout << angles << endl;
} | 1 | 32,529,311 |
#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | #define IN_PC() freopen("C:\\Users\\hz\\Desktop\\in.txt","r",stdin)
#define IN_LB() freopen("C:\\Users\\acm2018\\Desktop\\in.txt","r",stdin)
#define OUT_PC() freopen("C:\\Users\\hz\\Desktop\\out.txt","w",stdout)
#define OUT_LB() freopen("C:\\Users\\acm2018\\Desktop\\out.txt","w",stdout)
#include <bits/stdc++.h>
using n... | 1 | 60,621,298 |
#include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#define ALL(c) (c).begin(), (c).end()
#define DUMP(x) std::cerr << #x << ':' << x << '\n';
typedef long long ll;
template<typename T,typename U>inline bool chmax(T&x,U a){if(x>=a)return 0;x=a;r... | #include<vector>
struct TopologicalSort {
int n;
std::vector<std::vector<int>> G;
std::vector<int> indeg;
TopologicalSort(int n) : n(n), G(n, std::vector<int>()), indeg(n) {}
void addEdge(int from, int to) {
G[from].push_back(to);
indeg[to]++;
}
std::vector<int> getSorted() {... | 1 | 29,313,378 |
#include <iostream>
#include <vector>
using namespace std;
bool ask(int64_t n)
{
cout << "? " << n << endl
<< flush;
#if 0
int ans = 10;
string sn = to_string(n);
string sa = to_string(ans);
return (n <= ans && sn <= sa) || (n > ans && sn > sa);
#endif
string rep;
cin >> rep;
re... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | 1 | 25,928,293 |
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main()
{
string hanako;
string tarou;
int n;
int tpoint=0;
int hpoint=0;
int i;
cin >> n;
for(i=0;i<n;i++)
{
cin >> tarou >>hanako;
if(tarou>hanako)
tpoint+=3;
if(hanako>tarou)
hpoint+=3;
if(ha... | #include <string.h>
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n = 0, taro_point = 0, hanako_point = 0;
char taro_card[100 + 1] = { 0 },
hanako_card[100 + 1] = { 0 };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> taro_card >> hanako_card;
int result = strcmp(taro_card, hanako... | 1 | 28,640,960 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> ... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
ll gcd(ll m, ll n) {... | 1 | 68,397,104 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
if ( t>s ) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
return 0;
} | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
reverse(t.... | 1 | 3,965,636 |
#include<iostream>
#include<bits/stdc++.h>
#include<climits>
#define forn(x,n,s) for(int i = x; i < n; i += s )
#define forr(x,n,s) for(int i = x; i>=n; i -= s)
using namespace std;
void go(){
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("out... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t; cin >> s >> t;
int ans = 0;
for (int i = 0; i < s.size(); i++) {
ans += s.at(i) != t.at(i);
}
cout << ans << endl;
} | 1 | 57,641,550 |
#include<bits/stdc++.h>
using namespace std;
#define mem(a,b) memset((a),b,sizeof((a)))
#define fpre(x) cout<<fixed<<setprecision(x)
#define clr(v) (v).clear()
#define pii pair<int,int>
#define pdd pair<double,double>
#define pli pair<ll,int>
#define pll pair<ll,ll>
#define mp make_pair
#define eb emplace_back
#define ... | #include <bits/stdc++.h>
using namespace std;
int N, i;
void ans(){
cin >> N >> i;
cout << N-i+1 << endl;
}
int main() {
ans();
} | 1 | 88,062,182 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll k, a, b;
cin >> k >> a >> b;
if (b - a <= 2) {
cout << k + 1 << "\n";
}
else {
ll ans = a;
k -= ... | #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 | 68,390,078 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define deb(x) cout<<x<<"\n";
#define deB(x,y) cout<<x<<" "<<y<<"\n";
#define Deb(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n";
#define YES cout<<"YES\n";
#define Yes cout<<"Yes\n";
#define NO cout<<"NO\n";... | #include <iostream>
#include <vector>
#include <algorithm>
using i64 = long long;
int main() {
constexpr i64 mod = 1000000007;
int n;
std::cin >> n;
if (n <= 2) {
std::cout << 0 << std::endl;
return 0;
}
i64 ret = 0;
std::vector<i64> v(n + 1);
v[n] = 1;
for (int i = 0... | 1 | 74,738,104 |
#include<iostream>
using namespace std;
int W, H;
char tile[25][25];
int cnt;
int x, y;
void dfs(int y, int x){
tile[y][x] = '#';
cnt++;
int dy[4] = { 0, 1, 0, -1 };
int dx[4] = { 1, 0, -1, 0 };
for (int i = 0; i < 4; i++){
int Y = y + dy[i];
int X = x + dx[i];
if (0 <= Y&&Y < H && 0 <= X&&X < W&&tile[Y][X] ... | #include <cstdio>
int W, H;
char tile[21][21];
int search(int y, int x) {
if (tile[y][x] == '#') return 0;
int cnt = 1;
tile[y][x] = '#';
if (y > 0) cnt += search(y-1, x);
if (y < H-1) cnt += search(y+1, x);
if (x > 0) cnt += search(y, x-1);
if (x < W-1) cnt += search(y, x+1);
return cnt;
}
int main... | 1 | 71,868,613 |
#include<iostream>
#include<string>
using namespace std;
#define SIZE 1001
int Char_Change_Int( char c );
int main()
{
char num;
string str;
int sum = 0;
while( 1 )
{
cin >> str;
num = str[0];
if( num == '0' && str.size() == 1 )
{
break;
}
for( int i = 0; i < str.size(); i++ )
{
sum += Char_Cha... | #include <stdio.h>
int main(){
int soma = 0;
char n[] = {"123456789"};
while(true){
char x[1000] = {0};
scanf("%s", &x);
if(x[0] == '0')
return 0;
soma = 0;
for(int i = 0; i < 1000; i++){
switch (x[i]){
case '1':
soma += 1;
break;
case '2':
soma += 2;
break;
case '3':
soma... | 1 | 34,828,243 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <vector>
#include <cmath>
#include <cstdint>
#include <string>
using namespace std;
int main() {
string s, p;
cin >> s;
cin >> p;
string ring = s + s;
if (ring.find(p) != string::npos) {
cout << "Yes" << endl;
} else... | #include<iostream>
using namespace std;
int main(){
string s,p;
int s_num = 0;
int p_num = 0;
bool discover =false;
getline(cin,s);
getline(cin,p);
string s_search = s+s;
for(int i = 0; i < s_search.length();i++){
if(s_search[i]==p[0]){
... | 1 | 25,800,407 |
#define _GLIBCXX_DEBUG
#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,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(... | 1 | 7,427,171 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.