code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(... | #include <iostream>
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
ll res=1;
for(int i=1;i<=N;i++){
res*=(ll)i;
}
cout<<res<<endl;
return 0;
} | 1 | 93,905,248 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
const ll I... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int l=1,r=1e9,mid;
char s[5];
char Query(ll x){printf("? %lld\n",x);fflush(stdout);scanf("%s",s);return*s;}
void Answer(int x){printf("! %d\n",x);exit(0);}
void powten(){
int t=1;
while(true){
if(Query(t+1)=='Y')Answer(t);
t*=10;
}
exit(0);
}
in... | 1 | 54,168,773 |
#include <vector>
#include <bitset>
#include <limits>
#include <iostream>
long long solve(int n, int k, const std::vector<long long> & a) {
long long cost { std::numeric_limits<long long>::max() };
for (int i = 0; i < (1 << n); ++i) {
const std::bitset<15> bits(i);
if (bits.count() < k) {
... | #include <bits/stdc++.h>
using namespace std;
#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 Graph = vector<vector<int>>;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
int main() {
int n,k; cin >> n >> k;
vector<ll> a(n);
vector<ll> v... | 1 | 34,317,584 |
#include <stdio.h>
#define N (300010)
int n,a, b;
int ans[N];
int main(){
scanf("%d%d%d", &n, &a, &b);
if (a+b-1 > n || 1ll*a*b < n){
printf("-1\n");
return 0;
}
for (int t = 1; t <= b; ++t){
int c = n-1ll*t*a-(b-t-1);
if (c >= 1 && c <= a){
int cnt = n, pos =... | #include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <ctime>
#include <map>
#include <queue>
using namespace std; using ll=long long; using P=pair<ll,ll>; const int INF=1e9; const ll LNF=1e18;
int main(){
int n,a,b; cin>>n>>a>>b;
int c[n]; for(int i=0;i<n;i++) c[i]=i+1;
if (n<a||n... | 1 | 38,158,666 |
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstring>
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0' && ch<='9')x=x*10+ch-'0',ch=getchar();
return x*f;
}
int stack[20];
inline void write(... | #include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, int> P;
struct Graph
{
int n;
vector<vector<int>> g;
Graph(int n) : n(n){
g.resize(n);
}
void init(int n_){
n = n_;
g.resize(n_);
}
void add_edge(int fro... | 1 | 87,287,077 |
#ifdef LOCAL
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P>... | #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... | 1 | 78,417,120 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
static const double EPS = 1e-9;
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
int main(void){
vector<int> count;
... | #include<iostream>
#include<map>
using namespace std;
int main()
{
map<string,int> str;
map<string,int> :: iterator it;
string s,t1,t2;
int max1=0,max2=0;
while(cin >> s)
{
str[s]++;
if(s.size()>max1)
{
max1 = s.size();
t1 = s;
}
if... | 1 | 84,138,210 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
auto f = [](int x) {
cout << x << '\n';
cout << flush;
string s;
cin >> s;
if (s == "Vacant") {
exit(0);
} else if (s == "Male") {
return 0;
} else {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int begin = 0;
int end = 2*N-2;
int query;
bool flag = true;
string S;
cout << 0 << endl;
fflush(stdout);
cin >> S;
if(S == "Vacant"){
flag = false;
}
while(flag){
string T;
query = (begin + end)/2;
if(qu... | 1 | 79,448,194 |
#include <iostream>
#include <ctype.h>
using namespace std;
int main(void){
char a;
cin >> a;
bool oomoji = isupper(a);
if(oomoji){
cout << "A" << endl;
}
else{
cout << "a" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | 1 | 28,778,963 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;
typedef pair<ll,ll> pll;
#define reps(i,f,n) for(int i = int(f); i <= int... | #include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#include<fstream>
#define FOR(i, a, b) for( int... | 1 | 42,727,609 |
#include <iostream>
#include <vector>
int main(){
std::vector<int> vehicle_order;
int input_data;
while(std::cin >> input_data){
if(input_data == 0){
std::cout << vehicle_order.back() << std::endl;
vehicle_order.pop_back();
}else{
vehicle_order.push_back(input_data);
}
}
return 0;
} | #include <stdio.h>
int main() {
int temp[10];
int input;
int i = 0;
while(scanf("%d", &input) != EOF) {
if(input != 0) {
temp[i] = input;
i++;
}
else {
i--;
printf("%d\n", temp[i]);
}
}
return 0;
} | 1 | 86,034,077 |
#include <cstdio>
#include <cstring>
#define MAXN 100000000
int mins(int a,int b){
if(a<0)return b;
else if(b<0 || a<b)return a;
else return b;
}
int main(void){
int i=0,j=0,k=0;
int e=0;
scanf("%d",&e);
while(e!=0){
int gl[10][10]={0};
int ma=0;
for(i=0;i<10;i++){
for(j=0;j<10;j++){
gl... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <com... | 1 | 42,492 |
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 105;
const int M = 10005;
const long long lim = 2000000000;
const long long inf = 0x3f3f3f3f3f3f3f3f;
long long G[N][N];
long long min(int a, long long b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (int)(b); i--)
#define all(x) (x).begin(), (x).end()
using i32 = int32_t;
using i64 = int64_t;
using f32 = float;
using f64 = double;
using P = pair<int, int>;
template ... | 1 | 55,302,578 |
#include<iostream>
#include<cstdlib>
#include<utility>
#include<tuple>
#include<string>
#include<vector>
#include<numeric>
#include<algorithm>
#include<queue>
#include<deque>
#include<bitset>
#include<cmath>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long int;
const ll mod = 1e9 + 7;
#define r... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | 1 | 36,453,112 |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #include<bits/stdc++.h>
#define ll long long int
#define db long double
#define ull unsigned long long int
#define F first
#define S second
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
#define Nmax 1000005
#define MOD 1000000007
#define MAXN 200005
using namespace std... | 1 | 68,867,829 |
#include<stdio.h>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inc... | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int n;
double x1, y1, x2, y2, x3, y3, x4, y4;
double da;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
da = (y2 - y1) * (x4 - x3) - (y4 - y3) * (x2 - x1);
... | 1 | 76,956,303 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RA... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
struct Point {
double x, y;
};
double len(Point p1, Point p2) {
return sqrt((p1.x - p2.x)*(p1.x - p2.x) + (p1.y - p2.y)*(p1.y - p2.y));
}
double area(Point *points) {
double a = len(points[0], points[1]);
do... | 1 | 85,638,153 |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()
vector<bool> seen;
vector<int> counter;
template <typename T>
void cout_vector(vector<T> A)
{
for (T a : A)
cout ... | 1 | 59,368,176 |
#include <stdio.h>
int main(){
int a[10000],k,l;
l =0;
while(1){
scanf("%d",&k);
if(k == 0){
break;
}
a[l]=k;
l++;
}
for(k=0;k<l;k++){
printf("Case %d: %d\n",k+1,a[k]);
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x,i=1;
while(cin>>x && x != 0)
cout<<"Case "<<i++<<": "<<x<<endl;
return 0;
} | 1 | 14,615,172 |
#include <iostream>
#include <cstdio>
#include <set>
using namespace std;
int main(void){
char s[13];
char b[7];
std::set<string> m;
int a;
scanf("%d",&a);
while(a--){
scanf("%s %s",b,s);
if(b[0]=='i')m.insert(s);
else{
if(m.find(s)!=m.end())cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
}
return 0;
... | #include <iostream>
#include <cstring>
using namespace std;
static const int MAX = 1000003;
static const int STRLEN = 13;
static const int CMDLEN = 7;
static const int KEYLEN = 14;
char H[MAX][KEYLEN];
int h1(int key) {
return key % MAX;
}
int h2(int key) {
return 1 + (key % (MAX - 1));
}
int getChar(char c) {
... | 1 | 80,893,594 |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define rep... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#include<functional>
#define INF 1000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using n... | 1 | 41,483,912 |
#include <bits/stdc++.h>
#define mp make_pair
#define ff first
#define ss second
using namespace std;
using vi=vector<int>;
using pii=pair<int, int>;
using ull=unsigned long long;
using ll=long long;
int m[3][3];
bool ac[3][3];
bool verify()
{
for (int i = 0; i < 3; i++)
if (ac[i][0] == 1 && ac[i][1] == 1 && ac[i][2... | #include<iostream>
using namespace std;
int main()
{
long long i,j,a[5][5],n,k,x,r[5]={0},c[5]={0},l,f=0,h=0,d=0;
for(i=1;i<=3;i++)
{
for(j=1;j<=3;j++)
{
cin>>a[i][j];
}
}
cin>>n;
for(k=1;k<=n;k++)
{
cin>>x;
for(i=1;i<=3;i++)
{
... | 1 | 45,624,159 |
#include<math.h>
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long int
#define py printf("Yes\n")
#define pn printf("No\n")
#define in cin>>
using namespace std;
const int INF = 1001001001;
int main()
{
int n,d,x,ans=0;
in n>>d>>x;
vector<i... | #include <bits/stdc++.h>
using namespace std;
int n,x,a[150],d,sum,k,s;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>d>>x;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=d;j++){
sum=0;
sum+=(j*a[i]+1);
if(sum<=d)k++;
}}
s+=k;
s+=n;
... | 1 | 34,470,592 |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main()
{
int a,m;
while(~scanf("%d",&a))
{
m=a/3;
printf("%d\n",m);
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
const double PI = 3.14159265... | 1 | 100,107,793 |
#include <iostream>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a==b)
cout<<"Draw";
else if(a==1)
cout<<"Alice";
else if(b==1)
cout<<"Bob";
else if(a>b)
cout<<"Alice";
else if(b>a)
cout<<"Bob";
return 0;
... | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A == B) cout << "Draw" << endl;
else {
if (A == 1 || B == 1) cout << (A == 1 ? "Alice" : "Bob") << endl;
else cout << (A > B ? "Alice" : "Bob") << endl;
}
} | 1 | 11,000,701 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i,n,s) for (int i= (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
int main(){
cin.tie... | 1 | 58,017,328 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main()
{
int h,w;
cin >> h >> w;
string s[h];
for (int i = 0; i < h;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srep... | 1 | 85,329,573 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k, s, sum=0;
cin >> k >> s;
for(int x=0; x <= k; x++){
if(x > s) break;
for(int y=0; y <= k; y++){
if((x+y) > s) break;
if((s-(x+y)) <= k) sum++;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int answer = 0;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
int z = s - x - y;
if (0 <= z && z <= k) answer++;
}
}
cout << answer;
} | 1 | 11,320,470 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
map<int,int> ac;
map<int,int> wa;
int n,m;
cin >> n >> m;
rep(i,m){
int p;
string s;
cin >> p >> s;
if(s=="AC... | #include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long U... | 1 | 82,078,708 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cnt(n + 1);
for (int i = 2; i <= n; ++i) {
int p = i;
for (int j = 2; j * j <= p; ++j) {
while (p % j == 0) {
++cnt[j];
p /= j;
}
}
if (p > 1) {
++cnt[p];
}
}
vector<... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
map<int,int>a;
set<int>b;
for(int i=2;i<=n;++i){
int m=i;
for(int j=2;j*j<=m;++j){
if(m%j==0){
b.insert(j);
while(m%j==0){
m/=j;
a[j]... | 1 | 18,586,552 |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (long long i=0; i < (n); ++i)
#define rep2(i,n,m) for(long long i=n;i<=m;i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b)... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define sz size
#define se second
#define fe first
#define mper make_pair
#define all(x) x.begin(), x.end()
#define mal ios_base::sync_with_stdio(NULL);cin.tie(NULL);cout.tie(NULL);
#define saken string
#define erba continue
#define vl vector<ll>
#defin... | 1 | 18,938,823 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<x<<endl
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const ll inf = 1e18;
const int N = 2e5 + 10;
int main(){
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int w,h;
cin>>w>>h;
char g[w][h];
for(int i=0;i<w;i++)
for(int j=0;j<h;j++)
cin>>g[i][j];
int row_present[w]={0};
int col_present[h]={0};
for(int i=0;i<w;i++)
{
int c=0;
for(int j=0;j<h;j++)
{
if(g[i][j]=='.')
c++;
}
if(c==h) row_... | 1 | 26,262,954 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 999999999
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define SORT(c) sort((c).begin(),(c).end())
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef p... | #include "bits/stdc++.h"
#define debug(x) cout<<#x<<": "<<x<<endl
#define rep(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<=(b);i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef long long ll;
void solve() {
#ifdef _WIN32
... | 1 | 94,684,629 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> num(N);
for (int i = 0; i < N; i++) {
cin >> num.at(i);
}
sort(num.begin(), num.end());
vector<int> a(N);
int count = 0;
int check = num.at(0);
for(int i = 0; i < N; i++) {
if (num.at(i) == check)... | #include<iostream>
#include<algorithm>
using namespace std;
int N_MAX = 200000;
int main()
{
int n,k,a,i,res=0;
int c[N_MAX];
cin >> n >> k;
fill(c,c+n,0);
for(i=0;i<n;i++){
cin >> a;
c[a-1]++;
}
sort(c,c+n,greater<int>());
for(i=0;i<k;i++)
res+=c[i];
res=n-res;
cout << res << endl;
re... | 1 | 80,616,755 |
#include<iostream>
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define M 998244353
#define inarr(arr,n); for(ll i=0;i<n;i++) cin >> arr[i];
#define outarr(arr,n); for(ll i=0;i<n;i++) cout<<arr[i]<<" ";
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
us... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n>> k;
if(n<=k)cout << "unsafe" <<endl;
else cout <<"safe" <<endl;
} | 1 | 18,343,547 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
char b;
cin >> b;
if(b == 'A')
cout << "T" << "\n";
if(b == 'T')
cout << "A" << "\n";
if(b == 'C')
cout << "G" << "\n";
if(b == 'G')
cout << "C" << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{char b; cin >> b;
string s = "ACGT";
cout << "TGCA"[find(s.begin(), s.end(), b) - s.begin()] << endl;} | 1 | 71,752,768 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ALL(a) (a).begin(),(a).end()
#define pb(x) push_back(x)
#define ms(m,v) memset(m,v,sizeof(m))
#define D10 fixed<<setprecision(10)
typedef vector<int> vi;
typedef ve... | #include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<set>
#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++)... | 1 | 50,050,309 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
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
template <typename T>
T square(T x) { retu... | #include <iostream>
using namespace std;
int N;
int M;
int main(){
cin >> N >> M;
cout << (N * (N - 1) / 2) + (M * (M - 1) / 2);
} | 1 | 11,887,900 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.size() < 4) cout << "No" << endl;
else if (S.substr(0, 4) != "YAKI") cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = true;
string yaki = "YAKI";
if (S.size() < 4) {
flag = false;
} else {
for (int i; i < 4; i++) {
if (S.at(i) != yaki.at(i)) {
flag = false;
}
}
}
if (flag) {
cout << "Yes" << ... | 1 | 66,366,118 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 1 | 31,931,080 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, uint>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
const int CASES = 2;
void solve(){
int N, K; cin >> N >> K;
vector<ll> A(N);
for(int i = 0; i < N ; ++i) cin >> A[i];
vector<l... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 1005;
LL sum[maxn];
LL v[maxn * (maxn - 1) / 2];
bool vis[maxn * (maxn - 1) / 2];
bitset<45> p[maxn * (maxn - 1) / 2];
LL num[50];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("... | 1 | 54,698,991 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, z, w;
cin >> n >> z >> w;
vector<int64_t> a(n + 1, w);
for (auto i : irange(0L, n)) {
cin >> a[i + 1... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include<algorithm>
#include<sstream>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll MOD_CONST = 1000000007;
const ll BIG_NUM = 1000000000000000000;
int main() ... | 1 | 46,550,954 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, num;
vector< int > a;
while( 1 ) {
cin >> n;
if( n == 0 ) break;
int Max = -100001;
a.push_back( 0 );
for( int i = 0; i < n; i++ ) {
cin >> num;
a.push_back( num );
}
for( int i = 1; i <= n; i++ ) ... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) REP (i, 0, n)
#define mset(a, n) memset(a, n, sizeof(a))
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
const int INF = 10000000... | 1 | 25,746,532 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<utility>
#include<algorithm>
#include<stack>
#include<queue>
#define numof(array) (sizeof (array) / sizeof *(array))
using namespace std;
#define INF (1 << 29)
static const int dx[] = {1, 0, -1, 0};
static const int dy[] = {0, ... | #include <iostream>
#include <queue>
#define MAX 1005
#define INF 100000000
using namespace std;
typedef struct{
int x;
int y;
int state;
} Mouse;
int H,W,N;
int start_x,start_y;
char ar[MAX][MAX];
int offset_x[4] = {1,0,-1,0};
int offset_y[4] = {0,1,0,-1};
int ans[MAX][MAX];
void init(){
for(int i = 0;... | 1 | 85,977,344 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define MAX_VIL_NUM 10
using namespace std;
int main(void){
int n, a, b, c, i, j, con[MAX_VIL_NUM][MAX_VIL_NUM], used[MAX_VIL_NUM], distance[MAX_VIL_NUM], sum, ans_time, ans_vil, vil_num;
while(1){
scanf("%d",&n);
if(n == 0){
break;
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int inf=0x3f3f3f3f;
int map[15][15];
void floyd(int n)
{
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
{
for(int k=0;k<n;++k)
{
map[j][k]=min(map[j][k],map[j][i]+map[i][k]);
}
}
}
}
void init(int n)
... | 1 | 46,139,180 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N;
cin >> N;
vector<int> vec(N);
REP(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define INF 1000000000
int main() {
int n,ans=0,M=-1;
cin >> n;
vector<int> H(n);
rep(i,n) cin >> H.at(i);
rep(i,n){
... | 1 | 40,342,289 |
#include <iostream>
#include <cstring>
using namespace std;
int ans = 0, array[100],mini;
void BubbleSort(int A[], int n) {
for (int i = 0; i < n; i++) {
mini=i;
for (int j = i; j < n; j++) {
if (A[j]<A[mini])
mini = j;
}
swap(A[i],A[mini]);
if (i!... | #include <iostream>
using namespace std;
int A[100], N, times = 0;
void selectionSort(int A[], int N);
void print(int A[], int N);
int main()
{
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
selectionSort(A, N);
print(A, N);
}
void selectionSort(int A[], int N)
{
int temp = 0;
int minj;
for (int i = 0; i <... | 1 | 10,599,474 |
#include <iostream>
int main() {
int n;
while (std::cin >> n) {
int c = 0;
for (int i = 0; i <= 9; i++)
for (int j = 0; j <= 9; j++)
for (int k = 0; k <= 9; k++)
for (int l = 0; l <= 9; l++)
if (i + j + k + l == n)
c++;
std::cout << c << std::endl;
}
} | #include<iostream>
using namespace std;
int main(){
int n;
int comb[4][51] = {0};
for(int i=0; i<10; i++){
comb[0][i] = 1;
}
for(int i=1; i<4; i++){
for(int j=0; j<9*i+10; j++){
for(int k=0; k<10; k++){
if(j-k>=0){
comb[i][j] += comb[i-1][j-k];
}
}
}
}
whi... | 1 | 86,443,119 |
#include <iostream>
#include <vector>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <map>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
cin >> n;
cout << ((n + 2 - 1) / 2) - 1 << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<(n-1)/2;
} | 1 | 7,011,203 |
#include <stdio.h>
int main(void){
int hight = 0;
int width = 0;
int x = 0;
int y = 0;
int r = 0;
scanf("%d %d %d %d %d",&hight,&width,&x,&y,&r);
bool isYes = true;
if( (hight < (x+r)) || (width < (y+r)) || ((x-r) < 0) || ((y-r) < 0) ){
isYes = false;
}
if(isYes != false)... | #include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main()
{
string str;
getline(cin, str);
vector<string> vStr;
while (str.find(' ') != -1)
{
vStr.push_back(str.substr(0, str.find(' ')));
str.erase(0, str.find(' ') + 1);
... | 1 | 10,119,632 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, ans = 0;
cin >> n;
vector<string> vs(n);
int a_cnt, b_cnt, ba_cnt;
a_cnt = b_cnt = ba_cnt = 0;
for (int i = 0; i < n; i++) {
cin >> vs[i];
string &s = vs[i];
for (int i = 0; i < s.size() - 1; i++) {
... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 1 | 92,248,521 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s[5] != '0' || s[6] > '4')
cout << "TBD" << endl;
else cout << "Heisei" << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
template <class T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return fa... | 1 | 77,072,847 |
#include <iostream>
#include <list>
using namespace std;
int main(void){
list<int> int_list;
int n;
cin >> n;
string str;
for(int i = 0; i < n; i++)
{
cin >> str;
if(str == "insert")
{
int x;
cin >> x;
int_list.push_front(x);
}
... | #include <iostream>
using namespace std;
class Node {
friend class List;
private:
int num;
Node *prev;
Node *next;
public:
Node(int n, Node *x, Node *y);
};
class List{
private:
Node *head;
Node *tail;
public:
List();
void Insert(int x);
void Delete(int x);
void deleteFirst()... | 1 | 37,860,651 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF=INT_MAX/4;
const long long MOD=998244353;
const double EPS=1e-14;
const bool DEBUG=false;
const string YES = "YES";
const string NO = "NO";
const string Yes = "Yes";
const string No = "No";
template<cl... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 1 | 53,741,774 |
#include<bits/stdc++.h>
#include<cstring>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define ps(x,y) fixed<<setprecision(y)<<x
#define arr(a,n) int n... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
using P = pair<int,int>;
using ll = long long;
using namespace std;
int main(void){
int n, k;
cin >> n >> k;
int d[k];
int a[k][n];
rep(i, k){
cin >> d[i];
rep(j, d[i]){
cin >> a[i][j];
... | 1 | 80,787,895 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define rep(i, n) for(int i =0 ; i < n; ++i)
#define Rep(i,a,b) for(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 1 | 31,041,820 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) {
ll tmp_a = 0;
cin >> tmp_a;
a[i] = tmp_a - ( i + 1 );
}
sort(a.begin(), a... | 1 | 86,956,820 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int R,G;
cin >> R >> G;
double x = 2 * G - R;
cout << x << endl;
} | 1 | 93,293,005 |
#include <iostream>
#include <vector>
using namespace std;
const int lim = 100005;
int main(){
int n;
cin >> n;
vector<int> a(lim, 0);
for(int i = 0; i < n; i++){
int a1;
cin >> a1;
a[a1]++;
}
for(int i = 0; i < lim; i++){
if(a[i] != 0){
a[i] = 2-a[i]%... | #include <bits/stdc++.h>
#define max 100010
using namespace std;
int q_sort(int d[],int left,int right){
if(left >= right) return 0;
int pipot = d[(left+right)/2], l = left, r = right, tmp;
while(l<r){
while(d[l] < pipot) l++;
while(d[r] > pipot) r--;
if( l <= r){
tmp = d[l];
d[l] = d[r];
d[r] = tmp;... | 1 | 22,995,127 |
#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;
ll K;
cin >> K;
int N = S.length();
ll ans = 0;
vector<pair<char, ll>> a;
for (int i = 0; i < N-1; i++) {
ll temp = 0;
cha... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string s;
ll k;
cin >> s >> k;
ll n =... | 1 | 2,144,742 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n,m,a,b;
cin>>n>>m;
bool ans[n]={};
for(int i=0;i<m;i++){
cin>>a>>b;
ans[a-1]=!ans[a-1];
ans[b-1]= !ans[b-1];
}
for(int i=0;i<n;i++){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); ++i)
#define repr(i, a, b) for (int i=a; i<(b); ++i)
#define reprev(i, n) for (int i=n-1; i>=0; --i)
#define reprrev(i, a, b) for (int i=b-1; i>=(a); --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cout << fixed <... | 1 | 76,071,522 |
#include <cstdio>
#include <stack>
using namespace std;
int main() {
stack<int> q;
while (true) {
int n;
if (scanf("%d", &n) == EOF)
break;
if (n) {
q.push(n);
} else {
printf("%d\n", q.top());
q.pop();
}
}
return 0;... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<sstream>
#include<stack>
using namespace std;
int main(){
stack<int> train;
int a;
while(cin>>a){
int now;
if(a==0){
now=train.top();
train.pop();
cout<<now<<endl;
}
else {
train.push(a);
}
}
ret... | 1 | 10,352,522 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define rrep(i,n) for (int i = (n - 1);i >= 0;i--)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
cin.tie(0);
ios::sync_with_std... | #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#def... | 1 | 45,840,945 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vl;
typedef vector<vector<long long>> vvl;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<string> vs;
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define rep2(i,x,n) for(ll i = (ll) x; i < (ll) n... | 1 | 51,216,281 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w;
cin >> n >> h >> w;
int ans = 0;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
if(a < h) continue;
if(b < w) continue;
ans++;
}
cout << ans << endl;
} | #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... | 1 | 79,228,991 |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
using namespace std;
#define rip(i, n, s) for (int i = (s);i < ( int )( n ); i++)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
int main(){
int n,k;
cin >> n >> k;
vector<ll> da(n);
rip(i,n,0){
cin >> da[i];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n,k;
cin >> n >> k;
ll a[n];
ll psum[n+1];
ll msum[n+1]... | 1 | 28,398,445 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin>>a>>b;
if(b==1)
cout<<"0";
else
cout<<a-b;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
if(k==1)
{
cout<<"0"<<endl;
return 0;
}
int tmp = n - k;
cout<<tmp<<endl;
return 0;
} | 1 | 12,651,709 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;cin>>n;
if(n>=2800)cout<<"AGC"<<endl;
else if(n>=1200)cout<<"ARC"<<endl;
else cout<<"ABC"<<endl;
return 0;
} | 1 | 12,188,247 |
#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<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>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 1 | 63,153,091 |
#include<iostream>
int sum[2];
int main(){
for(int i=0;i<2;i++){
for(int j=0,a;j<4;j++){
std::cin>>a;
sum[i]+=a;
}
}
std::cout<<std::max(sum[0],sum[1])<<std::endl;
return 0;
} | #include<iostream>
using namespace std;
int main ()
{
int a=0,b=0;
for(int i=0;i<4;i++)
{
int q;
cin>>q;
a+=q;
}
for(int i=0;i<4;i++)
{
int q;
cin>>q;
b+=q;
}
if(a>b)cout<<a<<endl;
else cout<<b<<endl;
return 0;
} | 1 | 35,860,596 |
#include<iostream>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max = 1e3 + 7;
int ls1[Max], ls2[Max];
int n;
int main()
{
string s, t;
cin >> s >> t;
for (int i = 0; i <= s.size() - 1; i++)
{
ls1[i] = s[i] - 'a' + 1;
}
for (int i = 0; i <= t.size() - 1... | #include <stdio.h>
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
using namespace std;
#define print(x) cout<<(x)<<endl
#define prints(x, y) cout<<(x)<<" "<<(y)<<endl
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#defi... | 1 | 91,764,936 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e19;
int main(){
int a,b;
cin >> a >> b;
cout << (a<=8 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll A, B;
cin >> A >> B;
if (A <= 8 && B <= 8) printf("Yay!\n");
else printf(":(\n");
return 0;
} | 1 | 48,703,150 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0, M = 0;
cin >> N >> M;
if(N*500 >= M){
cout << "Yes";
}
else{
cout << "No";
}
} | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cstring>
#include <climits>
using namespace std;
#define ll long long
#define FOR(i,n) for(int i=0;i<n;i++)
#define sz... | 1 | 66,506,697 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#include<numeric>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
int main()
{
int N; cin >> N;
vector<int> c(N), s(N), f(N);
for(int i=0; i<N-1; i++) cin >> c[i] >> s[i] >> f[i];
f... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 100000000000000
int main(){
int n;cin>>n;
vector<int> c(n-1),s(n-1),f(n-1);
for(int i=0;i<n-1;i++){
cin>>c[i]>>s[i]>>f[i];
}
vector<int> ans(n,0);
for(int i=0;i<n;i++){
ans[i]=s[i]+c[i];
}
for(int i=0;i<n-2;i++){
for(int j=i+1;j... | 1 | 7,755,292 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" <<... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const i... | 1 | 24,557,939 |
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define REP(i, n) for(int i = 1; i < (int)(n); ++i)
using namespace std;
int main() {
string S;
long long K;
cin >> S >> K;
vector<int> renzoku;
int cnt = 1;
REP(i, S.size()) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 1 | 4,501,759 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DEBUG 1
#if DEBUG
#define DUMP(a) REP(_i, a.size()) cout << a[_i] << (_i + 1 == a.size() ? "\n" : " ")
#define DUMP2D(b) REP(_j, b.size())... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v... | 1 | 9,118,039 |
#include <iostream>
int main(void)
{
int w, h, x, y, r;
std::cin >> w;
std::cin >> h;
std::cin >> x;
std::cin >> y;
std::cin >> r;
if (x < r || x > w - r || y < r || y > h - r) {
std::cout << "No" << std::endl;
} else {
std::cout << "Yes" << std::endl;
}
return 0;... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
type... | 1 | 81,080,510 |
#include <bits/stdc++.h>
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
using namespace std;
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor,int number,int degree){
if(floor==degree){
fspattern.at(fspcnt) = fspattern_draft;
fspcnt++;
}else... | #include<iostream>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if(a == b)
cout << c;
if(b == c)
cout << a;
if(a == c)
cout << b;
return 0;
} | 1 | 46,097,110 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
using namespace std;
int N;
vector < pair <int, int> > v;
long double maxAns;
inline bool cmp(const pair <int, int> A, const pair <int, int> B)
{
return atan2(A.second, A.first) < atan2(B.second, B.first);
}
int main()
{
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; i... | 1 | 55,755,942 |
#include <iostream>
using namespace std;
int main() {
int count = 0;
int input;
while(1){
count++;
cin >> input;
if(input == 0){
break;
}
cout << "Case " << count << ": " << input << endl;
}
} | #include <stdio.h>
int main()
{
int a;
int b = 0;
while(1)
{
b++;
scanf("%d",&a);
if(a==0) break;
printf("Case %d: %d\n",b,a);
a = 0;
}
return 0;
} | 1 | 68,571,657 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
ll l, r;
cin >> l >> r;
if (r -... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MX = 1e10 + 10;;
unsigned long long fac[1000010];
#include <math.h>
#define PI 3.14159265358979323846264338327950L
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
long lon... | 1 | 2,819,096 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s; cin >> s;
char B[26]{0};
for (int i = 0; i < s.size(); ++i)
B[s[i]-'a']++;
for (int i = 0; i < 26; ++i)
if (!B[i])
{
cout << char(97+i) << endl;
return 0;
}
cout << "None" << endl;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 1 | 88,475,992 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,... | #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
#define ll long long
#define inf 1999999999
#define pa pair<int,int>
using namespace std;
int nibun(int a[],int d,int l,int h){
if(h-l<=1 && a[h]>d) return l;
else if(h-l<=1) ret... | 1 | 55,748,749 |
#include<iostream>
using namespace std;
void message(int, int, int);
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a < b)
{
if (b < c) message(a, b, c);
else
{
if (a < c) message(a, c, b);
else message(c, a, b);
}
}
else
{
if (a < c) message(b, a, c);
else
{
if (b < c) message(b, c, a... | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(3);
std::cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
for (int i = 0; i < 3; i++) {
if(i != 2)std::cout << a[i] << " ";
else std::cout << a[i] << std::endl;
}
return 0;
} | 1 | 88,413,554 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int N;
ll K;
vector<int> A, B;
void input() {
cin >> N >> K;
A = B = vector<int>(N);
rep(i, N) cin >> A[i] >> B[i];
}
int main() {
input();
vector<P> w;
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 1 | 64,099,184 |
#include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=n-1; i>=m; i--)
#define all(x) (x).begin(),(x).end()
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#defi... | #include <iostream>
#include <cstdio>
using namespace std;
long long x, y;
int main()
{
cin >> x >> y;
cout << ((x - y) > 1 || (x - y) < -1 ? "Alice" : "Brown") << endl;
return 0;
} | 1 | 9,229,778 |
#include <bits/stdc++.h>
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a) ; i < (int)(b) ; i++)
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
struct Vector{
double x, y;
};
template<class T> inline bool chmin(T& a, T b) {
... | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | 1 | 94,866,290 |
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define swap(a,b) tmp=ver[b], ver[b]=ver[a], ver[a]=tmp;
int main(){
double x1, y1, x2, y2, x3, y3, xp, yp;
double p, q, r;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>xp>>yp){... | #include<iostream>
using namespace std;
int main(){
double x1, y1, x2, y2, x3, y3, px, py;
double det, s, t;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> px >> py){
det = ((x2 - x1) * (y3 - y1)) - ((x3 - x1) * (y2 - y1));
if(det == 0){
cerr << "行列式の値が0です" << endl;
return -1;
}
s = (((y3 - y1) * (px... | 1 | 10,171,059 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
int ans=1000;
cin>>s;
for(int i=0;i<s.size()-2;i++){
if(abs(753-((s[i]-'0')*100+(s[i+1]-'0')*10+s[i+2]-'0'))<ans){
ans=abs(753-((s[i]-'0')*100+(s[i+1]-'0')*10+s[i+2]-'0'));
}
}
cout<<ans<<... | #include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
std::cin >> s;
int minv = 1000;
for (int i = 0; i < s.size() - 2; ++i) {
minv = min(minv, abs(stoi(s.substr(i, 3)) - 753));
}
std::cout << minv << std::endl;
retu... | 1 | 16,808,327 |
#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>;
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
const int INF = 1e9;
int main()
{
int n;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, int num=0){
if(num == 0) num = (int)v.size();
if(is_reverse) for(int i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(int i=0; i<num; i++){ cout<<v[i]; ... | 1 | 86,789,537 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,h,ans=0;
cin >> n >> h;
vector<long> a(n);
vector<long> b(n);
for(long i=0;i<n;i++) cin >> a[i] >> b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
for(long i=n-1;i>=0;i--) {
if(b[i]<a.back()) break;
ans++;
h-=b[i];
... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 1 | 82,911,490 |
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define rep(i,n) for (int i=0;i<n;i++)
int main(){
int N; int64_t K; cin >> N >> K;
vector<pair<int, int>> ab;
int a, b;
rep(i,N){
cin >> a >> b;
ab.push_back(make_pair(a,b));
}
sort(ab.begin(),ab.end());
int64_t sum=0;
rep(i,N){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define all(x) (x).begin(), (x).end()
#define rall(x) r... | 1 | 91,803,168 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
bool vis[200005];
vector<int> vec[2000005], v1;
int child[2000005];
int parent[2000005];
int div1[100005];
int min_indx[900005];
int count1 = 0;
int height = 0;
int max_indx[200005];
void dfs(int node)
{
vis[... | #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 a, b;
cin >> a >> b;
if(a > 8 || b > 8){
cout << ":(";
}
else{
cout << "Yay!";
}
return 0;
} | 1 | 10,632,996 |
#include <iostream>
using namespace std;
int main (){
int a,b,c;
cin>>a>>b>>c;
if (a==b&a!=c){
cout<<c;
}
else if (a==c&a!=b){
cout<<b;
}
else if (b==a&b!=c){
cout<<c;
}
else if (b==c&b!=a){
cout<<a;
}
else if (c==a&c!=b){
cout<<b;
}
else if (c==b&c!=a){
cout<<a;
}
return 0;
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 1 | 92,263,882 |
#include <bits/stdc++.h>
using namespace std;
int bunbun(string s){
string t = s;
reverse(t.begin(), t.end());
return s == t;
}
int main() {
string S;
cin >> S;
int N = S.size();
bool a = true;
if (!bunbun(S)) a = false;
if (!bunbun(S.substr(0, S.size() / 2))) a = false;
cout << ... | #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(void){
string s;
cin >> s;
int n = s.size();
bool ok = true;
int a = n / 2;
rep(i,a) if(s[i] != s[n-1-i]) ok = false;
int b = (n-1)/2;
int c = b / 2;
rep... | 1 | 14,020,935 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include <iostream>
using namespace std;
int main(void){
int a,b,z;
cin>>a>>b;
z=a+b;
if(z%2==0){
cout<<z/2<<endl;
}
else if(z%2>0){
cout<<z/2+1<<endl;
}
else{
cout<<z/2<<endl;
}
} | 1 | 78,288,003 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, l;
cin >> n >> l;
vector< string > v(n);
for(int i = 0; i < n; ++i) cin >> v[i];
sort(v.begin(),v.end());
for(auto x: v) cout << x;
} | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x)... | 1 | 37,868,135 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 1 | 98,099,937 |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
long long ans=n-1;
ans=ans*(ans+1)/2;
cout<<ans;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 1 | 23,335,961 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.