code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define ll long long int
#define rep(i,a,b) for(long long i=a; i<b; i+=1)
#define repr(i,a,b) for(long long i=a; i<=b; i+=1)
#define vec vector<ll>
#define map map<char,int>
#define repa(p,A) for(auto p:A)
#define pb push_back
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a... | #include<iostream>
using namespace std;
int par[10000];
int rank[10000];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
rank[i] = 0;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
void unite(int x, int y... | 0 | 11,312,179 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define s... | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
int n;
int bj[maxn];
int a[maxn];
int cnta[maxn];
int cntb[maxn];
typedef pair<int,int> pii;
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(i&1)
{
cnta[a[i]]++;... | 0 | 13,085,503 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i,n) for(int i=0;i<n;i++)
const int MOD = 1000000007;
ll cnt =0,ans=0;
int main(){
string s,t;
cin >> s >> t;
int n = s.size(), m=t.size();
ans = INF;
for(int i=0;i<=n-m;i++){
cnt = 0;
for(i... | 0 | 36,240,486 |
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define FAST ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define SZ(a) (int)a.size()
#define Flush fflush(stdout);
typedef long long ll ;
using namespace st... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> sa(n);
copy(a.begin(), a.end(), sa.begin());
sort(sa.begin(), sa.end(), greater<int>());
for (int i = 0; i < n; i++) {... | 0 | 38,516,864 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 0 | 16,625,712 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int ans ,sum=0 ,cost1=0 , cost2=0;
cin>>n;
int a[n];
for(int i=0; i<n; i++)
{
cin>>a[i];
sum=sum+a[i];
}
ans=sum/n;
for(int i=0; i<n; i++)
cost1=cost1+((a[i]-ans)*(a[i]-ans));
ans=(sum/n)+1;
for(int i=0; i<n; i++)
cost2=cost2+((a[i]-ans)*(a[i]-ans));
cou... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <queue>
#include <map>
#include <list>
#include <stack>
#include <tuple>
#include <cstdio>
#include <cmath>
using namespace std;
#define kita cout << "kita\n"
#define print2(i, n) cout << (i) << ": " <... | 0 | 1,824,849 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll count1[101];
int main() {
ll n;
cin>>n;
if(n<10)
{
cout<<"0";
return 0;
}
for(ll i=2;i<=n;i++)
{
ll temp=i;
for(ll j=2;j<=temp;j++)
{
while(temp%j==0)
{
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
int main() {
string S,T; cin >> S >> T;
int ma = 0;
int num = S.size() - T.size() + 1;
for (int i = 0; i < num; i++) {
int cnt = 0;
for (int j = 0; j < T.size(); j++) {
if (S[j+i] == T[... | 0 | 50,508,608 |
#include <iostream>
#include <string>
#include <math.h>
#include <stdio.h>
#include <ctype.h>
using namespace std;
int main() {
string E[1000];
int n=0;
while(cin>>E[n]){
n++;
}
int B[1000]={0};
for(int i=0; i<n; i++){
for(int j=i; j<n; j++){
if(E[i]==E[j]){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
int main(){
ll n;
cin >> n;
vector<ll> a(n + 1);
REP(i, n + 1){
... | 0 | 63,882,481 |
#include<bits/stdc++.h>
#include<set>
#define lli long long int
#define pb push_back
#define cio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define rep(i,a,n) for(i=a;i<n;i++)
#define all(v) (v.begin(),v.end())
#define ppb pop_back
#define vsz v.size()
#define pi 3.141592653589793238
#define mod 10... | #include <bits/stdc++.h>
#define uni(x) (x).resize(unique(all(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define MP(x, y) make_pair(x, y)
#define SZ(x) int((x).size())
#define PB(x) push_back(x)
#define ll long long
#de... | 0 | 94,641,237 |
#include <iostream>
using namespace std;
int main() {
while ( true ) {
int N, M, P;
cin >> N >> M >> P;
if ( N == 0 ) break;
int sum = 0, hit;
for ( int i = 1; i <= N; i++ ) {
int val;
cin >> val;
sum += val;
if ( i == M ) {
hit = val;
}
}
const int ans =... | #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 whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cout << "[" << #var << "] " ... | 0 | 63,199,454 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | #include <bits/stdc++.h>
using namespace std;
#define long long long
#define size 5005
const long MOD = 1e9+7;
bool dp[size];
int A[size];
pair<int,int>pos[size];
signed main()
{
long test;
test=1;
while(test--){
long i,j,b,n,x,k,ans,most,index,c,maxi=0,temp,aw,bw,w,count,sum;
cin>>n>>k;
for(i=0... | 0 | 1,802,328 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
string A, B, C;
cin >> A >> B >> C;
if(A[A.size() - 1] == B[0] && B[B.size() - 1] == C[0])
cout << "YES";
else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> V... | 0 | 10,295,988 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
int main(){
ll N;
cin>>N;
if(N%2==0){cout<<N/2-1<<endl;}
else{cout<<N/2<<endl;}
} | #include<bits/stdc++.h>
# define ll long long
# define mod 1000000007
# define MAX 100005
# define PI 3.141592653589793238
# define pb push_back
# define mp make_pair
# define all(x) x.be... | 0 | 33,531,516 |
#include<bits/stdc++.h>
#define bye return 0
#define Yes cout << "Yes" << "\n"
#define No cout << "No" << "\n"
#define YES cout << "YES" << "\n"
#define NO cout << "NO" << "\n"
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
vector<int> v;
set<int> s;
int t, a, b, c, cnt=0... | #include <bits/stdc++.h>
using namespace std;
void solve () {
long long n, m;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < m; i++) {
int x; cin >> x;
mp[x] = 1;
}
vector<long long> fibo(2);
fibo[0] = 0;
fibo[1] = 1;
long long md = 1e9 + 7;
for (int i = 1; ... | 0 | 75,752,662 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N, temp, ans;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++){
cin >> data.at(i);
}
for (int i = 1; i < 101; i++){
temp = 0;
for (int j = 0; j < N; j++){
temp += (data.at(j) - i) * (data.at(j) - i);
}
... | 0 | 89,547,562 |
#include <iostream>
using namespace std;
class student {
int m;
int f;
int r;
public:
student(int m,int f, int r);
char grade();
bool isempty();
};
student::student(int m, int f, int r){
this->m = m;
this->f = f;
this->r = r;
}
char student::grade(){
if (m == -1 || f == -1){
return 'F';
}
if (m + f >= 80)... | #include<bits/stdc++.h>
using namespace std;
#define long long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define X first
#define Y second
#define sz size
#define ft(i , a , b) for (long i = (long)a ; i <= (long)b ; i++)
#define fd(i , a , b) for (long i = (long)a ; i >= (long)b ; i--)
#define... | 0 | 60,685,842 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m; cin >> n >> m;
int left=1;
int right=n;
for(int i=0;i<m;i++){
int L,R; cin >> L >> R;
if(left<L) left=L;
if(R<right) right=R;
}
cout << max(right-left+1,0);
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define lper(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define CST(x) cou... | 0 | 51,771,146 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define mod 1000000007
lli p,n;
string str;
int main()
{
cin>>n>>p;
cin>>str;
lli ans=0;
if(p==2)
{
for(lli i=0;i<n;i++)
{
if( (str[i]-'0') %2==0)
{
ans+=i+1;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int N;
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 ma... | 0 | 74,980,104 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
ll c[300005]={0};
ll d[300005]={0};
ll dsum[300005]={0},dksum[300005]={0};
signed main(){
ll n;
cin>>n;
for(int i=0;i<n;i++){
ll a;
cin>>a;
c[a]++;
}
for(int i=1;i<=n;i++) d[c[i]]++;
for(int i=1;i<=n;i++){
dsum... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl... | 0 | 75,019,168 |
#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 ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
double n,ans=0;
cin>>n;
vector<double>a(1000000);
vector<string>s(1000000);
for(int i=0;i<n;i++){
cin>>a[i]>>s[i];
if(s[i]=="JPY"){
ans+=a[i];
}... | 0 | 57,258,384 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define all(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cout << #x << " = " << x << endl;
#else
#define dbg(x)
#endif
using namespace std;
void solve(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using iii = pair<ii, ll>;
#define vt vector
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
const ll MOD = 1e9 + 7;
const ll INF = 2e9;
... | 0 | 57,346,559 |
#include <iostream>
using namespace std;
#define for_(i,a,b) for(int i = (a);i < (b);i++)
#define rfor_(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define rep(i,n) for_(i,0,(n))
#define rrep(i,n) rfor_(i,0,(n))
int n, m;
int main(){
cin.tie(0);
while(cin>>n>>m,n||m)cout<<(n<m?n:m)<<' '<<(m<n?n:m)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int x,y;
cin>>x>>y;
const long long INF=1LL<<60;
long long int ans1=INF,ans2=INF,ans3=INF,ans4=INF;
long long int tmp_x=-1*x;
long long int tmp_y=-1*y;
if (y-x>=0) {
ans1=y-x;
}
if (y-tmp_x>=0) {
... | 0 | 50,850,842 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, l, r;
string ans;
cin >> a >> b >> c >> d;
l = a + b;
r = c + d;
if (l == r) ans = "Balanced";
else if (l>r) ans = "Left";
else ans = "Right";
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 93,972,640 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 4e5 + 5;
ll a[N], cum[N];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll n, m;
cin >> n >> m;
map<ll, ll>freq;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
freq[0] = 1;
for(int i ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("unroll-loops, no-stack-protector")
#pragma GCC target ("avx")
#pragma GCC target ("avx2")
#pragma GCC target ("fma")
#define fastio ios_base::sync_with_stdio(0... | 0 | 65,972,327 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(void)
{
int n, m, l=1, r;
cin >> n >> m;
r = n;
rep(i,m){
int a, b;
cin >> a >> b;
l = max(l, a);
r = min(r, b);
}
cout << max(0, r-l+1) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <utility>
#include <queue>
#include <map>
#include <deque>
#include <assert.h>
#include <stack>
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_bac... | 0 | 55,040,114 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(i) begin(i), end(i)
const int INF = 0x3fffffff;
const ll MINF = 0x7fffffffffff;
const ld DINF = numeric_l... | 0 | 20,959,558 |
#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--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
stri... | 0 | 78,297,503 |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n;cin>>n;
for(;n--;)
{
double a,b,c,d,e,f,g,h;cin>>a>>b>>c>>d>>e>>f>>g>>h;
cout<<(abs((d-b)*(g-e)-(h-f)*(c-a))<1e-10?"YES":"NO")<<endl;
}
} | #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)... | 0 | 30,150,811 |
#include <bits/stdc++.h>
typedef long long lint;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
int main() {
int n,m; cin >> n >> m;
int ans = 0;
ans += (n*(n-1))/2;
ans += (m*(m-1))/2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <math.h>
int n,m,i,j,k,count1=0,count2=0;
using namespace std;
void ABC120(void);
void ABC121(void);
void ABC122(void);
void ABC123(void);
void ABC124(void);
void ABC125(void);
void ABC126(void);
void ABC127(void);
void ABC128(void);
void ABC129(void);
int main(void){
ABC124();
}
v... | 0 | 61,840,249 |
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<queue>
#include<stack>
#include<algorithm>
#include<string>
#include<math.h>
#include <iomanip>
#include <numeric>
#define _USE_MATH_DEFINES
using namespace std;
int main()
{
string s;cin>>s;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, ... | 0 | 76,238,231 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
if (b == 'A') {
cout << 'T' << endl;
}
if (b == 'T') {
cout << 'A' << endl;
}
if (b == 'C') {
cout << 'G' << endl;
}
if (b == 'G') {
cout << 'C' << endl;
}
return 0;
} | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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;
typedef long long ll;
typedef pair<int,int> P;
const static ll MOD = (1e+9)+7;
int main(){
ll N;cin>>N;
vector<ll> A(N);rep(i,N)cin>>A[i];
sort(A.begin(),A.... | 0 | 92,191,239 |
#include<bits/stdc++.h>
const int M=1e9+7;
const int N=2e6+5;
typedef long long int ll;
using namespace std;
ll cnt(0),sum(0),n,m,x,y,t,i,j,temp,k,ans(0),mn(M),mx(-9e9);
vector<ll> v[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
ll a[n+1];
for(i=1;i<=n;i++)
{
cin>>a[i];
}
... | #include <iostream>
using namespace std;
#include <stdio.h>
int main()
{
int x;
int i=0;
while (true) {
cin >> x;
if (x == 0){
break;
}
printf("Case %d: %d\n", ++i, x);
}
return 0;
} | 0 | 44,197,211 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
int main(... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx")
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <unordered_set>
#incl... | 0 | 33,260,205 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
sort(v.begin(),v.end(),greater<int>());
for(int i=0;i<min(n,k);i++){
v[i]=0;
}
long long int ans=0;
for(int i=0;i<n;i++){
ans+=v[i];
}
cout<<ans<<endl;
return 0;
} | #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 vout(x) {rep(a,x.size()) cout << x[a] << " "; cout << endl;}
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b... | 0 | 96,214,955 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
cin>>n;
ll ar[n*2];
for(int i=0;i<2*n;i++)
{
cin>>ar[i];
}
ll sum=0;
sort(ar,ar+(2*n));
for(int i=0;i<2*n;i+=2)
{
sum+=ar[i];
}
cout<<sum;
} | #include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
#define MAX_NUM (1000000007)
#define PI 3.14159265358979323846
using namespace std;
template <typename T>
static inline void ArrayInput(vector<T>& A) {
for (auto itr = A.begin(); itr < A.end(); ++itr) cin >>... | 0 | 95,597,776 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
string S,T;
cin>>S>>T;
int sal[26],tal[26];
for(int i=0;i<26;i++){
sal[i]=-1; tal[i]=-1;
}
int judge=0;
for(int i=0;i<S.size();i++){
int x=(char)S[i]-'a';
int y=(char)T[i]-'a';
if(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
int countBits(int in){
int res=0;
for(... | 0 | 38,577,946 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, A, B;
cin >> K >> A >> B;
bool flg = false;
for (int i = A; i <= B; i++) {
if (i % K == 0) {
cout << "OK";
return 0;
}
}
cout << "NG";
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int m,max,min,gap,maxgap,ans;
vector<int> score(201);
for(int i=0; i < 10001; i++){
cin >> m >> min >> max;
if(m == 0 && min == 0 && max == 0){
break;
}else{
for(int j=0; j < m; j++){
cin >> score.at(j);
}... | 0 | 67,239,571 |
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int N;
vector<ll> A;
vector<vector<int>> G;
ll dfs(int v, int p) {
vector<ll> edges;
for (int u : G[v]) {
if (u != p) {
l... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main() {
string s,t;
cin >> s >> t;
int x=s.size(), y=t.size(), res=-1;
rep(i,x){
if(s[i]==t[0] || s[i]=='?'){
... | 0 | 57,956,464 |
#include<iostream>
#include<string>
#include<vector>
#include<iomanip>
#include<algorithm>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
#define ll long long
int main(){
ll N;
cin >> N;
ll A[N];
ll i;
for(i=0;i<N;i... | #include <iostream>
int main()
{
int i = 1;
while (1)
{
int a;
std::cin >> a;
if (std::cin.eof()) {
break;
}
if (a != 0) {
std::cout << "Case " << i << ": " << a << std::endl;
i += 1;
}
}
return 0;
} | 0 | 29,616,759 |
#include<iostream>
#include<cctype>
using namespace std;
int main( ){
int a[127] = {};
char x;
while( cin >> x ){
if(isalpha(x))a[(int)x]++;
}
for(int j=97;j<123;j++){
cout<<(char)j<<" : "<<a[j-32]+a[j]<<endl;
}
return 0;
} | #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | 0 | 18,852,891 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1... | #include <iostream>
using namespace std;
int main()
{
int H, W;
while(true){
cin >> H >> W;
if(H==0&W==0) break;
else {
for(int i=0; i<H; i++){
for(int j=0; j<W; j++)cout << "#";
cout << endl;
}
cout << endl;
}
}
} | 0 | 67,046,400 |
#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;
int main() {
string s;
cin>>s;
if(s.size()<26){
vector<bool>ch(26);
rep(i,s.size()){
ch.at(s.at(i)-'a')=true;
}
char c;
rep(i,26){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
ll n,m;
cin >> n >> m;
map<ll,ll> mp;
for(ll i=0;i<m;i++){
ll a,b;
cin >> a >> b;
mp[a]++;
mp[b]++;
}
bool flag=true;
for(auto p:mp){
if(p.second%2==... | 0 | 21,366,186 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define inv(n, a) for(int i = 0; i < n; i++) cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
template<class T> inline bool chmi... | 0 | 65,972,374 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
vector<string> ans;
int main(){
while(1){
string str;
getline(cin,str);
if(str == ".")break;
vector<int> hmk;
vector<int> hkk;
bool balance = true;
for(int i = 0;i < str.size();i++){
if(!balance) break;
if(str[i] == '(') hmk... | #include <iostream>
#include <vector>
#include <set>
#include <deque>
#include <map>
#include <iomanip>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <utility>
using namespace std;
int ky[8] = {-1,1,-2,2,-2,2,-1,1};
int kx[8] = {-2,-2,-1,-1,1,1,2,2};
int dy[4] = {-... | 0 | 62,311,421 |
#include <bits/stdc++.h>
#define int long long
#define gcd __gcd
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *max_element
#define mine *min_element
#define inf ... | #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--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | 0 | 8,669,899 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include<iostream>
#include<queue>
#include<utility>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m,n){
int a,b,ans=0;
priority_queue< pair<int,int> > c;
for(int i=0;i<n;i++){
cin>>a>>b;
c.push(make_pair(b,a));
}
while(!c.empty()){
if(c.top().second>m){
c.pus... | 0 | 82,664,010 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N;
cin >> N;
cout << (N - 2) * 180 << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
ll deviding(ll n,ll m) {
ll ans = n / m;
if(n % m != 0) ans++;
return ans;
}
int main() {
int n;
cin >> n;
vector<int> c(n),s(n),f(n);
rep(i,n-1) {
cin >> c[i] >> s[... | 0 | 91,165,132 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define inv(n, a) for(int i = 0; i < n; i++) cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
template<class T> inline bool chmi... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rep2(i,s,t) for(int i = s; i <= t; ++i)
#def... | 0 | 70,741,821 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A.at(i);
vector<int> cnt(N+1);
vector<int64_t> comb(N+1);
for(int i=0; i<N; i++) cnt.at(A.at(i))++;
for(int i=0; i<N+1; i++){
int64_t cnti = cnt.at(i);
... | #include<stdio.h>
int main()
{
long long int i,j=0,h,n,s=0;
scanf("%lld%lld", &h,&n);
long long int a[n+5];
for(i=0;i<n;i++)
{
scanf("%lld", &a[i]);
}
for(i=0;i<n;i++)
{
s=s+a[i];
if(s>=h)
{
j=1;
break;
}
}
if(j==1)
... | 0 | 40,130,105 |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,m,ans,fa[N],sum[N];
inline int Find(int x)
{
if(x==fa[x]) return x;
return fa[x]=Find(fa[x]);
}
inline void Union(int x,int y)
{
x=Find(x),y=Find(y);
if(x!=y)
{
fa[y]=x;
sum[x]+=sum[y];
}
}
int main()
{
cin>>n>>m;
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;
class cSort
{
public:
void sort( int* arr, int len )
{
int mi, mx, z = 0; fi... | 0 | 2,418,008 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n, s;
int soi[10][101] = {};
soi[1][0] = 1;
for(int i=1; i<=9; i++){
for(int j=i; j>0; j--){
for(int k=0; k<=100; k++){
if(soi[j][k] != 0){
soi[j+1][k + i] += soi[j][k];
}
}
}
soi[1][i] = 1;
}
while(1){
cin >> n >... | #include<iostream>
#include<string>
using namespace std;
int main(){
long long a=100000;
int n;
cin>>n;
for(int i=0;i<n;i++){
a*=1.05;
if(a%1000==0)
a-=1000;
a/=1000;
a*=1000;
a+=1000;
}
cout<<a<<endl;
return 0;
} | 0 | 66,794,700 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int p, q, r;
cin >> p >> q>>r;
cout << (p+q+r) - max({p,q,r}) << endl;
} | #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... | 0 | 65,199,683 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string line;
int count[26];
for (int i = 0; i < 26; i++) {
count[i] = 0;
}
for (; getline(cin, line); ) {
for (int i = 0; i < line.length(); i++) {
if (isupper(line[i])) {
count[lin... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main () {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int now = 1000000000, cnt = 10;
int pow10[20];
pow10[0] = 1; for (int i = 1; i <= 13; ++i) pow10[i] = pow10[i - 1] * 10;
while(now) {
cout << "? " << now... | 0 | 33,283,710 |
#include <iostream>
#include <string>
int main(void) {
int n;
std::string s;
int count;
std::string now_status;
while (1) {
std::cin >> n;
if (n == 0) {
break;
}
count = 0;
now_status = "";
for (int i = 0; i < n; i++) {
std::cin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 18,850,204 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#def... | #include <iostream>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int k, n;
cin >> k >> n;
vector<int> a(n);
vector<int> dis(n);
rep(i, n) cin >> a.at(i);
dis.at(0) = a.at(0) + (k-a.at(n-1));
int total = dis.at(0);
int longest_dis = dis.at(0);
for(int i = 1; i ... | 0 | 75,200,664 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int>X(n+1);
vector<int>Y(m+1);
for(int i=0; i<n; i++){
cin >> X[i];
}
X[n]=x;
for(int i=0; i<m; i++){
cin >> Y[i];
}
Y[m]=y;... | #include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | 0 | 67,267,930 |
#include<bits/stdc++.h>
using namespace std;
int main() {
long long q, h, s, d; cin >> q >> h >> s >> d;
long long n; cin >> n;
long long res1, res2;
res1 = min({q * 4, h * 2, s}) * n;
res2 = n / 2 * d + min({q * 4, h * 2, s}) * (n % 2);
cout << min(res1, res2) << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
class DisjointSet{
public :
vector<int> rank,p;
DisjointSet(){}
DisjointSet(int size)
{
rank.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++)
makeSet(i);
}
... | 0 | 92,326,813 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define debug(x) cerr << #x << " = " << x << endl
int main(int qtd, char* nome[])
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, l;
cin >> n >> l;
string s[n];
for(int i=0; i<n; i++)
cin >> s[i];
sort(s, s+n);
for(int i=0; i<n; i++)
cout ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 84,863,299 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int r;
cin >> r;
if (r < 1200) {
cout << "ABC";
} else if (r < 2800) {
cout << "ARC";
} else {
cout << "AGC";
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1... | 0 | 63,736,129 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
int x[110];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
for(int i=0;i<n;i++)cin>>x[i];
int ans=INF;
for(int i=1;i<=100;i++)
{
int sum=0;
for(int j=0;j<n;j++)sum+=(x[j]-i)*(x[j]-i);
... | #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 ... | 0 | 37,438,253 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string S;
cin>>S;
int check=0;
for(int i=0;i<(S.size()-1)/2+1;i++){
if(S[i]==S[(S.size()-1)/2+1+i]){
check++;
}
}
if(check==(S.size()-1)/2){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<en... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> P;
typedef pair<lint, lint> Plint;
const int MOD = 1e9+7;
const int INF = 1<<18;
const lint INFLINT = 1LL<<60;
const double PI=acos(-1.0);
#define endl "\n"
struct ci... | 0 | 64,890,645 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
int a[n];
for (int i = 0; i < n; ++i)
{
cin>>a[i];
}
int cnt=0,ans=0;
for (int i = 0; i < n-1; ++i)
{
if (a[i]==a[i+1])
{
++cnt;
}
else
{
ans+=(cnt+1)/2;
cnt=0;
}
}
ans+=(cnt+1)/2;
co... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | 0 | 52,959,470 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<char>>a(n,vector<char>(n));
vector<vector<char>>b(m,vector<char>(m));
for(int i=0;i<n;i++)for(int j=0;j<n;j++)cin>>a[i][j];
for(int i=0;i<m;i++)for(int j=0;j<m;j++)cin>>b[i][j];
for(int i=0;i+m<=n;i++)... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF =... | 0 | 18,388,768 |
#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++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) ... | #include <iostream>
#include <stdio.h>
void cs(int k);
int A[2000001];
int B[2000001];
int n;
main(){
int i,k=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&A[i]);
if(A[i]>k) k=A[i];
}
cs(k);
for(i=1;i<=n;i++){
printf("%d",B[i]);
if(i!=n) printf(" ");
}
printf("\n");
return 0;
}
voi... | 0 | 18,467,638 |
#include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i,k,n) for (ll i = k; i <= (ll)(n); ++i)
#define MAX 500010
#define MOD 1000000007
typedef long long ll;
using namespace std;
ll ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
rep(i,S.size()){
... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int N;
vector<int> A;
cin >> N;
for (int i = 0; i < N; ++i){
int a;
cin >> a;
A.push_back(a);
}
int M = A[0];
int m = A[0];
for (int i = 0; i < N; ++i)
{
if(A[i] >... | 0 | 99,253,894 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int N, T;
cin >> N >> T;
vector<int> t(N);
rep(i, N) {
cin >> t[i];
}
long long sum... | #include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
long long mod = 998244353;
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
re... | 0 | 85,608,991 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
long long n, p;
string s;
cin >> n >> p >> s;
long long res = 0;
if (p == 2 || p == 5) {
for (int i = n - 1; i >= 0; i--) {
if ((s[i] - '0') % p == 0) {
res += i + 1;
}
}
} else {
map<int, ... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 10000000000;
... | 0 | 52,855,152 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int a[101] = { 0 };
int k;
int mex = 0;
while (cin >> k) {
a[k]++;
if (mex < a[k]) {
mex = a[k];
}
}
for (int i = 1; i <= 100; i++) {
if (a[i] == mex) {
cout << i << endl;
}
}
return 0;
} | #include <iostream>
#include <climits>
using namespace std;
int main(){
int n, a;
long sum = 0; int max = INT_MIN; int min = INT_MAX;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a;
sum += a;
if(max < a){
max = a;
}
if(min > a){
min = a;
}
}
cout << min << " " << max << " " << sum << endl;
retu... | 0 | 56,559,596 |
#include<stdio.h>
int main(){
char C;
scanf("%c", &C);
printf("%c", C + 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a,b,p;
cin>>n>>a>>b;
std::deque<int> deq;
for (int i=0;i<n;i++) {
cin>>p;
deq.emplace_back(p);
}
sort(deq.begin(),deq.end());
int count1=0,count2=0,count3=0;
for (int i=0;i<n;i++) {
if (deq[i]<=a)... | 0 | 50,971,448 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<1ll*(n-2)*180<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll zero = 0;
const ll INF = 3000000000000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
ll X,Y;
cin >> X >> Y;
if( (X+Y) % 3 != 0 ){
printf("0\n");
return 0;
}
ll d = (X + Y) / 3;
... | 0 | 51,646,802 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const int MAX = 10000;
static const ll INFTY = 1e12;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 0 | 14,660,776 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int h,w;
vector<string> a;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin>>h>>w;
a.resize(h);
rep(i,h)cin>>a[i];
vector<vector<int>>dist(h,vector<int>(w,-1));
us... | #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<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include<cstdio>
using namespace std;
#... | 0 | 5,161,003 |
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define REPI(_i,len) for(int _i=0;_i<len;++_i)
#define REPI2(_i,_l,len) for(int _i=0,_l=len;_i<_l;++_i)
#define VREP(v,_itr,_end) for(auto _itr=v.begin(),_end=v.end();_itr!=_end;++_itr)
#define VCREP(v,_itr,_end) for(auto _itr=v.cbegin()... | #include<iostream>
#include<set>
#include<vector>
using namespace std;
int gcd(int a,int b){
if(b==0)
return a;
return gcd(b,a%b);
}
int main(){
int n,x;
cin>>n>>x;
set<int>st;
for(int i=0;i<n;i++)
{
int element;
cin>>element;
st.insert(element);
}
st.inse... | 0 | 89,328,140 |
#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 vvin=vector<vin>;
usin... | #include <bits/stdc++.h>
using namespace std;
bool done = false;
void calc(int sum, string Sl, string Sr){
if (!done){
if (Sr.size() == 1){
if (sum + stoll(Sr) == 7){
cout << Sl << "+" << Sr << "=7" << endl;
done = true;
} else if (sum - stoll(Sr) == 7){
cout << Sl << "-" << Sr... | 0 | 81,701,650 |
#include <stdio.h>
#include <algorithm>
#include <numeric>
using namespace std;
int a;
int b;
void solve() {
if (a < b) {
for (int i=0;i<b;i++) {
printf("%d", a);
}
} else {
for (int i=0;i<a;i++) {
printf("%d", b);
}
}
printf("\n");
}
int main() {
... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,double> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( ... | 0 | 11,100,743 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define MAXX 10005
#define PI 3.14159265358979323846264338327950
#define F first
#define S second
#define ll long long int
#define mod 1000000007
int main()
{
FAST;
ll n;
cin >> n;
string s;
cin >> ... | 0 | 83,190,686 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<string> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (w[i] == w[j]) {
cout << "No" << endl;
return 0;
}
}
}
for... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | 0 | 39,775,451 |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
int n, x, t;
int ans;
cin >> n >> x >> t;
ans = n / x;
if(n%x != 0) ans++;
ans *= t;
cout << ans << endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<utility>
#include<cstring>
#include<queue>
#define maxn 100000
using namespace std;
int dist[maxn+5];
bool inq[maxn+5];
vector<pair<int,int> >E[maxn+5];
inline void add_edge(int u,int v,int w){
E[u].push_back(make_pair(v,w));
}
int spfa... | 0 | 31,353,283 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
... | #include <stdio.h>
int main (){
char str[1210];
int alpha[40] = {};
for(int i=0; scanf("%c",&str[i]) != EOF; i++){
for(int j = 65;j<=90;j++){
if(str[i] == j || str[i] == j + 32){
alpha[j-65] += 1;
}
}
}
for(int k = 0; k <= 25; k++){
pri... | 0 | 23,220,850 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const int N = 1e5 + 100;
ll n, d[N], cnt[N], dp[N];
vector<int> nei[N];
vector<pll> vec, ans;
bool no_homo;
unordered_map<ll, int> v_d;
void dfs(int v, int par = -1) {
for (int u: nei[v])
if(u != par) {
dfs(u, v);
dp[... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 0 | 36,232,860 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector <string> vs;
#define forl(i,a,b) for (int i = a; i < b; i++)
#define rfor(i,b,a) for (int i = b; i >= a; i--)
#define f first
#define s second
#define pb p... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 70,959,078 |
#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() {
ll ans = 0;
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
rep(i, N) {
ans += min(A[i], B[i]);
... | bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | 0 | 25,170,961 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
using ll = long long;
int main() {
string s;
cin >> s;
int n = s.size();
ll sum = 0, ans = 0;
vector<ll>v(n+1, 0);
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector <int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> dp(k + 1);
dp[0] ... | 0 | 51,741,176 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a , b;
cin >> a >> b;
if ( a == 1 ) a = 14;
if ( b =... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ll long long
#define P pair<int,int>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int MOD = 1000000007;
const int INF = 2002002002;
const ll LLINF = 9009009009009009009;
using namespace std;
int main() {
... | 0 | 18,141,791 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n,m;
cin>>n>>m;
cout << n*(n-1)/2+m*(m-1)/2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i,n,init) for(ll i=init;i<(n);i++)
#define ll long long
bool pairCompare(const pair<int, int> & f, const pair<int, int> & s)
{
return f.first < s.first;
}
int main()
{
int ans;
string s;
cin >>... | 0 | 31,017,628 |
#include <bits/stdc++.h>
#define LL long long
#define ll long long
#define SL(n) scanf("%lld",&n)
#define LF double
#define SF(n) scanf("%lf",&n)
#define pb push_back
#define mp make_pair
#define ON(n,i) (n|(1LL<<i))
#define OF... | #include <cstdio>
#include <iostream>
#include <complex>
#define rep(i,n) for(int i=0; i<(n); i++)
#define EPS 1e-10
using namespace std;
typedef complex<double> cd;
double s(cd a, cd b){
return abs( a.real()*b.imag()-a.imag()*b.real() );
}
int main(){
cd a[4];
double x1, y1, x2, y2, x3, y3, xp, yp;
while(scanf... | 0 | 42,395,056 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n, m, h[100000], a[100000], b[100000];
bool good[100000];
cin >> n >> m;
for(int i=0; i<n; i++){
cin >> h[i];
good[i] = true;
}
for(int i=0; i<m; i++){
cin >> a[i] >> b[i];
}
int answe... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
long long int n, m, v1, v2;
cin >> n >> m;
long long int l[m], r[m];
for (long long int i = 0; i < m; i++)
{
cin >> l[i] >> r[i];
}
v1 = l[0];
v2 = r[0];
for (long long int i = 1; i < m; i++)
{
... | 0 | 57,478,350 |
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N=100005;
const int inf=2000000000;
struct E{
int to,next;
}mem[N<<1];
int n,x,y,num;
int head[N],dp[N];
void add(int x,int y){
num++;
mem[num].to=y; mem[num].next=head[x];
head... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 0 | 2,310,322 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int index(vector<int> d, int x) {
rep(i, d.size()) {
if(d[i] >= x)
return i;
}
return -1;
}
int main() {
int n, ans = 0;
cin >> n;
vector<int> d(n);
int half... | #include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#... | 0 | 85,880,266 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M, E = 0;
cin >> N >> M;
int64_t t = 1900 * M + 100 * (N - M);
cout << t * pow(2, M) << endl;
} | #include "bits/stdc++.h"
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#define min3(x, y, z) min(x, min(y, z))
#ifdef _MSC_FULL_VER
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" <... | 0 | 9,206,410 |
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#define M 1010
#define N 1000000
#define D double
#define LL long long
using namespace std;
LL a,b,c,d,sum;
LL max(LL x,LL y)
{
if(x>y) return x;
else return y;
}
LL maxx(LL x,LL y,LL z,LL k)
{
LL ss=max(max... | #include<iostream>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstring>
#include<climits>
#include<deque>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ... | 0 | 16,090,511 |
#include <iostream>
#include <algorithm>
#include <queue>
#include <cassert>
#include <set>
using namespace std; typedef long long ll; const int MINF=-1e9; typedef pair<int,int> P;
int main() {
int n; cin>>n;
int b[n], mx=0; fill(b,b+n,0);
for(int i=0;i<n;i++) {
int a; cin>>a; b[a]++;
mx=max(mx,a);
}
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 90,473,151 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int m=1e9+7;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fastio
int ar[3];
for(in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, k;
cin >> a >> b >> k;
vector<int> ans;
for (int i = 0; i < 100; i++){
if (a % (i + 1) == 0 && b % (i + 1) == 0){
ans.push_back(i + 1);
}
}
reverse(ans.begin(), ans.end());
cout << ans.at(k - 1) ... | 0 | 3,382,375 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int n,a;
cin >> n >> a;
if(n%500 <= a) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 45,864,407 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
string A, B;
cin >> A >> B;
if (A.size() < B.size()) {
printf("LESS\n");
} else if (A.size() > B.size()) {
printf("GREATER\n");
} else {
for (int i = 0; i < A.size(); i++) {
if (A[i] < B[i]) {
... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
using namespace std;
typedef pair<long long, long long> P;
int main(){
int N, M;
cin >> N >> M;
vector<P> C(N);
for(int i = 0; i < N; i++) {
long long a, b;
cin >> a >> b;
C[i] = P(a, b... | 0 | 81,556,817 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define pb push_back
#define fr first
#define sc second
int main(){
string s;
cin >> s;
map<int,int> M;
int sum = 0;
M.insert(P(0,... | #include <bits/stdc++.h>
#include <fstream>
#include <string>
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 ll long long
int main() {
vector<int> a(5);
rep(i, 5) cin >> a[i];
int maxmod = 0;
int maxi = 0;... | 0 | 16,764,522 |
#include <bits/stdc++.h>
#define FI first
#define SE second
#define PB push_back
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
#define co(i) cout<<(i)<<endl
#define fcout cout<<f... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<double> x(n);
... | 0 | 16,792,318 |
#include <iostream>
#include <string>
#include <vector>
int main(int argc, char const *argv[]) {
int q;
std::cin >> q;
for (size_t _ = 0; _ < q; _++) {
std::string x, y;
std::cin >> x;
std::cin >> y;
std::vector<std::vector<int> > dp(x.size()+1, std::vector<int>(y.size()+1));
for (size_t ii=0;... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<en... | 0 | 16,103,805 |
#include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <vector>
using namespace std;
#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++)
int main() {
int n, i = 0,ans=1,m;
cin >> n;
vector <int>a(n),k(10000... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
if (S[0] != 'A')
{
cout << "WA" << endl;
return 0;
}
else
S[0] = 'a';
if (count(S.begin() + 2, S.end() - 1, 'C') != 1)
{
cout << "WA" << endl;
return 0;
}
else
... | 0 | 72,463,376 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<iomanip>
#include<map>
#include<deque>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define erep(i, n) for (int i = 0; i <= (int)(n); i++)
using p = pair<int, int>;
int main() {
strin... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int lcs(string& a, string& b)
{
vector<vector<int>> dp(a.size() + 1, vector<int>(b.size() + 1, 0));
for (size_t i = 1; i < dp.size(); ++i)
{
for (size_t j = 1; j < dp[0].size(); ++j)
{
... | 0 | 91,740,763 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.