text stringlengths 49 983k |
|---|
#include<bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin >> s;
bool check = false;
for(int i = 0;i < s.size() - (s.size()-7);i++){
string t,t1,t2;
t1 = s.substr(0,i);
t2 = s.substr(i+s.size()-7);
t = t1 + t2;
if(t == "keyence")check = true;
}
if(check == true)cout << "YES";
else cout << "NO";
} |
#include <bits/stdc++.h>
using namespace std;
int n, m, a[4];
string s;
int main()
{
cin >> s;
string u;
n = s.size();
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (i > j)
continue;
u = s.substr(0, i) + s.substr(j, n - j);
if (u == "keyence")
{
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
string T="keyence";
for(int i=0;i<=7;i++){
if(S.substr(0,i)==T.substr(0,i) && S.substr(S.size()-7+i,7-i)==T.substr(i,7-i)){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str;
cin >> str;
for(int i = 0; i <= 7; ++i){
string str2 = str.substr(0, i) + str.substr(str.size()-7+i, 7-i);
if (str2.compare("keyence") == 0){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
|
#include <string>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
bool keyence = false;
for (int i = 0; i <= 7; ++i) {
if (s.substr(0, i) + s.substr(n - (7 - i)) == string("keyence")) {
keyence = true;
}
}
cout << (keyence ? "YES" : "NO") << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string k="keyence";
bool tf=false;
for (int i = 0; i < 7; i++){
if(s.substr(0,i)==k.substr(0,i) && s.substr(s.length()-7+i,7-i)==k.substr(i,7-i)){
tf=true;
}
}
if(tf){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
} |
#include <iostream>
#include <string>
using namespace std;
int main() {
string S, F="keyence"; cin >> S;
int a, b=0;
for(a=0; a<7; ++a) if(S[a]!=F[a]) break;
for(b=0; b<7; ++b) if(S[S.size()-1-b]!=F[6-b]) break;
if(a+b<7) cout << "NO" << endl;
else cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main()
{
string s;
cin>>s;
if(s=="keyence"){
cout<<"YES"<<endl;
return 0;
}
for(int i=0;i<s.size();i++){
for(int j=i;j<s.size();j++){
string x=s.substr(0,i)+s.substr(j+1);
if(x=="keyence"){
cout<<"YES"<<endl;
return 0;
}
}
}
cout<<"NO"<<endl;
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
int main(void)
{
string s;
cin >> s;
int n = s.length();
bool flag = false;
for (int i = 0; i <= 7; ++i)
{
if (s.substr(0, i) + s.substr(n - (7 - i)) == string("keyence"))
flag = true;
}
cout << (flag ? "YES" : "NO") << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
char s[1234567];
char t[10]="keyence";
int main(){
scanf("%s",s);
int n=strlen(s);
if (n<7) {puts("NO");return 0;}
int l=0;
while (l<7&&s[l]==t[l]) l++;
int r=0;
while (r<7&&s[n-1-r]==t[6-r]) r++;
if (l+r>=7) puts("YES"); else puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
int main() {
std::string s; cin >> s;
for(int i = 0; i <= s.size(); i++) {
for(int j = i; j < s.size(); j++) {
std::string t = s.substr(0, i) + s.substr(j, s.size() - j);
if(t == "keyence") {
printf("YES\n");
return 0;
}
}
}
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;
cin >> s;
bool ch = false;
for(int i = 0; i < (int)s.size()-1; i++){
for(int j = i; j < (int)s.size(); j++){
string t = s;
t.erase(t.begin()+i, t.begin()+j);
if(t == "keyence")ch = true;
}
}
if(ch)cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
string T ="keyence";
for(int i = 0; i <T.size(); i++){//keyofscienceの時i=3で！
if(S.at(i)!=T.at(i)){
for(int j = 0; j<T.size()-i;j++){//0<=j<4
if(S.at(S.size()-j-1)!=T.at(6-j)){
cout << "NO" << endl;
return 0;
}
}
}
}
cout << "YES" << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string k = "keyence";
int n = s.size();
for(int i=0; i<n; i++) {
for(int j=0; j<n-i; j++) {
string t = s;
if(t.erase(i,j) == k) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool flag=false;
for(int i=0;i<7;i++) {
string temp=s.substr(0,i)+s.substr(s.size()-7+i,7-i);
if(temp=="keyence") {
flag=true;
}
}
if(flag) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
} |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
cin >> s;
int n = s.size();
string t = "keyence";
int i = 0;
for(; i < 7; i++) if(s[i] != t[i]) break;
int j = 0;
for(; j < 7; j++) if(s[n - 1 - j] != t[6 - j]) break;
if(i + j >= 7) cout << "YES" << endl;
else cout << "NO" << endl;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string s, t="keyence";
cin>>s;
for(int i=0; i<8; i++){
if(s.substr(0,i)+s.substr(s.length()-(7-i))==t){
cout<<"YES"<<endl;
return 0;
}
}
cout<<"NO"<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;cin>>s;
for(int i=0;i<s.size();i++){
for(int j=i;j<s.size();j++){
string t=s;
t.erase(t.begin()+i,t.begin()+j);
if(t=="keyence"){
cout<<"YES"<<endl;
return 0;
}
}
}
cout<<"NO"<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
for(int i=0;i<s.size();i++){
for(int j=0;j<s.size();j++){
string tmp=s;
tmp.erase(i,j);
if(tmp=="keyence"){
cout<<"YES"<<endl;
return 0;
}
}
}
cout<<"NO"<<endl;
}
|
//Problem B
#include<bits/stdc++.h>
using namespace std;
const int N=500005;
int n,d;
char str[N],a[10]={'k','e','y','e','n','c','e'};
int main(){
scanf("%s",str);
n=strlen(str);
for(int i=0;i<8;i++){
int f=1;
for(int j=0;j<i;j++)if(str[ j]!=a[j])f=0;
for(int j=i;j<7;j++)if(str[n-7+j]!=a[j])f=0;
if(f){printf("YES");return 0;}
}printf("NO");
return 0;
} |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main(){
string s,t="keyence";
cin>>s;
for(int i=0;i<=7;i++){
string a=t.substr(0,i),b=t.substr(i,7-i);
if(a==s.substr(0,i)&&b==s.substr(s.length()-(7-i),7-i)){
cout<<"YES"<<endl;
return 0;
}
}
cout<<"NO"<<endl;
}
|
#include<iostream>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
int main() {
string s, ans = "NO", str;
cin >> s;
rep(i, s.size()) {
rep(j, s.size() - i) {
str = s; str.erase(i, j);
if (str == "keyence") ans = "YES";
}
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
string s;
int main()
{
cin>>s;
for(int i=0;i<s.size();i++)
{
for(int j=0;j<s.size();j++)
{
string t=s;
t.erase(i,j);
if(t=="keyence")
{
cout<<"YES";
return 0;
}
}
}
cout<<"NO";
} |
#include <bits/stdc++.h>
using namespace std;
string s,w="keyence";
int main(){
cin>>s;
string a,b;
for(int i=0;i<w.size();i++){
a=s.substr(0,i+1);
b=s.substr(s.size()-(7-i-1));
if(a+b==w){
cout<<"YES";
return 0;
}
}
cout<<"NO";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
string s; cin>>s;
int n=s.length();
rep(i,8) if(s.substr(0,i)+s.substr(i+n-7)=="keyence") return puts("YES"),0;
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
string t="keyence";
string u="ecneyek";
int l=s.size();
int a=0,b=0;
for(int i=0;i<l;i++){
if(s[i]==t[i]) a++;
else break;
}
for(int i=0;i<l;i++){
if(s[l-1-i]==u[i]) b++;
else break;
}
if(a+b>=7) cout << "YES" << endl;
else cout <<"NO" <<endl;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
string s;cin>>s;
regex re("(.*keyence|k.*eyence|ke.*yence|key.*ence|keye.*nce|keyence|keyen.*ce|keyenc.*e|keyence.*)");
smatch match;
if( regex_match(s, match, re) ) cout<<"YES";
else cout<<"NO";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
getline(cin,s);
string t=s;
for(int i=0;i<t.size();i++)
{
for(int j=0;j<t.size();j++)
{
t.erase(i,j);
if(t.compare("keyence")==0){
cout<<"YES\n";
return 0;
}
t=s;
}
}
cout<<"NO\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string K = "keyence";
string S; cin >> S;
int i,j;
for(i=0; i<S.size(); ++i) {
if(S[i] != K[i]) break;
}
for(j=S.size()-(K.size()-i); j<S.size(); ++j, ++i) {
if(S[j] != K[i]) break;
}
printf("%s\n", i==K.size()?"YES":"NO");
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size(),flag=0;
for(int i=0;i<n;i++){
for(int j=0;i+j-1<n;j++){
string t = s;
t.erase(i,j);
if(t=="keyence") flag = 1;
}
}
if(flag) cout << "YES" << endl;
else cout << "NO" << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string S;
string K="keyence";
cin>>S;
for(int i=0;i<7;i++)
if(S.substr(0,i)==K.substr(0,i)&&S.substr(S.length()-7+i)==K.substr(i))
{
puts("YES");
return 0;
}
puts("NO");
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s; cin>>s;
int n=s.size();
for(int i=0; i<n; ++i) {
for(int j=0; j<n; ++j) {
string t=s;
t.erase(j, i);
if (t=="keyence") { cout<<"YES"<<endl; return 0; }
}
}
cout<<"NO"<<endl;
} |
#include <iostream>
#include <cstdio>
using namespace std;
string s, t="keyence";
int cnt;
int main() {
int i, j, k;
cin >> s;
for(i=0; s[i] && s[i]==t[i]; i++) cnt++;
for(j=s.size()-1, k=6; j>i && s[j]==t[k]; j--, k--) cnt++;
puts(cnt==7 ? "YES" : "NO");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool res = false;
for(int i=0; i<S.size(); i++){
for(int j=0; j<S.size()-i; j++){
string s(S);
s.erase(i,j);
if(s=="keyence"){ res=true; break; }
}
}
if(res){ cout << "YES" << endl; }
else{ cout << "NO" << endl; }
}
|
#include<bits/stdc++.h>
using namespace std;
char r[105];
int main(){
cin>>r;
int n=strlen(r);
for(int i=0;i<=n;i++)
for(int j=i;j<=n;j++){
string S="";
for(int k=0;k<i;k++)
S+=r[k];
for(int k=j;k<n;k++)
S+=r[k];
if(S.size()==7&&S=="keyence"){
cout<<"YES";
return 0;
}
}
cout<<"NO";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
string t="keyence";
int i=0;
while(s[i++]==t[0]&&!t.empty())t=t.substr(1);
i=s.size()-1;
while(s[i--]==t[t.size()-1]&&!t.empty())t=t.substr(0,t.size()-1);
if(!t.size())
cout<<"YES";
else
cout<<"NO";
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
string S;
cin >> S;
string T;
for( int i = 0; i < S.size(); i++ ){
for( int j = 0; j < S.size(); j++ ){
T = S;
T.erase(i, j);
if ( T == "keyence" ){
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, t, key = "keyence";
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
for (int j = 1; j < n; j++) {
if (s.substr(0, i) + s.substr(j) == key) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n;
string s,S,T;
int main()
{
cin>>s;
if (s=="keyence")
{
puts("YES");
return 0;
}
n=s.length();
for (int i=0; i<n; ++i)
for (int j=i+1; j<n; ++j)
{
S=""; T="";
for (int k=0; k<=i; ++k) S+=s[k];
for (int k=j; k<n; ++k) T+=s[k];
if (S+T=="keyence")
{
puts("YES");
return 0;
}
}
puts("NO");
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,K;
int i,l,e;
cin >> S;
l = S.size();
K = "keyence";
i = 0;
while(S.at(i) == K.at(i)) {
i++;
if(i == 7) break;
}
while(i < 7) {
if(S.at(l - 7 + i) == K.at(i)) {
i++;
}
else {
break;
}
}
if(i == 7) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main(){
string S;
cin >> S;
int N = S.size();
string ans = "NO";
for(int i = 0; i <= 7; i++){
string a = S.substr(0, i);
string b = S.substr(N-7+i, 7-i);
if(a + b == "keyence"){
ans = "YES";
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s, leftstr, rightstr;
int main(){
cin >> s;
int n = s.size();
for(int i=0; i<7; i++){
leftstr = s.substr(0, i);
rightstr = s.substr(i+n-7);
if(leftstr + rightstr == "keyence"){
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
} |
#include <iostream>
using namespace std;
string ans = "keyence";
int main(){
string s;
cin >> s;
for(int i=0;i<s.size();i++){
for(int j=i;j<s.size();j++){
string str = "";
for(int k=0;k<i;k++){
str += s[k];
}
for(int k=j;k<s.size();k++){
str += s[k];
}
if(str == ans){
cout << "YES";
return 0;
}
}
}
cout << "NO";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S; cin >> S;
for (int i = 0; i < S.size(); i++) {
for (int j = i; j < S.size(); j++) {
string str = S.substr(0, i) + S.substr(j);
if (str == "keyence") {
cout << "YES" << endl;
return 0;
}
}
}
cout << "NO" << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string t = "keyence";
int n = s.size() - t.size();
if( n<0 ){
cout << "NO";
return 0;
}
for( int i =0;i+n<s.size();i++){
string w = s;
w.erase(i,n);
if( w==t){
cout <<"YES";
return 0;
}
}
cout << "NO";
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string S;cin>>S;string ans="NO";
for(int f=0;f<S.size();f++)for(int m=0;m<S.size();m++)
{
if(f+m>S.size())continue;
int l=S.size()-f-m;
string check;
for(int i=0;i<f;i++)check+=S[i];
for(int i=f+m;i<S.size();i++)check+=S[i];
if(check=="keyence")ans="YES";
}
cout<<ans<<endl;
} |
#include<cstdio>
#include<cstring>
char a[105],b[]="keyence";
int main()
{
scanf("%s",a);
int lena=strlen(a);
int i=0,j=lena-1,tot=0;
while(a[i]==b[i] && i<7)
{
i++;tot++;
}
j=lena-1;
while(a[j]==b[j-lena+7] && j>=lena-7)
{
j--;tot++;
}
if(tot>=7)
printf("YES");
else
printf("NO");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, k = "keyence";
cin >> S;
int N = S.size(), n = k.size();
for (int i = 0; i <= k.size(); i++) {
if (S.substr(0, i) + S.substr(N - n + i, n - i) == k) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void){
string s;
int n;
cin>>s;
n=s.length();
for(int i=0;i<8;i++){
string t=s.substr(0,i)+s.substr(n-7+i,7-i);
//cout<<t<<endl;
if(t=="keyence"){
cout<<"YES"<<endl;
return 0;
}
}
cout<<"NO"<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
string S, T="keyence", a, b;
int main(){
cin >> S;
for(int i = 0; i <= 7; i++){
a = T.substr(0, i);
b = T.substr(i, 7-i);
if(a == S.substr(0, i) && b == S.substr(S.size()-(7-i), 7-i)){
cout << "YES"<< endl;
return 0;
}
}
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string ans = "NO";
for (int i = 0; i <= S.size(); i++) {
for (int j = 0; j <= S.size() - i; j++) {
string T = S;
T.erase(T.begin() + j, T.begin() + j + i);
if (T == "keyence") ans = "YES";
}
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;
cin>>n;
for(int i=0,a;i<n;i++){
cin>>a;ans+=a-1;
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,sum=0;
cin>>n;
int f[n];
for(int i=0;i<n;i++) {cin>>f[i];sum+=f[i]-1;}
cout<<sum;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,j=0;
cin>>N;
for(int i=0;i<N;i++){
int a;
cin>>a;
j+=a-1;
}
cout<<j<<endl;
} |
#include <iostream>
using namespace std;
int main(){
int n;cin>>n;
int sm = 0;
for(int i = 0; n > i; i++){
int tmp;cin>>tmp;
sm += tmp-1;
}
cout << sm << endl;
} |
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int n,x,ans=0;
cin>>n;
while(n--){
cin>>x;
ans+=x-1;
}
cout<<ans;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int ans=0,a;
for(int i=1;i<=n;i++)
scanf("%d",&a),ans+=a-1;
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n,a,ans;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a;
ans+=a-1;
}
cout<<ans;
return 0;
} |
#include<iostream>
using namespace std;
int s,a;
int main()
{
for(cin>>a;cin>>a;)s+=a-1;
cout<<s<<endl;
} |
#include<stdio.h>
int main()
{
int n,ans=0,i,x;
scanf("%d", &n);
for(i=0;i<n;i++) {
scanf("%d", &x);
ans+=x-1;
}
printf("%d\n", ans);
}
|
#include<iostream>
using namespace std;
int main(){
int n,sum=0;
cin>>n;
for(int i=0;i<n;i++){
int x;
cin>>x;
sum+=x-1;
}
cout<<sum;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
int n,x,i,sum=0;
cin>>n;
for(i=0;i<n;i++){
cin>>x;
sum+=x;
}
sum-=n;
cout<<sum;
} |
#include<iostream>
using namespace std;
int main(){
int sum=0;
int a;
cin>>a;
while(cin>>a){
sum += a-1;
}
cout<<sum;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,sum=0,temp;
cin>> n;
for(int i=0;i<n;i++)
{
cin>> temp;
sum+=(temp-1);
}
cout << sum << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n, ans, x;
int main() {
cin >> n;
for(int i = 1; i <= n; ++i) {
cin >> x;
ans += x - 1;
}
cout << ans;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
vector<int> a(N);
for(int i=0;i<N;i++)cin>>a.at(i);
cout<<accumulate(a.begin(),a.end(),0)-N<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ans=0;
for(int i=0;i<n;i++){
int a;
cin>>a;
ans+=(a-1);
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,cnt=0;
cin >> n;
for(int i=0;i<n;i++){
int a;
cin >> a;
cnt += a-1;
}
cout << cnt << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,ans,a;
cin>>N;
for(int i=0;i<N;++i){
cin>>a;
ans+=a-1;
}
cout << ans;
}
|
#include <cstdio>
int main()
{
int n,x;
scanf("%d",&n);
int ans=-n;
for(int i=1; i<=n; i++)
{
scanf("%d",&x);
ans+=x;
}
printf("%d",ans);
return 0;
} |
#include<cstdio>
int main()
{
int n;
scanf("%d",&n);
int ans=0,x;
for (int i=1;i<=n;++i)
{
scanf("%d",&x);
ans+=x-1;
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ans=0;
int N;
cin>>N;
for(int i=0;i<N;i++){
int a;
cin>>a;
ans += a-1;
}
cout<<ans<<endl;
}
|
#include<stdio.h>
int main(void)
{
int n,a[3000],i,s=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
s+=a[i];
}
printf("%d\n",s-n);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,ans;
cin >> N;
for(int i = 0; i < N; i++){
int x;
cin >> x;
ans += x-1;
}
cout << ans;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,t;
long s=0;
cin >> n;
for(int i=0;i<n;i++){cin>>t;s+=t-1;}
cout << s << endl;
return 0;
}
|
#include<cstdio>
int main()
{
int n,ans=0;scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int x;scanf("%d",&x);
ans+=x-1;
}
printf("%d\n",ans);
return 0;
} |
#include<iostream>
using namespace std;
int main(void)
{
int n,take=0,m;
cin >> n;
for(int i=0;i<n;i++)
{
cin >> m;
take+=(m-1);
}
cout << take << endl;
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n;cin >> n;
long long ans=0;
for(int i=0;i<n;i++){
int a;cin>> a;
ans += a-1;
}
cout << ans <<endl;
} |
#include<iostream>
using namespace std;
int main() {
int n; cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
int p; cin >> p;
sum += p;
}
cout << sum - n << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll ans = 0,n;
cin>>n;
while(n--){ll c;cin>>c;ans+=c-1;}
cout<<ans;
return 0;
} |
#include<iostream>
using namespace std;
int n,a,r,i;
int main(){
cin>>n;
for(;i<n;++i){cin>>a;r+=(a-1);}
cout<<r;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int sum=-n;
while(n--)
{
int a;
cin>>a;
sum+=a;
}
cout<<sum<<endl;
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int n;int a;int ans=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a;
ans+=a-1;
}
cout<<ans<<endl;
} |
#include<cstdio>
int n,x,ans;
int main()
{
scanf("%d",&n);
for (int i=1; i<=n; i++)
{
scanf("%d",&x);
ans+=x-1;
}
printf("%d\n",ans);
} |
#include<stdio.h>
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{int a[1000]={0},sum=0,m;
for(int i=0;i<n;i++)
{ scanf("%d",&m);
sum+=m;
}
printf("%d\n",sum-n);
}
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n ,a;
int sum = 0;
cin>>n;
for(int i =0; i<n; i++) {
cin>>a;
sum+=a;
}
cout<<sum-n;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n,temp,ans=0;
cin >>n;
for(int i=0;i<n;i++){
cin >>temp;
ans+=temp-1;
}
cout<<ans<<endl;
return 0;
} |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n, ans=0;
cin >> n;
for(int i=1, x;i<=n;i++) {
cin >> x;
ans+=x-1;
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int sum=0;
cin >> N;
for(int i=0;i<N;i++){
int a;
cin >> a;
sum+=a;
}
cout << sum-N;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a,sum=0;
scanf("%d",&n);
int n1=n;
while(n--)
{
scanf("%d",&a);
sum+=a;
}
printf("%d\n",sum-n1);
} |
#include<iostream>
using namespace std;
int main(){
int N; cin>>N;
int res=0;
for(int i=0;i<N;i++){
int a; cin>>a;
res+=a-1;
}
cout<<res<<endl;
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int n,i,sum=0,x;
cin>>n;
for(i=1;i<=n;i++){
cin>>x;
sum+=x;
}
cout<<sum-n;
return 0;
} |
#include<iostream>
int main(){int N,A,a=0;std::cin>>N;while(N--){std::cin>>A;a+=A-1;}std::cout<<a<<std::endl;} |
#include<iostream>
int n;
using namespace std;
int main(){
cin >> n;
int a, sum;
for(int i=0; i<n; i++){
cin >> a;
sum += a;
}
cout << sum - n << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,ans=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>m;
ans+=m;
}
cout<<ans-n;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,b,ans=0;
cin >> n;
for(int i=0;i<n;i++){
cin >> b;
ans+=b-1;
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main ()
{int ans =0 ; int x; cin>>x; while (x--){int a; cin>>a; ans+=a; ans--;} cout<<ans<<endl; } |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >>N;
int c;
int sum=0;
for(int i=0;i<N;i++){
cin>>c;
sum+=c;
}
cout<<sum-N<<endl;
} |
#include<bits/stdc++.h>
int n, ans, tmp, i;
int main(){
scanf("%d", &n);
for(;i<n;i++){
scanf("%d", &tmp);
ans += tmp-1;
}
printf("%d\n", ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int r=0,n,x;
cin >> n;
for(int i=0; i<n; i++){
cin >> x;
r+=x-1;
}
cout << r << endl;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.