code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A;
cin >> N >> A;
if(N % 1000 > A){
cout << "No" << endl;
}
else{
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x%500 <= y) {
cout << "Yes" << endl;
}
if (x%500 > y) {
cout << "No" << endl;
}
} | 1 | 52,679,228 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <tuple>
#include <numeric>
#include <cstdio>
#include <cmath>
using namespace std;
using ll = long long;
const int INF = 1e9;
int a, b, c;
int N, rtn... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
using namespace std;
#define int long long
#define double long double
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) str... | 1 | 9,932,231 |
#include<bits/stdc++.h>
using namespace std;
main(){
int N,K;
cin>>N>>K;
vector<int>a(N);
for(auto&x:a)cin>>x;
sort(a.begin(),a.end());
int ans=N,sum=0;
for(int i=a.size()-1;i>=0;--i)
if(sum+a[i]<K)
sum+=a[i];
else
ans=i;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int len = 5005;
int arr[len];
bool pref[len][len], suf[len][len];
int main(){
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
pref[0][0] = suf[n+1][0] = true;
for (int i = 1; i <= n... | 1 | 14,739,890 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int X[3];
cin >> X[0] >> X[1] >> X[2];
int ans = 0;
while(1) {
sort(X, X+3);
if (X[0] == X[1] && X[1] == X[2]) break;
if (X[0] == X[1]) {
X[0]++;
X[1]++;
} else if (X[1] - X[0] == 1) {
X[0]++;
X[2]++;
} else {
... | 1 | 3,677,472 |
#include<iostream>
using namespace std;
int main(){
int a,b;
double A,B;
cin>>a>>b;
cout<<a/b<<" "<<a%b<<" ";
A=a;
B=b;
cout<<fixed<<A/B<<endl;
return 0;
} | #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
using namespace std;
int main() {
int a, b, d, r;
long double f;
cin >> a >> b;
d = floor(a / b);
r = a%b;
f = (long double)a / b;
printf("%d %d %LF", d, r, f);
cin >> a... | 1 | 30,077,678 |
#include<bits/stdc++.h>
using namespace std;
#define Boost() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
t... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 1 | 29,685,828 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
while (true) {
int n, a, b, c, x;
cin >> n >> a >> b >> c >> x;
if (n == 0 && a == 0 && b == 0 && c == 0 && x == 0) {
return 0;
}
vector<int> ys;
for (int i = 0; i < n; ++i) {
... | #define _crt_secure_no_warnings
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cst... | 1 | 36,922,477 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s,t;
cin >> s >> t;
int n = s.length();
int m = t.length();
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
if(s<t){
cout << "Yes" << end... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | 1 | 9,375,796 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;cin>>s>>t;int k=INT_MIN;
for(int i=0;i<=s.length()-t.length();i++)
{
int p=0;
for(int j=0;j<t.length();j++)
{
if(s[j+i]==t[j])
{p++;}
}
k=max(p,k);
}
cout<<t.length()-k;
} | #pragma region
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, a... | 1 | 16,559,873 |
#include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
using namespace std;
int main() {
int n, min = -1;
vector<int> v;
for (;;) {
cin >> n;
if (n == 0) break;
v.resize(n);
for (int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
for ... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <math.h>
#include <cmath>
#include <t... | 1 | 22,647,489 |
#include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int n;
string s;
bool used[105];
int cnt1,cnt2;
signed main(){
ios_base::sy... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"... | 1 | 41,953,177 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 10010
using namespace std;
int n,k,a[N],f[N],ok=1,s;
int main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),a[i]=min(a[i],k),s+=a[i];
sort(a+1,a+n+1);
f[0]=1;
for(int i=n;i>=0;i--){
ok=1;
for(int j=max(k-s,0);j<=k-1;j++)
... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int main(){
int N, K;cin>>N>>K;
vi a;
a.push_back(0);
for (int i=0;i<N;++i){
int a_;cin>>a_;a.push_back(a_);
}
a.push_back(0);
int left[2][K+1], right[2][K+1];
memset(left, -1, sizeof(left));
memset(right, -1, sizeof(right));
... | 1 | 16,717,323 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> X(N);
for(int i = 0; i < N; i++){
cin >> X.at(i);
}
long long sum = 1000000000;
for(int i = 1; i <= 100; i++){
long long cost = 0;
for(int j = 0; j < N; j++){
cost += (X... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = acos(-1) ;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 1 | 16,301,263 |
#include<stdio.h>
int main(){
char S[3];
int cnt=0;
scanf("%s",S);
for(int i=0;i<3;i++){
if(S[i]==S[i+1]){
cnt++;
}
}
if(cnt==2){
printf("No");
}else{
printf("Yes");
}
return 0;
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("-ffloat-store")
#define int long long
#define rep(i,begin,end) for(__typeof(end)i=(begin)-((begin)>(end));i!=(end)-((begin)>(end));i+=1-2*((begin)>(end)))
#defi... | 1 | 14,564,653 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define all(a) (a).begin(), (a).end()
int main(){
int N, K;
cin >> N >> K;
vector<int> H(N);
for(int i = 0; i < N; i++) cin >> H[i];
int count = 0;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N,K,h,i,c;
cin>>N>>K;
c = 0;
for(i=0;i!=N;i++)
{
cin>>h;
if(h >= K)
c++;
}
cout<<c;
return 0;
} | 1 | 18,495,272 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){
long long n;
cin >> n;
int ans = 10;
for(int i = 1; i <= sqrt(n); i++) {
if(n % i == 0) {
int keta = 0;
long long syou = n / i;
while(syou > 0) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using int64 = int64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64 n;
cin >> n;
int ans;
for (int64 i = 1; i * i <= n; i++) {
if (i * (n / i) == n) {
ans = (int)to_string(n / i).size();
... | 1 | 21,857,892 |
#include <bits/stdc++.h>
#define ll long long
const ll inf=(1LL<<62);
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
template <class A> inline A abs(A &a) { return (a < 0 ? -a : a); }
using namespace std;
signed main() {
ll n;
cin >> n;
ll ans = n;
for (int i ... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 l... | 1 | 10,526,405 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k, x, y;
cin >> n >> k >> x >> y;
int ans = 0;
if(n < k){
ans += n*x;
}else{
ans += (k*x + (n - k)*y);
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,X,Y;
cin >> N >> K >> X >> Y;
int total_cost = 0;
for(int i=0; i < N; i++) {
if (i < K) {
total_cost += X;
} else {
total_cost += Y;
}
}
cout << total_cost << endl;
} | 1 | 9,470,969 |
#include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n';
typedef int64_t Int;
Int mod = 1e9+7;
Int INF = 1e9+7;
int main() {
ios::sync_with_stdio(false);
vector<Int> res;
while (true) {
Int n;
cin >> n;
vector<Int> a(n);
if (n == 0) break;
fo... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int a[1050];
while(cin>>n,n){
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
int mn=1000000;
for(int i=1;i<n;i++){
mn=min(mn,a[i]-a[i-1]);
}
cout<<mn<<endl;
}
... | 1 | 5,016,488 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define eb emplace_back
#define mt make_tuple
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
typedef long long ll;
typedef pair <int, int> ii;
typedef pair <ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typede... | #include<bits/stdc++.h>
using namespace std;
#define maxn 600020
#define rep(i,l,r) for(register int i = l ; i <= r ; i++)
#define repd(i,r,l) for(register int i = r ; i >= l ; i--)
#define rvc(i,S) for(register int i = 0 ; i < (int)S.size() ; i++)
#define rvcd(i,S) for(register int i = ((int)S.size()) - 1 ; i >= 0 ; i... | 1 | 56,838,502 |
#include<iostream>
int main()
{
int n;
std::cin >> n;
for (int i = 0; i < n; i++)
{
long double x1, y1, x2, y2, x3, y3, x4, y4;
std::cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
std::cout << (x1 == x2 && x3 == x4 || (y1 - y2) / (x1 - x2) == (y3 - y4) / (x3 - x4) ? "YES" : "NO") << std::endl;
}
retur... | #include <iostream>
#include <complex>
#include <cmath>
#include <vector>
using namespace std;
typedef complex<double> P;
const double eps = 1e-8;
bool cross(P a, P b) {
return a.real()*b.imag() - a.imag()*b.real();
}
int main() {
int Tc;
cin >> Tc;
while(Tc--) {
vector<P> ps(4);
for(int i = 0; i < 4; +... | 1 | 67,028,959 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<map>
#include<math.h>
#include<string>
#include <cctype>
#include <cstdlib>
#include<bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout <<... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<vector<int>> Graph;
int main() {
int n,k,h,ans=0;
cin >> n >> k;
rep(i,n){
cin >> h;
if (h>=k) ans++;
... | 1 | 11,740,511 |
#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, L;
cin >> N >> L;
vector<string> s(N);
rep (i,N) {
cin >> s.at(i);
}
sort(s.begin(), s.end());
for (int i = 0; i < N; ++i) {... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,l;
cin >> n >> l;
vector<string> s(n);
for(int i = 0;i < n;i++)cin >> s[i... | 1 | 36,751,632 |
#include <iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
using namespace std;
int main(void){
int n,k;
cin>>n>>k;
int ans=1;
while(n--){
ans= min(ans*2, ans+k);
}
cout<<ans;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int N,K;
cin >> N >> K;
int now = 1;
rep(i,N){
if(now <= K) now*=2;
else now+=K;... | 1 | 26,118,206 |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <assert.h>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
using namespace std;
#ifdef __DEBUG__
bool debu... | #include <iostream>
#include <vector>
#include <cstring>
#include <set>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <stack>
using namespace std;
#define ll long long
#define pb push_back
#define pp pair<long long,long long>
#define ppp pair<pair<lon... | 1 | 92,222,499 |
#include <iostream>
#include <stdio.h>
#define MAX 101
int A[MAX];
int main() {
int n, x;
int sum = 0;
while (1) {
scanf("%d %d", &n, &x);
if ( n == 0 && x == 0 ) break;
for (int i = 1; i <= n; i++) A[i] = i;
for (int i = 1; i <= n-2; i++) {
for (int j = i+1; j <=... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n,x;
while (true) {
cin >> n >> x;
if (n == 0 && x == 0){
break;
}
vector<vector<int> > numbers;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j... | 1 | 34,399,863 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
cin>>n;
double l=0,x;
double a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
l=l+1/a[i];
}
x=1/l;
cout<<x;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main()
{
int n;
scanf("%d", &n);
double sum = 0;
rep(i, n) {
int a;
scanf("%d", &a);
sum += 1.0 / a;
}
double ans = 1 / sum;
printf("%.10f\n", ans);
return 0;
} | 1 | 68,407,458 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
string s;
int main(void){
cin >> s;
lli a=0, b=0;
lli n = s.size();
for(lli i = 0; i < n; i++){
if(s[i] == 'B'){
a+=n-1-i;
b++;
}
}
cout << a-b*(b-1)/2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | 1 | 34,672,568 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
char buf[1<<15],*fs,*ft;
inline char getc() { return (ft==fs&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),ft==fs))?0:*fs++; }
template<typename T>inline void read(T &x)
{
x=0;
T f=1, ch=getchar();
while (!isdigit(ch) && ch^'... | 1 | 59,658,220 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,D,X;
cin >> N >> D >> X;
vector<int>vec(N);
for(int i=0; i<N; i++){
cin >> vec[i];
X += (D-1)/vec[i]+1;
}
cout << X << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int N, D, ans, tmp;
cin >> N >> D >> ans;
for (int i = 0; i < N; i++)
{
cin >> tmp;
ans += (D - 1) / tmp + 1;
}
cout << ans;
} | 1 | 48,483,138 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
const double PI = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string s;
long long ans = 0;
long long count = 0;
long long r, g, b;
r = g = b = 0;
cin >> N >> s;
for (int i = 0; i < N; i++) {
if (s[i] == 'R') {
r++;
}else if (s[i] == 'G'){
g++;... | 1 | 66,171,911 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | #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 n, m;
cin >> n >> m;
string s[n];
rep(i, n) cin >> s[i];
rep(i, n){
cout << s[i] <... | 1 | 94,297,145 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l[86];
l[0] = 2;
l[1] = 1;
for (int i = 2; i < 87; i++) {
l[i] = l[i-1] + l[i-2];
}
int n;
cin >> n;
cout << l[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
vector<unsigned long long> A(90);
A.at(0) = 2;
A.at(1) = 1;
for (size_t i = 2; i < 90; i++)
{
A.at(i) = A.at(i-1)+A.at(i-2);
}
cout << A.at(N) << endl;
return 0;
} | 1 | 80,266,838 |
#include <stdio.h>
#include <string.h>
int main(){
char words[105];
int k;
int word;
scanf("%d" ,&k);
scanf("%s" ,words);
word = strlen(words);
if (word <= k){
printf("%s" ,words);
}
else if(word > k){
words[k] = '\0';
printf("%s..." ,words);
}
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | 1 | 13,888,408 |
#include<bits/stdc++.h>
typedef long long ll;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define last freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define fr first
#define sc second
#define lcm(a,b) (a*b)/__gcd(a,b)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int X;
cin >> X;
int S = X;
for (int i = 1;; i++) {
if (S % 360 == 0) {
cout << i << endl;
return 0;
}
S += X;
}
} | 1 | 70,162,149 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include<queue>
#include<set>
#include<climits>
using namespace std;
int main()
{
while (true)
{
long long n, tmp = LLONG_MAX;
cin >> n;
if (n == 0)
exit(0);
vector<long long> v(n, 0);
for (int i = 0; i < n; i++)
... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main () {
int n;
while (cin >> n, n) {
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
int min_ = 1e+9;
for (int i = 0; i < n - 1; i++) {
min_ = min(min_, v[i + 1] - v[i... | 1 | 33,591,273 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
vector<ll> num(4);
for(int i = 0; i < 4; i++) cin >> num[i];
ll n;
cin >> n;
ll ans = (n*4)*num[0];
ans = min((n*2)*num[1],ans);
ans = min(ans,n*num[2]);
if(n%2 == 1){
ans = ... | 1 | 65,509,640 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
bool exist1=false, exist2=false;
int ans1, ans2;
for (int i=0; i<s.size()-1; i++) {
if (s[i]==s[i+1]) {
ans1=i+1, a... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | 1 | 37,318,223 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
sort(a.begin(), a.end());
vector<long long int> sa(n+1);
for(int i=0; i<n; i++){
sa[i+1] = sa[i] + a[i];
}
int ans = 1;
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | 1 | 15,382,206 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(... | 1 | 55,286,122 |
#include<iostream>
using namespace std;
int main() {
char String[1200];
cin.getline(String, sizeof(String));
for (int i = 0; String[i] != '\0'; i++) {
if ('a' <= String[i] && String[i] <= 'z') {
String[i] += 'A' - 'a';
}
else if ('A' <= String[i] && String[i] <= 'Z') {
String[i] += 'a' - 'A';
}
}
cou... | #include<cstdio>
#include<cctype>
int main() {
char c;
for(;;) {
scanf("%c", &c);
if( isalpha(c) ) {
if( islower(c) ) {
printf("%c", toupper(c));
} else {
printf("%c", tolower(c));
}
} else {
printf("%c", c);
}
if(c == '\n') break;
}
return 0;
} | 1 | 99,465,790 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<int,int> ... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=998244353;
#define INF (1<<30)
#define LINF (lint)(1... | 1 | 92,214,938 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int n;
cin >> n;
string ans;
for (int i = 0; i < s.size(); i += n) {
ans.push_back(s[i]);
}
cout << ans << ... | #include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
template <class c, class cmp = less<c> > using ordered_set = tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);co... | 1 | 80,564,588 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int g = 1;
for (int i = min(a, b); i > 0; i--)
{
if (a % i == 0 && b % i == 0)
{
g = i;
break;
}
}
if (c % g == 0)
{
puts("YES");
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int a = A % B;
for (int i = 2; i < 1000000; i++){
int b = (A * i) % B;
if (b == C){
cout << "YES" << endl;
return 0;
}
if (b == a){
cout << "NO" << endl;
return 0;
}
}
cout... | 1 | 1,355,869 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#include<sstream>
#include<stack>
#include<queue>
#include<list>
#include<functional>
#define _USE_MATH_DEFINES
#include<math.h>
#include<map>
#define SENTINEL 1000000001
#define... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n, e; cin >> n >> e;
vector<vector<long long> > g(n + 1, vector<long long> (n + 1, 1000000000000));
for(long long i = 0; i < n; i++) g[i][i] = 0;
for(long long i = 0; i < e; i++){
long long a, b, d; cin >> a >> b >> d;
g[... | 1 | 44,579,227 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define int long long
#define all(a) a.begin(), a.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007... | #include <bits/stdc++.h>
using namespace std;
int n,pd,a[2010][2010],ji;
int main()
{
scanf("%d",&n);
for(int i=1;i*(i-1)<=2*n;++i)
{
if(i*(i-1)==2*n)
{
pd=i;
break;
}
}
if(pd==0)
printf("No\n");
else
{
printf("Yes\n");
printf("%d\n",pd);
for(int i=1;i<=pd-1;++i)
a[1][i]=i;
ji=pd-1;
for(... | 1 | 58,715,632 |
#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
#define all(a) a.begin(), a.end()
#define mp(a, b) make_pair(a, b)
const int MOD = 1e9+7;
const int INF = 1001001001;
const ll ... | 1 | 63,036,015 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int a, b, c;
fscanf(stdin, "%d %d %d", &a, &b, &c);
double theta = c * M_PI / 180.0;
double S = 0.5 * a * b * sin(theta);
double L = a + b + sqrt(a * a + b * b - 2 * a * b * cos(theta));
double h = b * sin... | #include<cstdio>
#include<cmath>
int main(){
double a,b,c;
scanf("%lf %lf %lf",&a,&b,&c);
printf("%.7f\n",a*b*sin((M_PI*c/180))/2);
printf("%.7f\n",a+b+sqrt(pow(a,2)+pow(b,2)-2*a*b*cos((M_PI*c/180))));
printf("%.7f\n",b*sin((M_PI*c/180)));
} | 1 | 18,754,514 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define out(ans) cout << ans << endl;
const long long mod = 1e9 + 7;
int main(){
ll x,y;cin>>x>>y;
if(x%y==0){
out(-1);
return 0;
}
for(ll i=x;i<10e18;i+=x){
if(i%y!=0){
out(i);
... | 1 | 74,734,910 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define vec vector
#define fi first
#define se second
#define eb emplace_back
#define ef emplace_front
#define pof pop_front()
#define pob pop_back()
#define Rep(i,n) for(li i=0,nn=(li)(n);i!=nn;++i)
#define Rep1(i,n) for(li i=1,nn=(li)(n)+1;i!=nn;++i... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
ll n;
ll a;
ll b;
ll x = 0;
ll y = 0;
ll ans = 0;
cin >> n >> a >> b;
x = n % (a+b);
y = n / (a+b);
if (x ... | 1 | 30,070,637 |
#include <bits/stdc++.h>
#define ll long long int
#define forr(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define oo 100000000000000000
using namespace std;
void _sol(){
int n; cin >> n;
vector<ll> v(n);
for(auto &i: v) cin >> i;
ll ans = 0;
for(int i=1;i<n;i++){
if(v[i] < v[i-1]){
... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
#define REP(i, n) for (long long i = 0... | 1 | 830,068 |
#include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
using namespace std;
int main()
{
string X, Y;
cin >> X >> Y;
ll x = X.size(), y = Y.size();
vector<vector<ll>> dp(x + 1, vector<ll>(y + 1, INF));
for (ll i = 0; i < x; ++i)
{
dp.at(i).at(0) = i;
}
for (ll j = 0; j < y; ++... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main(){
string s, t; cin >> s >> t;
int N = s.size(), M = t.size();
vector<vector<int> > dp(N + 1, vector<int> (M + 1, INF));
for(int i = 0; i <= N; i++) dp[i][0] = i;
for(int i = 0; i <= M; i++) dp[0][i] = i;
for(int i = 1; i <= N; i++)... | 1 | 74,743,064 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int min(int a, int b) {
return a < b ? a : b;
}
int main(void)
{
vector<int> a(3);
for (int i = 0; i < 3; ++i) {
cin >> a.at(i);
}
vector<int> dp(3);
sort(a.begin(), a.end());
dp.at(0) = 0;
for (int i = 1; i < 3; ++i) {
... | 1 | 74,464,128 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int64_t lucas(int64_t a, int64_t b, int n){
if (n == 0) return a;
if (n == 1) return b;
if (n == 2) return a + b;
int64_t res = a + b;
return luca... | #include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
long long luca[100];
luca[0] = 2;
luca[1] = 1;
for (int i = 2; i <= N; i++) {
luca[i] = luca[i - 1] + luca[i - 2];
}
printf("%lld\n", luca[N]);
return 0;
} | 1 | 36,533,964 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
int ans = 1;
while (ans*2 <= N) ans *= 2;
cout << ans << endl;
return 0;
} | 1 | 86,694,078 |
#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;
template<typename key>
using ordered_set = tree<key, null_type, less<key>, rb_tree_tag, tree_order_statistics_node_update>;
#define F first
#define S second
#define T sec... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int mod=1000000007;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string s,t;
cin>>s>>t;
int ans=0;
for(int i=0; i<s.size(); i+=1){
if(s[i]!=t[i]){ans++;}
}
cout<<ans;
return 0;
} | 1 | 33,035,538 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define rep(i,n) REP(i, 0, n)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
map<string, int> ac;
ac["lu"] = ac["ru"] = 1;
ac["ld"] = ac["rd... | #include<iostream>
#include<string.h>
using namespace std;
int main()
{
int N;
while (cin >> N && N != 0)
{
char f[3];
char preF[3] = { 'a', 'a', '\0' };
int right = 0;
int left = 0;
int count = 0;
for (int i = 0; i < N; i++)
{
cin >> f;
if (strcmp(f, "lu") == 0)
{
if (right == 1 && strcmp... | 1 | 57,973,438 |
#include<bits/stdc++.h>
#define N 100005
#define LL long long
using namespace std;
vector<int> G[N];
int n,a[N],d[N],rt;
void GG(){ printf("NO"); exit(0);}
void dfs(int t,int fa)
{
int i; LL Max=0,x,sum=0;
if(d[t]==1) return ;
for(i=0;i<G[t].size();i++)
if(G[t][i]!=fa) dfs(G[t][i],t);
for(i=0;i<G[t].size();i++)
... | #include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int maxn=100000+10;
int h[maxn],go[maxn*2],nxt[maxn*2],fa[maxn],d[maxn],a[maxn];
int i,j,k,l,t,n,m,tot,root;
bool czy;
void add(int x,int y){
d[y]++;
go[++tot]=y;
nxt[tot]=h[x];
h[x]=tot;
}
void dfs(int x... | 1 | 61,451,976 |
#include<iostream>
#include<cstring>
#include<climits>
using namespace std;
int main(){
int n,k;
cin >>n>>k;
int arr[n];
for(int i=0;i<n;i++) cin>> arr[i];
int dp[n];
memset(dp,0,sizeof(dp));
dp[0] = 0;
int ans = 0;
for(int i = 1;i<n;i++){
dp[i] = INT_MAX;
for(int j=1;j<=k;j++){
if(i-j >=0)
dp[i] = min(abs(arr[i-j... | #include<bits/stdc++.h>
using namespace std;
int stone[100000+5];
int dp[100000+5];
int main(int argc, char const *argv[])
{
int N, K;
while(cin >> N >> K) {
memset(stone, 0, sizeof(stone));
memset(dp, 0, sizeof(dp));
for(int i=1; i<=N; i++){
cin >> stone[i];
}
dp[1] = 0;
dp[2] = abs(stone[2] - stone[1... | 1 | 48,689,392 |
#include<iostream>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a>b){a=a+b;b=a-b;a=a-b;}
if(a>c){a=a+c;c=a-c;a=a-c;}
if(b>c){b=b+c;c=b-c;b=b-c;}
cout<<a<<' '<<b<<' '<<c<<endl;
return 0;
} | #include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main(){
#ifdef CIN
ifstream cin("input.txt");
ofstream cout("output.txt");
#endif
int a, b, c;
int i;
cin >> a >> b >> c;
if (a > b)
{
a ^= b ^= a ^= b;
}
if (b > c)
{
b ^= c ^= b ^= c;
}
if (a > b)
{
a ^= b ^= a ^= b;
... | 1 | 89,694,978 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll,pair<ll,char>>
#define sorted(a_1) sort(a_1.begin(),a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(),a_1.rend())
#define t1(a_1) cout<<a_1<<endl;
#define t2(a_1) for(auto it_test : a_1) cout<<it_test<<" ";
#defi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int a[n];
long dp[k+1] = {0}, m = 1000000007;
for(i = 0; i < n; ++i)
cin >> a[i];
for(j = 0; j <= a[0]; ++j)
dp[j] = 1;
for(i = 1; i < n; ++i) {
for(j = 0; j < k; ++j)
... | 1 | 78,563,444 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a/b << " ";
cout << a%b << " ";
double a1,b1;
a1 = static_cast<double>(a);
b1 = static_cast<double>(b);
cout << fixed << a1/b1 << endl;
return 0;
} | #include <iostream>
#include <iomanip>
int main()
{
int a, b;
std::cin >> a >> b;
int d = a / b;
int r = a % b;
double f = static_cast<double>(a) / b;
std::cout << d << " " << r << " " << std::fixed << std::setprecision(5) << f << std::endl;
} | 1 | 73,171,412 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
int v[101];
int main(){
int N,M;
int P;
while(cin >>N>>M>>P){
if (N == 0 && M == 0 && P == 0) break;
int NUMP = 0;
int ans = 0;
for(int i = 0;i < N ; i++){
cin >>v[i];
NUMP += v[i];
}
if(v[M-1] == 0){
ans =... | #include <iostream>
#include <vector>
using namespace std;
int main (void) {
while (1) {
int n, m, p;
cin >> n >> m >>p;
if (n == 0 && m ==0 && p == 0) break;
int x[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> x[i];
sum += x[i];
}
int gold = sum * 100;
int rest = gold - (gold * p * 0.0... | 1 | 100,329,681 |
#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>
using namespace std;
#define intmax INT_MAX
#define lma... | #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>
#inclu... | 1 | 13,179,189 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s; cin >> s;
string ans = "";
for (int i = 0; i < s.size(); i++) {
if (i % 2 == 0) {
ans += s[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | 1 | 79,142,952 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge {int to, cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
ll GCD(ll a, ll b){
if(b==0) return a;
else return GCD(b, a%b);
}
ll LCM(ll a, ll b){
if(a<b) swap(a,b);
return a/GCD(a,b)*b;
}
int par[... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize ("-ffloat-store")
#pragma GCC optimize ("-fno-defer-pop")
typedef long long int ll;
typedef long double ld;
ll mod = 1e9+7;
ll add(ll a, ll b){
a = a%mod;
b = b%mod;
return (mod+(... | 1 | 44,366,270 |
# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | #include <iostream>
#include <map>
int main()
{
std::map<int, int> s;
for (int i = 0; i < 6; i++) {
int a; std::cin >> a;
s[a]++;
}
bool b = true;
for (const auto& ss: s) {
if (ss.second >= 3) {
b = false;
}
}
std::cout << (b?"YES":"NO") << std::en... | 1 | 71,997,017 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <ctime>
#define ll long long
#define vecvec(h, w, name) vector<vector<ll>> name(h, vector<ll>(w));
#define rep(init, i, n) for (ll i = init; i < (n); i++)
#define rev(s) reverse(s.begin(), s.end())
#define sor(v) sort... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int k;
string s, r;
cin >> k;
cin >> s;
if(s.length() <= k) {
cout << s;
} else {
r = s.substr(0,k).append("...");
cout << r;
}
return 0;
} | 1 | 37,237,954 |
#include<iostream>
using namespace std;
int main()
{
int N, H[250];
cin >> N;
for (int i = 0; i < N; i++)
cin >> H[i];
int k = 0;
while (k < N) {
cout << "node " << k + 1 <<": key = " << H[k] << ", ";
int l = (k + 1) / 2 - 1;
if (k!=0)
cout << "parent key ... | #include <bits/stdc++.h>
using namespace std;
#define ll 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 ALL(v) v.begin(), v.end()
#define MS... | 1 | 33,449,322 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1LL<<60;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x... | 1 | 42,489,225 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int s;
cin >> s;
vector<int> S;
S.push_back(s);
int one = 0;
while (one < 2)
{
if (s % 2 == 0)
{
s /= 2;
}
else
{
s = (3 * s) + 1;
}
S.push_back(s);
if (s == 1)
{
one++;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int s;
cin >> s;
map<int, int> pos;
pos[s]++;
int a_buf, a = s;
int ans = 1;
while(1){
a_buf = a;
if (a_buf%2 == 0) a = a_buf/2;
else a = a_buf*3+1;
pos[a]++;
ans++;
if (pos[a] == 2) bre... | 1 | 75,823,939 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;
cin>>A>>B>>C;
C -= A-B;
cout<<(C>0? C: 0)<<endl;
} | 1 | 45,564,248 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, t, x, y, i, j, T = 0, X = 0, Y = 0;
cin >> N;
string s = "Yes";
for (i = 0; i < N; i++) {
cin >> t >> x >> y;
T = t - T, X = abs(x - X), Y = abs(y - Y);
if (X + Y > T || (t + x + y) % 2 != 0) {
s = "No";
break;
}
}
... | 1 | 70,085,675 |
#include <iostream>
#include <bits/stdc++.h>
#define rep(i,z) for(int i = 0; i<(int)(z); i++)
#define rep1(i,z) for(int i = 1; i<=(int)(z); i++)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
using pear = pair<int,int>;
int main(){
long double l; cin>>l;
cout<< fixed << setprecision(7) << (l / 3... | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | 1 | 3,112,252 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 1 | 18,311,488 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,int>
#define T tuple<int,int,int>
using namespace std;
int main(){
vector<int... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < (ll)n; ++i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
int main(void)
{
vector<in... | 1 | 33,614,941 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[100000+1];
int l[100000+1];
int main()
{
int n;
scanf("%d",&n);
for (int i=0;i<n;i++)
scanf("%d",&a[i]);
l[0]=a[0];
int chang=1;
for (int i=1;i<n;i++)
{
if(l[chang-1]<a[i]){
l[chang++]=a[i];
... | #include <iostream>
#include <vector>
using namespace std;
const int MAX = 1 << 30;
int main(void){
int n;
cin >> n;
vector<int> A(n);
vector<int> dp(n);
for(int i=0;i<n;i++){
cin >> A[i];
dp[i] = MAX;
}
for(int i=0;i<n;i++){
vector<int>::iterator it = lower_bound(dp.begin(... | 1 | 83,548,351 |
#include <iostream>
#include <vector>
#include <stack>
#include <math.h>
#include <string>
#include <cmath>
#include <iomanip>
int main();
int main(){
std::stack<int> input;
std::vector<int> output;
int dummy = 0;
int count = 0;
while (std::cin >> dummy){
if ((dummy == 0) && (!input.empty())){
output.p... | #include <iostream>
#include <stack>
std::stack<int> st;
int main() {
int x = 0;
while(std::cin >> x) {
if(x == 0) {
int y = st.top();
st.pop();
std::cout << y << std::endl;
} else {
st.push(x);
}
}
} | 1 | 66,660,212 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
string x;
while(cin >> n, n){
int l = 0, r = 0;
int res = 0;
int next = 1;
for(int i = 0;i < n;i++){
cin >> x;
if(x == "lu")l = 1;
if(x == "ru")r = 1;
if(x == "ld")l = 0;
if(x == "rd")r = 0;
if(l... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
int rc,lc;
int cnt;
string str;
int zen,now;
while(cin>>n,n){
rc=lc=0;
cnt=0;
for(int i=0;i<n;i++){
cin>>str;
if(str[0] == 'r')now = 0;
else now = 1;
if(str == "lu")lc++;
if(str == "ru")rc++;
if... | 1 | 64,471,483 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a[4][3][10],b,c,d,e;
cin>>n;
for(int x=0;x<4;x++) for(int y=0;y<3;y++) for(int z=0;z<10;z++) a[x][y][z]=0;
for(int i=0;i<n;i++){
cin>>b>>c>>d>>e;
a[b-1][c-1][d-1]+=e;
}
for(int x=0;x<4;x++){
for(int y=0;y<3;y++){
for(int z=0;z<10;z++) cout<<... | #include<iostream>
using namespace std;
int main() {
int n, b, f, r, v;
int count[5][4][11] = { 0 };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b >> f >> r >> v;
count[b][f][r] += v;
}
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 3; j++) {
for (int k = 1; k <= 10; k++) {
cout << ' ' << count... | 1 | 22,735,855 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,K,sum=0;
cin >> A >> B >> C >> K;
for(int i=0;i<A;i++){
sum++;
K--;
if(K == 0) break;
}
if(K == 0){
cout << sum << endl;
return 0;
}
for(int i=0;i<B;i++){
K--;
if(K ==... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
if (a + b >= k)
{
cout<<min(a, k);
}
else
{
cout<<a-(k-a-b);
}
return 0;
} | 1 | 28,211,190 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int N,K;
string S;
cin>>N>>S>>K;
char k = S[K-1];
for (int i(0);i<N;i++){
if (S[i] == k) continue;
S[i] = '*';
}
cout << S << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
const int INF = (int)1e9;
const LL INFL = (LL)1e19;
const int MOD = 1... | 1 | 59,570,033 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define frr(j,i,n) for(int i=j;i<=n;++i)
using namespace std;
int n;
int a[100005];
int dp[100005];
int go(int index)
{
if(index>=n)
return 0;
... | #include<bits/stdc++.h>
#define MOD 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define forf(i,a,b) for(i=a;i<b;i++)
#define forr(i,a,b) for(i=a;i>b;i--)
#define mp make_pair
#define f first
#define s second
#define pb(x) push_back(x)
typedef long long int ll;
typedef std::vector<ll> vi;
#de... | 1 | 41,085,850 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<string>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<iomanip>
#define REP(i,n) for(int i=0;i<(n);i++)
#define EPS (1e-7)
#define INF (2e9)
using namespace std;
typedef long long int ll;
const ll ... | 1 | 70,452,554 |
#include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(void) {
io;
string a, t;
cin >> a >> t;
sort(a.begin(), a.end());
sort(t.rbegin(), t.rend());
cout << ((a < t)?"Yes"... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str1, str2;
bool chk = false;
int index = 0;
cin >> str1 >> str2;
sort(str1.begin(), str1.end());
sort(str2.begin(), str2.end(), greater<int>());
if(str1 < str2) cout << "Yes";
else cout << "No";
} | 1 | 47,452,727 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<pair<int64_t, int>> numb(n);
for (auto & x: numb) {
cin >> x.first >> x.second;
}
int64_t sum = 0;
for (int i = n - 1; i > -1; --i) {
numb[i].first += sum;
if (numb[i].firs... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | 1 | 55,337,195 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #include<bits/stdc++.h>
using namespace std;
int main()
{ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
if(k==n)
{
cout<<1<<endl;
}
else
{
if((n-1)%(k-1)... | 1 | 40,984,858 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main(){
int n, k; cin >> n >> k;
vector<int> a(n), b(n, 0);
for(int i = 0; i < n; i++){
scanf("%d", &a[i]);
}
for(int i = 0; i < min(k, 100); i++){
for(int j = 0; j < n; j++) b[j] = 0;
for(int j = 0; j < n; j++){
int left = max(0, ... | 1 | 4,242,228 |
#include <iostream>
#include <stack>
#define REP(i,n) for(int i = 1; i < n; i++)
using namespace std;
int main() {
REP(i,10){
REP(j,10){
cout << i << "x" << j << "=" << i*j << endl;
}
}
} | #include <iostream>
int main(void)
{
const int minNum = 1;
const int maxNum = 9;
for (int i = minNum; i <= maxNum; i++) {
for (int j = minNum; j <= maxNum; j++) {
std::cout << i << "x" << j << "=" << i * j << std::endl;
}
}
return 0;
} | 1 | 55,222,477 |
#include <bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
using ll=long long;
vector<bool> isprime(1000005);
void eratos(int n){
for(int i=0;i<n+1;i++){
isprime[i]=true;
}
isprime[0]=isprime[1]=false;
for(int i=2;i*i<=n;i++){
if(isprime[i]){
int j=i+i;
... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
... | 1 | 70,890,339 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
#define maxn 101000
int main()
{
int n,i;
scanf("%d%d",&n,&i);
printf("%d\n",n-i+1);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,i;
cin >> n >> i;
cout << n-i+1 << endl;
} | 1 | 28,239,753 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, K;
cin >> K >> A >> B;
int i = 0;
bool flag = false;
while (K * i <= B)
{
if (K * i >= A)
{
flag = true;
}
i++;
}
if (flag)
cout << "OK" << endl;
else
cout... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
#define INF 10000000000
#define PI 3.141592653589793
int main() {
int k, a, b;
string ans = "NG";
cin >> k >> a >> b;
for (int i = a; i < b + 1; i++) {
if (i%k == 0) {
ans = "O... | 1 | 24,466,191 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B,C;
cin >> A >> B >> C;
if(A<=C && C<=B) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
if (C >= A && B >= C) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 1 | 30,041,609 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main()
{
string s, t, u;
int a, b;
cin >> s >> t >> a >> b >> u;
if (s.compare(u) == 0)
a--;
else
b--;
cout << a << " " << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string color1,color2;
int no1,no2;
string color;
cin>>color1>>color2>>no1>>no2>>color;
if(color==color1){
cout<<--no1<<" "<<no2<<endl;
}
else cout<<no1<<" "<<--no2<<endl;
return 0;
} | 1 | 99,767,626 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
string s;
cin >> s;
if(s[2] == s[3] && s[4] == s[5]) {
cout << "Yes" << "\n";
} else {
cout << "No" << "\n";
}
return 0;
} | #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... | 1 | 80,019,219 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s.at(0) != 'A') {
cout << "WA" << endl;
return 0;
}
int n = s.size();
int count = 0;
for(int i=2; i<n-1; i++) {
if(s.at(i) == 'C') {
count++;
} else if(isupper(s.at(i))) {
cout << "WA" << endl;
... | #include<iostream>
using namespace std;
int main(){
string s;
cin>>s;
bool no=false;
if(s[0]!='A'){
no=true;
}
bool inside=false;
for(int i=1;i<s.size();i++)
{
if(s[i]>='A'&&s[i]<='Z'){
if(!inside&&s[i]=='C'&&(i>=2&&i<=s.size()-2)){
inside=true... | 1 | 60,383,254 |
#include<iostream>
using namespace std;
int main()
{
int n,c=1,d;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
d=a[0];
for(int i=1;i<n;i++)
{
if(a[i]<=d)
{
c++;
d=a[i];
}
}
cout<<c<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int p;
int num=200010;
int count=0;
for(int i=0; i<n; i++){
cin >> p;
if(p<=num){
count++;
num=min(num,p);
}
}
cout << count << endl;
} | 1 | 71,153,562 |
#include <iostream>
using namespace std;
int main() {
int s,h,n,i,a[5000];
while(true) {
cin >> n;
if (n==0) break;
for (i=0;i<n;i++) cin >> a[i];
s=0; h=-100000;
for (i=0;i<n;i++) {
s=(s+a[i]>=a[i]) ? s+a[i] : a[i];
h=(s > h) ? s : h;
}
cout << h << endl;
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int a[5000];
int main(){
int n;
while(true){
cin>>n;
if(n==0)
break;
long long best=-1000000000;
for(int i=0;i<n;i++)
cin>>a[i];
for(int start=0;start<n;start++){
long long count=0;
for(int len=start;len<n;len++){
count+=a[len];
best=max(best,count);
}
}
... | 1 | 14,022,949 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
int WA[105000];
bool AC[105000];
void solve() {
cin >> N >> M;
int WAnum = 0;
int ACnum = 0;
for(int i = 1; i <= N; i++) {
WA[i] = 0;
AC[i] = false;
}
while(M--) {
int p;
string S;
cin >> p >> S;
... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 1 | 60,992,603 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 1 | 18,170,573 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.