Submission #36793894
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
//useful
#define rep(i,n) for(int i = 0; i < (n); i++)
int long long gcd(int long long a, int long long b){
return b?gcd(b,a%b):a;
} //最大公約数
int long long lcm(int long long a, int long long b){
return a/gcd(a,b)*b;
} //最小公倍数
int long long GetDigit(int long long num){
int long long digit=0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
} //桁数
int long long GetDigitN(int long long num, int long long N){
int long long digit=0;
while(num!=0){
num /= N;
digit++;
}
return digit;
} //十進数でnumの際のN進数における桁数
int long long GetDigitSum(int long long n){
if(n < 10){
return n;
}
return GetDigitSum(n/10) + n%10;
} //十進数の桁和
unsigned int long long unsignedGetDigitSum(unsigned int long long n){
if(n < 10){
return n;
}
return unsignedGetDigitSum(n/10) + n%10;
} //十進数の桁和unsigned
int long long divisorcount(int long long n){
int long long ans = 1;
vector<int> x(n + 1);
int long long num = n; // 素因数分解する変数num
for (int long long i = 0; i <= n; i++) {
while (num%i == 0) { // 素数で割り切れなくなるまで割っていく
x.at(i)++; //割った個数を配列に足す
num /= i;
}
}
for (int i = 2; i <= n; i++){
ans *= x.at(i) + 1; //それぞれを+1して掛けていく
}
return ans;
} //約数カウント
int long long ncr(int long long n, int long long r){
int long long num = 1;
for(int i = 1; i <= r; i++){
num = num * (n - i + 1) / i;
}
return num;
} //nCrの組み合わせ
int long long factorial(int long long n){
int long long ans = 1;
for(int i = 1; i <= n; i++){
ans = ans * i;
}
return ans;
} //階乗
int main(){
string S;
cin >> S;
int ans = 0;
for(int i = 0; i < S.size(); i++){
if(S.at(i) == 'v'){
ans++;
}
else{
ans = ans + 2;
}
}
cout << ans << endl;
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | A - wwwvvvvvv |
| User | Osumi_Akari |
| Language | C++ (GCC 9.2.1) |
| Score | 100 |
| Code Size | 2225 Byte |
| Status | AC |
| Exec Time | 8 ms |
| Memory | 3528 KiB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:73:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
73 | for(int i = 0; i < S.size(); i++){
| ~~^~~~~~~~~~
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 100 / 100 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 02_max_00.txt, 02_max_01.txt, 02_max_02.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 8 ms | 3380 KiB |
| 00_sample_01.txt | AC | 2 ms | 3380 KiB |
| 00_sample_02.txt | AC | 2 ms | 3484 KiB |
| 01_random_00.txt | AC | 2 ms | 3516 KiB |
| 01_random_01.txt | AC | 3 ms | 3436 KiB |
| 01_random_02.txt | AC | 2 ms | 3528 KiB |
| 01_random_03.txt | AC | 2 ms | 3492 KiB |
| 02_max_00.txt | AC | 2 ms | 3432 KiB |
| 02_max_01.txt | AC | 3 ms | 3464 KiB |
| 02_max_02.txt | AC | 2 ms | 3512 KiB |