code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <algorithm>
#include <stdio.h>
#include <bitset>
#include <limits.h>
#include <complex>
#include <deque>
#include <iomanip>
using namespace std;
#define ... | 1 | 3,615,257 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
const ll mod = 1000000007;
int main() {
int n,m; cin >> n >> m;
int a,b;
priority_queue<int, vector<int>, less<int>> pq;
vector<pair<int, int>> t;
rep(i,n) {
cin >> a >> b;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> J(100001);
for (int a, b; cin >> a >> b;) J.at(a).push_back(b);
priority_queue<int> Q;
int ans = 0;
for (int i = 1; i <= M; i++) {
for (auto j : J.at(i)) Q.push(j);
if (Q.size()) ans += Q.top(),... | 1 | 70,676,008 |
#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | #include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>>n ;
string s;
cin>>s ;
if(s.length()>n){
string t=s.substr(0,n) ;
t=t+"..." ;
cout<<t ;
}
else
{
cout<<s ;
}
}
int main(){
int y ;
y=1 ;
while(y--)
{
solve() ;
}
} | 1 | 42,562,723 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
ll root = sqrt(n);
ll x = root;
while(true){
if(n % x == 0) break;
x--;
}
ll other = n / x;
cout << x + other - 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long res = n - 1;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0)
res = min(res, i + n / i - 2);
}
cout << res << '\n';
return 0;
} | 1 | 78,547,069 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1000000009
#define LINF 1000000000000000009
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define l... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 1 | 87,166,667 |
#include <iostream>
#include<cstdio>
using namespace std;
int main(void){
int a, b;
scanf("%d %d", &a, &b);
printf("%d %d %.5lf\n", a / b, a % b, (double)a / (double)b);
} | #include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << int(a/b) << " " << (a % b) << " " << fixed << (double)a / (double)b << endl;
return 0;
} | 1 | 38,767,913 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VP vector<pair<int,int>>
#define VPP vector<pair<int,pair<int,int>>>
#define VLL ... | #include <iostream>
#include <map>
#include <vector>
#define lli long long int
using namespace std ;
int main(int argc, char const *argv[])
{
int n ;
cin>>n ;
lli ans = 0 ;
int carry ;
for(int i = 0 ; i < n ; i++)
{
int temp ;
cin>>temp ;
if(i == 0)
{
carry = 1 ;
if(temp == 1) ;
else
{
an... | 1 | 65,487,965 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
while(cin>>str,str!="#"){
int ans=-1;
for(int i=0,now=2,num=0;i<str.size();i++){
if(str[i]>103&&str[i]<113||str[i]==117||str[i]==121)num=1;
else num=0;
if(now!=1&&num==1){
ans++;
now=1;
}
else if(now!=0&&num==0){
ans... | #include <iostream>
#include <string>
#include <set>
using namespace std;
string s_lefthand = "qwertasdfgzxcvb";
set<char> lefthand(s_lefthand.begin(), s_lefthand.end());
int main () {
string line;
while (cin >> line, line != "#") {
bool prehand = (lefthand.find(line[0]) != lefthand.end());
int count = 0;
for (... | 1 | 19,638,734 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | 1 | 92,796,970 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9+7
typedef long long int ll;
const int maxn = 1000000;
ll mod = INF;
int main(){
int n;
string s;
cin >> n;
cin >> s;
ll ans=0;
map<ll,ll> m;
for(int i=0;i<(int)s.size();i++){
int num=(int)s[i]-(int)'a';
m[num]++;
... | #include <bits/stdc++.h>
#define MOD 1000000007;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main()
{
ll n;
string s;
cin >> n >> s;
unordered_map<char, ll> M;
rep(i, s.size())
M[s.at(i... | 1 | 60,240,327 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> is_prime(999999+1,true);
void init_prime() {
is_prime[0] = is_prime[1] = false;
for(int i=2; i<=999999; i++) {
if(is_prime[i]) {
for(int j=i*2; j<=999999; j+=i)
is_prime[j] = false;
}
}
}
int table[1000000] = {0};
int ma... | #include <cstdio>
#include <cstring>
const int MAX_n = 999999;
bool isPrime[MAX_n+1];
int sum[MAX_n+1];
int main()
{
memset(isPrime,true,sizeof(isPrime));
for(int i = 2; 2*i <= MAX_n ; ++i)
if(isPrime[i])
for(int j = 2*i; j <= MAX_n; j+=i)
isPrime[j] = false;
isPrime[0] =... | 1 | 52,960,817 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
char c;
cin >> c;
cout << (char)((int)c + 1);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
char x;
cin>>x;
if(int(x)>=97&&int(x)<=122&&x!='z'){
cout<<char(int(x)+1)<<endl;
}
return 0;} | 1 | 5,063,855 |
#include <bits/stdc++.h>
using namespace std;
#define INPUT freopen("input.txt", "r", stdin);
#define ll long long
#define ld long double
#define len(s) s.size()
#define fl(st, en, in) for (int i = st; i < en; i += in)
#define rfl(st, en, de) for (int i = st; i < en; i -= de)
#define fll fl(0, n, 1)
#define cy cout << ... | #include <stdio.h>
long long n, k, s, x, z, y, m, b, l;
long long p[5000];
long long c[5000];
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", p + i);
p[i]--;
}
for (int i = 0; i < n; i++) {
scanf("%lld", c + i);
}
m = -1000000000;
for (int i = 0; i < n; i++) {
s = i;
... | 1 | 1,171,522 |
#include <cstdio>
using namespace std;
int main(void)
{
int n;
long long sum = 1;
scanf("%d",&n);
for(int f1 = 1; f1 <= n; f1++){
sum *= f1;
}
printf("%lld\n", sum);
return 0;
} | #include<iostream>
using namespace std;
int main()
{
long int i,n,a;
while(cin>>n)
{
a=1;
for(i=n;i>=1;i--)
{
a=a*i;
}
cout<<a<<endl;
}
return 0;
} | 1 | 85,400,792 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | #include <iostream>
int main(void){
long long A, B, C, K, ans;
std::cin >> A >> B >> C >> K;
if (K % 2 == 0) ans = A - B;
else ans = B - A;
std::cout << ans << std::endl;
return 0;
} | 1 | 36,991,304 |
#include <iostream>
using namespace std;
#define NORMAL 195;
#define URU 200;
int main(){
int n, y, m, d;
int uru, small;
int days;
cin >> n;
for(int i=0;i<n;++i){
days = 0;
cin >> y >> m >> d;
uru = 999/3 - y/3;
days += uru * URU;
days += (999-y-uru) * NORMAL... | #include <iostream>
using namespace std;
int main(){
int n;
int y,m,d;
int yy,mm,dd;
cin >> n;
for(int i=0;i<n;i++){
cin >> y >> m >> d;
yy = 1000;
mm = 1;
dd = 1;
while(yy-1 != y){
if((yy-1)%3 == 0){
dd += 200;
}else{
... | 1 | 3,773,065 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
string substrBack(string str, size_t pos, size_t len) {
const size_t strLen = str.length();
return str.substr(strLen - pos, len);
}
int main(void) {
string s;
string t;
cin >> s >> t;
for (int i = 0; i < s.length(); i++) {
if (s[i] == ... | 1 | 62,699,120 |
#include<bits/stdc++.h>
int main()
{
int n;
std::cin >> n;
std::vector<int> a(n);
std::map<int,int> map;
for(int i = 0; i < n; i++)std::cin >> a[i];
for(int i = 0; i < n; i++)map[a[i]]++;
for(auto& i : map)while(i.second >= 3)i.second -= 2;
int res = 0;
int cnt = 0;
for(auto i :... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define sz(x) (int)x.size()
#defi... | 1 | 8,971,448 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n,m; cin>>n>>m;
vector<s... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | 1 | 94,904,109 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD... | #include <algorithm>
#include <cstdio>
#define N 100005
using namespace std;
typedef long long ll;
ll n,m,v,p,a[N],ans,sum[N];
int main()
{
scanf("%lld%lld%lld%lld",&n,&m,&v,&p);
for(ll i=1;i<=n;i++){
scanf("%lld",&a[i]);
}ans=p;sort(a+1,a+1+n);
for(ll i=1;i<=n;i++){
sum[i]=sum[i-1]+a[i];
}
for(ll i... | 1 | 45,917,220 |
#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()
{
int a[3];
map<int,int> mp;
rep(i,3){
cin >> a[i];
mp[a[i]]++;
}
sort(a, a+3);
co... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long a,b,c,d,r,f;
cin>>a>>b>>c;
if(a!=b && b!=c && c!=a) cout<<"3"<<endl;
else if((a==b&&b!=c)||(b==c&&c!=a)||(c==a&&a!=b))cout<<"2"<<endl;
else cout<<"1"<<endl;
return 0;
} | 1 | 92,126,737 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=999999999;
int main() {
int N;
cin>>N;
int x=800*N;
int y=N/15*200;
cout<<x-y<<endl;
return 0;} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int N;
cin>>N;
... | 1 | 11,415,584 |
#include<iostream>
using namespace std;
int main()
{
int x,y;
cin >> x >> y ;
if(x>y) cout << "a > b";
if(x<y) cout << "a < b";
if(x==y) cout << "a == b";
cout << endl;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a < b) {
printf("a < b");
} else if (a > b) {
printf("a > b");
} else {
printf("a == b");
}
printf("\n");
return 0;
} | 1 | 1,288,483 |
#include<bits/stdc++.h>
#define maxn 100005
#define ll long long
using namespace std;
int k;
int dis[maxn];
struct edge
{
int v,w;
edge(int v=0,int w=0):v(v),w(w){}
};
vector<edge>adj[maxn];
bool vis[maxn];
void bfs()
{
queue<int>q;
memset(dis,0x3f,sizeof(dis));
dis[1]=1;vis[1]=true;
q.push(1);
int u,v,w;
while... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | 1 | 75,587,043 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 15) cout << "+" << endl;
else if (a * b == 15) cout << "*" << endl;
else cout << "x" << endl;
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef lo... | 1 | 37,020,022 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string l = "yuiophjklnm";
while(1) {
string s;
cin >> s;
if(s == "#") break;
int ans = 0;
bool r = false;
for(int i = 0; i < s.size(); i++) {
bool flag = false;
for(int j = 0; j < l.size();... | #include<iostream>
#include<string>
using namespace std;
int main(){
for(;;){
string word;
int hand = 0, sum = 0;
getline(cin,word);
if(word == "#"){break;}
for(int i=0; i<word.size(); i++){
int flag = 2;
if(word[i] == 'q'){flag = 1;}
if(word[i] == 'w'){flag = 1;}
if(word[i] == 'e'){flag = 1;}
... | 1 | 93,968,980 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <iomanip>
#include<string>
using namespace std... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for (... | 1 | 18,489,112 |
#include <iostream>
using namespace std;
void solve()
{
int a[3];
for (int i = 0; i < 3; ++i)
{
cin >> a[i];
}
for (int i = 0; i < 3; ++i)
{
for (int j = i + 1; j < 3; ++j)
{
if (a[j] < a[i])
{
int temp = a[j];
a[j] = a[i];
a[i] = temp;
}
}
}
for (int i = 0; i < 2; ++i)
{
cout <<... | #include <iostream>
using namespace std;
int main() {
int input[3];
cin >> input[0] >> input[1] >> input[2];
int tmp;
if(input[0] > input[1]) {
tmp = input[1];
input[1] = input[0];
input[0] = tmp;
}
if(input[2] < input[0]) {
tmp = input[0];
input[0] = input[2];
input[2] = tmp;
} ... | 1 | 22,761,771 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int p,... | 1 | 67,601,662 |
#include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, p;
cin >> s >> p;
s = s + s.substr(0, p.size());
if (s.find(p) != string::npos)
cout << "Yes\n";
else
cout << "No\n";
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, p;
string::size_type index;
cin >> s;
cin >> p;
s += s;
index = s.find(p);
if (index == string::npos) {
cout << "No" << endl;
}
else {
cout << "Yes" << endl;
}
return 0;
} | 1 | 89,653,989 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#... | 1 | 94,173,478 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e+9;
int main(){
ll n;
cin >> n;
int ans = INF;
for(ll i = 1; i * i <= n; i++){
if(n % i == 0){
ans = min(ans, (int)to_string(n / i).size());
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int Decimal(int N){
int num=0;
while(N!=0){
N=N/10;
num++;
}
return num;
}
int main(){
long N;
long B=1;
cin >> N;
int ans=Decimal(N);
for (long A=2;A*A<=N;A++){
if(N%A == 0){
B = N/A;
if(ans >Decimal(B))ans = Decimal(B);
}
... | 1 | 33,264,435 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
const ll M = 1e9+7;
int n; string s;
cin >> n >> s;
map<char,ll> c;
rep(i,n) {
c[s[i]]++;
}
ll a... | 1 | 70,368,667 |
#include <iostream>
using namespace std;
int a[45];
int n;
int main()
{
cin>>n;
int i;
for(i=0;i<=n;i++){
if(i==0||i==1)a[i]=1;
else{
a[i]=a[i-1]+a[i-2];
}
}
cout<<a[n]<<endl;
return 0;
} | #include <iostream>
#define MAX 45
using namespace std;
int f[MAX];
int fib(int n){
if(n==0||n==1) return f[n]=1;
if(f[n] != -1) return f[n];
return f[n]=fib(n-1)+fib(n-2);
}
int main(){
int n; cin >> n;
for(int i=0;i<=n;i++) f[i]=-1;
cout << fib(n) << endl;
} | 1 | 29,429,378 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int r, g, b, n; cin >> r >> g >> b >> n;
ll ans = 0;
rep(i,n/r+1) {
rep(j,n/g+1) {
int sum = i*r +... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#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 (1e-7)
#define gearup ios_base::sync_with_st... | 1 | 43,799,647 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0)
#define endl "\n";
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define int long long
const int MOD=1e9+7;
const int N=3e5+10;
int32_t main()
{
IOS;
int n;
cin>>n;
cou... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
int n;
while(cin >> n){
n--;
cout << (int)(n*(n+1LL))/2LL << "\n";
}
return 0;
} | 1 | 43,763,485 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using... | #include <bits/stdc++.h>
#define LL long long
#define VI vector<int>
#define VB vector<bool>
#define VL vector<long long>
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(),... | 1 | 83,624,048 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep... | #include<stdio.h>
#include<math.h>
void divide(int n,double x1, double y1,double x2, double y2){
if(n==0){
if((x1==0&&y1==0)||(x1==100&&y1==0))
printf("%.8lf %.8lf\n",x1,y1);
printf("%.8lf %.8lf\n",x2,y2);
return;
}
double th=M_PI*60.0/180.0;
double sx=(2.0*x1+1.0*x2)/3.0;
double sy=(2.0*y1+1.0*y2)/3.0... | 1 | 60,444,228 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int... | 1 | 33,910,721 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, X;
cin >> N >> X;
ll ans = 0, a, b;
ans += X;
a = N, b = N - X;
while ( b > 0 ) {
ans += ( 1 + (a - b) / b * 2) * b + a % b;
if ( a % b == 0 ) ans -= b;
ll t = a % b;
a = b;
... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore(i,a) fo... | 1 | 36,914,556 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int n,k;
cin>>n>>k;
vector<int> arr(n),dp(n);
for(int i=0;i<n;i++)
cin>>arr[i];
dp[0]=0;
for(int i=1;i<n;i++){
dp[i]=INT_MAX;
for(int j=max(0,i-k);j<i;j++)
dp[i]=min(dp[i],dp[j]+a... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
#define bitcnt(v) __builtin_popcount(v)
#define all(v) v.... | 1 | 96,499,686 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <iostream>
using namespace std;
int main(){
int a,b,h;
cin>>a>>b>>h;
if(a==b&&b==h) cout<<1;
else if(a==b||b==h||h==a) cout<<2;
else cout<<3;
} | 1 | 81,088,601 |
#include <iostream>
#include <algorithm>
using namespace std;
int ssort(int *A, int N) {
auto cnt = 0;
for (int i = 0; i < N; i++) {
auto mini = i;
for (int j = i + 1; j < N; j++) {
if (A[mini] > A[j]) mini = j;
}
if (mini != i) {
int temp;
temp = A[i];
A[i] = A[mini];
... | #include<stdio.h>
int main(){
int n, array[100], i, j, tmp, min, count=0;
scanf("%d", &n);
for(i=0;i<=n-1;i++)scanf("%d",&array[i]);
for(i=0;i<=n-1;i++){
min = i;
for(j=i;j<=n-1;j++)if(array[j]<array[min])min=j;
if(min!=i){
tmp = array[i];
array[i] = array[min];
array[min] = tmp;
... | 1 | 81,571,580 |
#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() {
int n;
cin>>n;
bool a=0;
rep(i,30){
rep(j,30){
if(i*4 + j*7 == n){
a=1;
}
}
}
if(a){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,t;
cin >> N;
int c = 0;
for(int a = 0;a < 26;++a) {
for(int b = 0;b < 15;++b) {
t = 4*a + 7*b;
if(N == t) {
++c;
}
}
}
if(c >= 1) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | 1 | 100,849,687 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
vector<ll>vec(3);
ll a=0;
for(ll i=0;i<3;i++){
cin>>vec.at(i);
a+=vec.at(i);
}
sort(vec.begin(),vec.end());
cout<<a-vec.at(2)<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main( void )
{
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - max( { p, q, r } ) << endl;
return 0;
} | 1 | 51,568,941 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int mod... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n+5][3];
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
cin>>a[i][j];
}
}
int dp[3][n+1];
memset(dp,0,sizeof(dp));
for(int i=0;i<3;i++){
dp[i][0]=a[0][i];
}
for(int i=1;i<n;i++){
dp[0][i]=max(dp[1][i-1],dp[2][i-1])+a[i][0];
... | 1 | 67,034,731 |
#include<bits/stdc++.h>
#include <numeric>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
string s;
cin >> s;
int r = 0, b = 0;
rep(i, s.leng... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
string S;
cin >> S;
int size = (int)S.size();
vector<int> flags(size, 0);
int pre_val = S[0] - '0';
int pre_index = 0;
int i=1;
while(i < size){
int val = S[i] - '0';
if(val == pr... | 1 | 92,866,781 |
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
using namespace std;
typedef long long int ll;
int main(){
cin.sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
string st;
cin >> s... | #include <stdio.h>
int main(){
int N;
char S[N];
scanf("%d", &N);
scanf("%s", S);
int yes = 0, no = 0;
if(N % 2 == 0){
for(int i = 0; i < (N / 2); i++){
if(S[i] == S[i + (N / 2)]){
yes++;
}else{
no++;
}
}
if(yes == N / 2){
printf("Yes");
}else{
printf("No");
}
}else{
printf("No... | 1 | 53,365,107 |
#include<stdio.h>
int main(){
int a, b, c, d, e;
scanf("%d %d", &a, &b);
c=a*3;
d=b+c;
e=d/2;
if(d-1==0){
printf ("0");
}
else{
printf("%d", e);
}
return 0;
} | #include <stdio.h>
int main()
{
int A, P, AP;
scanf("%d %d", &A, &P);
A = A*3;
P = P+A;
AP = P/2;
printf("%d", AP);
return 0;
} | 1 | 13,855,442 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
#define MOD 998244353
#define INF 1<<30
#define LINF (ll)1<<62
#define MAX 510000
#define rep(i,n) for(ll i=0; i<(n); i++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll h, w;
cin >> h >> w;
ll ans = h * w;
for (int i = 0; i < 2; i++) {
for (int a = 1; a < h; a++) {
ll b = h - a;
ll c = b / 2;
ll s1 = a * w;
ll s2 = (b - c) * w;
... | 1 | 2,433,437 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
typedef long long llong;
using namespace std;
int main() {
char s[210];
char p[210];
fgets(s, 110, stdin);
fgets(p, 110, stdin);
s[strlen(s)-1] = '\0';
p[strlen(p) - 1] = '\0';
char dummy[210];
strc... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string line;
string line2;
getline(cin, line);
getline(cin, line2);
line += line;
string::size_type pos = line.find(line2);
if (pos != string::npos)
{
cout << "Yes\n";
}
else
{
cout << "No\n";
}
return 0;
} | 1 | 61,886,702 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) ... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | 1 | 40,463,059 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
vector<int> A(N,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
int ans = 0;
int now = 0;
for(int i = 0; i < N - 1; i++) {
if(A.at(i) >= A.at(i + 1)) {
now... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int n;
cin>>n;
vector<int> h(n);
rep(i,n) cin>>h[i];
int cnt=0;
int maxv=0;
rep(i,n-1){
if(h[i]>=h[i+1]) cnt++;
else{
maxv=max(maxv,cnt);
... | 1 | 931,154 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n, r;
cin >> n >> r;
if(n>=10){
cout << r << endl;
}
else{
cout << r + 1000 - 100*n ... | #include <bits/stdc++.h>
using namespace std;
#define froop1(a,n) for(int i = a;i < n;i++)
#define froop2(a,n) for(int i = a;i > n;i--)
#define ll long long
#define pq(name,type) priority_queue<type> name
#define vec(name,type,length,value) vector<type> name(length,value)
#define vec2(name,type,length,width,value) vect... | 1 | 20,689,075 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef... | 1 | 9,847,098 |
#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>
using namespace std;
int main() {
int a, b; cin >> a >> b; a *= b;
if (a & 1) cout << "Odd" << endl;
else cout << "Even" << endl;
return 0;
} | 1 | 13,984,828 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int i, count;
string str;
string data = "yuiophjklnm";
string::iterator iter1, iter2;
while(1){
cin >> str;
if(str == "#") break;
iter1 = find(data.begin(), data.end(), str[0]);
for(i=1, count=0; i<str.siz... | #include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<map>
#include<algorithm>
#include<set>
#include <stdexcept>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
typedef long long... | 1 | 2,424,488 |
#include<bits/stdc++.h>
using namespace std;
#define int int64_t
#define double long double
#define nitro ios_base::sync_with_stdio(false);cin.tie(0);
#define vi vector<int64_t>
#define pub push_back
#define puf push_front
#define pob pop_back
#de... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
char A[105],B[105];
int main(){
scanf("%s %s",A,B);
int len_A,len_B;
for(len_A = 0;A[len_A] != '\0'... | 1 | 12,125,660 |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
string S;
cin >> S;
int ans ... | #include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
... | 1 | 85,974,058 |
#include <iostream>
using namespace std;
int main(){
long long int m;
int n, d[10000];
short p[10000];
bool f;
while( cin>>n>>m && (n||m) ){
for( int i=0;i<n;i++ )
cin >> d[i] >> p[i];
do{
f=false;
for( int i=1;i<n;i++ )
if( p[i-1]<p[i] ){
int dd=d[i]; d[i]=d[i-1]; d[i-1]=dd;
... | #include<bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (!n) return 0;
int l[12] = {};
for (int i = 0; i < n; ++i) {
int d, p;
cin >> d >> p;
l[p] += d;
}
i... | 1 | 29,523,541 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N,K,X,Y,s1,s2=0;
cin>>N>>K>>X>>Y;
if(N<K)
{
K=N;
s1=K*X;
}
else
s1=K*X;
s2=(N-K)*Y;
cout<<s1+s2<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c,d;
cin>>a>>b>>c>>d;
if(b<a)
{
long long e = a-b;
cout<<(c*b)+(d*e)<<endl;
}
else
{
cout<<c*a<<endl;
}
return 0;
} | 1 | 22,609,122 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
int main(){
int h,w,k;
cin>>h>>w>>k;
string c[h];
rep(i,h)cin>>c[i];
int ans=0;
rep(i,1<<h){
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int h,w,k;
cin>>h>>w>>k;
char c;
std::vector<vector<char>> vec(h,vector<char>(w));
std::vector<vector<char>> copy(h,vector<char>(w));
for (int i=0;i<h;i++) {
for (int j=0;j<w;j++) {
cin>>c;
vec[i][j]=c;... | 1 | 87,006,276 |
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
ll N;
cin >> N;... | 1 | 67,078,535 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<int> P(N), C(N);
rep(i, N) cin >> P[i];
rep(i, N) cin >> C[i];
rep(i, N) P[i]--;
ll ans = -1e18;
rep(si, N) {
int x = s... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
int p[5001];
int c[5001];
long long ans[5001] = {0};
cin >> n >> k;
for(int i=0; i<n; i++)
cin >> p[i];
for(int i=0; i<n; i++)
cin >> c[i];
for(... | 1 | 53,921,834 |
#include<bits/stdc++.h>
using namespace std ;
const int N= 3e5;
int Mod = 1e9+7 ;
long long cum [N];
int main(){
int H, W, K;
cin >> H >> W >> K;
char C[H][W];
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
cin >> C[i][j];
}
}
int ans = 0;
int count;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h,w,k;
cin>>h>>w>>k;
vector<vector<char>> c(h,vector<char>(w));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>c[i][j];
}
}
int ans=0;
for(int i=0;i<(1<<h);i++){
for(int j=0;j<(1<<w);j++){
int cnt=0;
for(int s=0;... | 1 | 23,594,212 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y;
scanf("%d%d%d",&n,&x,&y);
printf("%d",(n+x-1)/x*y);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll a,b,c;
cin>>a>>b>>c;
ll ans=ceil((a*1.0)/(b*1.0));
cout<<ans*c<<endl;
return 0;
} | 1 | 89,911,872 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
signed main() {
vector<int>a;
int b;
while (cin >> b) {
if (b)a.push_back(b);
else { cout << a[a.size() - 1] << endl; a.pop_back(); }
}
} | #include <iostream>
#include <stack>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
stack<int> s;
s.push(n);
int a;
while(cin >> a){
if(a == 0){
cout << s.top() << endl;
s.pop();
}
else {
s.push(a);
}
}
return 0;
} | 1 | 57,254,751 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(int i=0; i<(int)in.size(); i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
ll n; cin>> n;
map<string, ll> m;
vector<stri... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string.h>
#include <string>
#include <map>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main()
{
ll n;
ll ans = 0;
cin >> n;
vector<string> s(n);
map<string, ll> m;
rep(i,n){
... | 1 | 67,022,098 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | #include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
int main(){
ll x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vector<int> p(a),q(b),r(c);
for(int i=0;i<a;i++) cin>>p[i];
for(int i=0;i<b;i++) cin>>q[i];
for(int i=0;i<c;i++) cin>>r[i];
sort(p.... | 1 | 87,891 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mx 1000025
using namespace std;
bool a[mx];
ll prime[mx];
void seive()
{
ll i, j;
for(i = 2; i * i <= mx; i++)
{
if(!a[i])
{
for(ll j = i * i; j <= mx; j+=i)
{
a[j] = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int ans = 0;
int64_t M = N;
for (int i = 2; i <= sqrt(M); i++) {
int memo = 0;
while (N % i == 0) {
N /= i;
memo++;
}
for (int j = 1; j < 45; j++) {
if (memo >= j) {
ans++;
memo -=... | 1 | 53,409,236 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debugg cout<<"debugged\n";
#define minva... | #include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<bitset>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
string str;
S = S + S;
bool jdg = false;
for (int i = 0; i < T.length(); i++) {
str = S.substr(i, T.length(... | 1 | 65,768,942 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
using namespace std;
int n,a[100001],dp[100001];
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
dp[i]=1000000... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
cin>>n;
int dp[n+1];
fill(dp,dp+n+1,1e9);
for(int i=0;i<n;i++){
int a;
cin>>a;
*lower_bound(dp,dp+n+1,a)=a;
}
cout<<lower_bound(dp,dp+n+1,1e9)-dp<<endl;
} | 1 | 86,571,113 |
#include <iostream>
#include <cmath>
#include <iomanip>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
double a, b, x;
cin >> a >> b >> x;
double v = a * a * b;
double ans = 0;
if(x < v/2) {
... | #include <math.h>
#include <iostream>
using namespace std;
int main(void) {
double a, b, x;
cin >> a >> b >> x;
const double kPi = M_PI;
double l = 0, r = kPi / 2.0;
while (abs(r - l) > 1e-10) {
double m = (r + l) / 2.0;
double y = 0.0;
if (b / tan(m) > a) {
y = a * a * b - (a * tan(m) * a *... | 1 | 82,048,774 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int miremiam = 196471;
int big = 200;
int small = 195;
int ans = 0;
cin >> n;
int year, month, day;
for(int i = 0; i < n; i++){
cin >> year >> month >> day;
for(int j = 1; j < year; j++){
if(j % 3 == 0) ans += big;
else... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#define MAX_N 100
#define MIL_DAYS 196470
int main()
{
int i, N;
int y, m, d;
int days = 0;
scanf("%d", &N);
for (i = 0; i < N; i++)
{
scanf("%d %d %d", &y, &m, &d);
if(y % 3 == 0){
days += (d-1);
days += 20*... | 1 | 39,408,052 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin >> n;
long long int res = 0;
for(long long int a = 1; a < n; a++){
res += (n - 1) / a;
}
cout << res << endl;
} | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
int n;
cin >> n;
ll ans = 0;
for(int i = 1;i < n;i ++){
ans += (n-1)/i;
}
cout << ans << endl;
return 0;
} | 1 | 49,900,013 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #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;
string s[n]; for(int i=0;i<n;i++) cin>>s[i];
int an=0; int u[3]={0,0,0};
for(int i=0;i<n;i++) {
fo... | 1 | 95,823,785 |
#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(){
string s;cin >>s;
int n=s.size();
vector<int>cnt(26,0);
for (int i = 0; i < n... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 1 | 33,870,628 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class ... | 1 | 26,741,119 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=1; i<=(int)(n); i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define bigger (char)toupper
#define smaller (char)tolower
using namespace std;
typedef pair<int,int> pii;
typedef ... | 1 | 21,600,469 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
const int INF = 1e6;
using namespace std;
using ll = long long;
using ld = long double;
using... | #include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <functional>
#include <numeric>
#include <vector>
using namespace std;
const double PI=acos(-1);
int main(){
int a, b, m;
cin >> a >> b >> m;
vector<int> aa(a), bb(b);
int am = 99999... | 1 | 65,085,728 |
#include<stdio.h>
int main(){
int num[3],i,j;
for(i=0;i<3;i++){
scanf("%d",&num[i]);
}
for(i=0;i<2;i++){
for(j=0;j<2-i;j++){
if(num[j]>num[j+1]){
int temp=num[j];
num[j]=num[j+1];
num[j+1]=temp;
}
}
}
for(i=0;i<3;i++){
if(i)printf(" ");
printf("%d",num[i]);
}
printf("\... | #include <iostream>
using namespace std;
int main() {
int a,b,c,d;
cin>>a>>b>>c;
if (c<a) {
d=c;
c=a;
a=d;
}
if (a>b) {
d=a;
a=b;
b=d;
}
if (b>c) {
d=b;
b=c;
c=d;
}
cout<<a<<" "<<b<<" "<<c<<"\n";
return 0;
} | 1 | 78,940,645 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
string strd(int n){
string x;
while(n){
int d=n%10;
x+=(d+'0');
n/=10;
}
reverse(x.begin(),x.end());
return x;
}
void digit()
{
cin>>s;
ll sum=0;
for(int i=0;i<s.size();i++){
char... | 1 | 55,378,576 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string result = "";
for(int i = 0; i < str.size(); i += 2) {
result += str.at(i);
}
cout << result << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int a = s.size(),b;
for(int i=0;i<a;i=i+2) {
cout << s[i];
}
} | 1 | 8,063,984 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,k;
cin >> t;
k=t;
vector <int> side(t);
int n;
int p=0;
while(k--)
{
cin>>side[p++];
}
sort(side.begin(),side.end(),greater<int>());
int a=0,b=0,i,f=0;
for(i=0;i<t-1;i++)
{
if(side[i]==sid... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define tata return;
#define pb push_back
#define mp make_pair
#define in insert
#define run ios_base::sync_with_stdio(false);cin.tie(NULL);
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define vec vector<ll>
#define setl set<ll>
#define m... | 1 | 98,911,749 |
#include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a;
bool is... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <climits>
int main()
{
long s;
std::cin >> s;
bool table[1000000+1]={};
table[s]=1;
long count=2;
while(1){
if(s%2==0){
s=s/2;
}else{
s=3*s+1;
}
... | 1 | 87,510,669 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <bitset>
#include <map>
#include <cmath>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
string result = "";
bool loopdfs(vector<int> & nums, int N, i... | 1 | 7,006,057 |
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int n;
int main(){
while(cin>>n){
if(n==0)return 0;
n=1000-n;
cout<<n/500+n%500/100+n%100/50+n%50/10+n%10/5+n%... | #include <iostream>
using namespace std;
int main(){
ios::sync_with_stdio(false);
int sum=0;
int x;
int cnt=0;
while(1){
cin>>x;
if(!x)
return 0;
sum=1000-x;
while(sum>0){
if(sum>=500){
cnt++;
sum-=500;
... | 1 | 4,571,311 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int,int> PII;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 1 | 82,838,899 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(lon... | 1 | 47,756,603 |
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
long long t = N, f = 0;
while (t > 0){
f += t % 10;
t /= 10;
}
if (N % f == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 1 | 80,636,521 |
#include<iostream>
#include<vector>
#include<string>
#include<deque>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
deque<int>a;
for(int i=0;i<n;i++){
int k;
cin>>k;
if((n%2==0&&i%2!=0)||(n%2!=0&&i%2==0)){
a.push_front(k);
}else{
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
deque<int> a;
rep(i,n) {
int b; cin >> b;
if (i % 2 == 0)... | 1 | 29,265,790 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <string>
#include <cstring>
#define sz(v) ((int)((v).size()))
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3c3c3c3c;
c... | #include <cstdio>
#include <algorithm>
using namespace std;
const int N=1e5+5;
int n;
long long d[N],cur[N];
int id[N],sz[N],par[N];
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]);
id[i]=i;
sz[i]=1;
}
sort(id+1,id+n+1,cmp);
for (int i=1;i<n... | 1 | 49,825,139 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll mod=1000000007;
const ll INF=1e15;
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
struct edge{ ll to; ll cap; ll rev;};
const ll MAXN=203;
vector<edge> G[... | 1 | 23,693,275 |
#include <bits/stdc++.h>
#define INF (1<<30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
int yes(){
cout << "YES" << endl;
return 0;
}
int no(){
cout << "NO" << endl;
return 0;
}
int main(){
ll n; cin >> n;
vector<ll> a(n);
for( auto &k : a ) cin >> k;
ll acc = accumul... | #include <bits/stdc++.h>
using namespace std;
#ifdef zxc
#include <sys/resource.h>
#include "debug.h"
#include "profile.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define profile(X) LOG_DURATION(X)
#else
#define debug(...) 42
#define profile(...) 42
#endif
using ll = int64_t;
usin... | 1 | 4,646,825 |
#include <bits/stdc++.h>
using namespace std;
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using mii = map<int, int>;
using ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i=0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
template <class T> using vec = std::vector<T>;
template <class T> using vec2 = vec<vec<T>>;
template <class T> using vec3 = vec<vec<vec<T>>>;
template <class T>
class InfNum{
T num;
int flag_in... | 1 | 26,711,697 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n), b(n);
long long cp = 0;
for(int i = 0; i < n; i++) cin >> a[i] >> b[i];
for(int i = n; i--;) {
a[i] += cp;
cp += (b[i] - a[i]%b[i])%b[i];
}
cout << cp;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
int N;
cin >> N;
vector<ll> A(N), B(N);
for(int i = 0; i < N; i++){
ll tmp1,tmp2;
cin >> A.at(i) >> B.at(i);
}
ll ans = 0;
for(int i... | 1 | 87,246,124 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | 1 | 3,457,507 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
for (ll i = sqrt(n); i > 0; --i) {
if (n % i == 0) {
cout << (n / i) + i - 2 << endl;
return (0);
}
}
return (0);
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
ll n; cin >> n;
ll ans=INF_LL;
for(ll i = 1;i*i<=n;i++){
ll j;
if(n%i==0)
j = n/i;
ans = min(ans,i... | 1 | 9,791,996 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < n; ++i)
int main(){
string s;
cin >> s;
int len = s.size();
int ans = 0;
string t;
char c = s[0];
for(int i = 1; i < len; ++i){
if(c != s[i]){
t += c;... | #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... | 1 | 51,851,088 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
ll l, r;
... | 1 | 44,101,463 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.