提出 #66121647
ソースコード 拡げる
#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 ff first
#define ss second
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long ull;
// typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
/*---------------------------------------------------------------------------------------------------------------------------*/
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<":"; _print(x); cerr << endl;
#else
#define debug(x)
#endif
void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T> void read(vector <T> &v) {for (T &i : v) {cin >> i;}}
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
/*---------------------------------------------------------------------------------------------------------------------------*/
/*
*/
void solve(){
string s;
cin >> s;
int n = s.size();
vector<int> vec(n);
int curr = 0;
int sum = 0;
for(int i = n-1 ; i >= 0 ; i--){
vec[i] = (s[i] - '0');
int tum = curr%10;
vec[i] -= tum;
if(vec[i] < 0){
vec[i] = 10 - abs(vec[i]);
}
curr += vec[i];
}
curr += n;
cout << curr << endl;
}
int main()
{
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll testcase = 1;
// cin >> testcase;
for(ll cases = 1 ; cases <= testcase ; cases++){
// cout << "Case #" << cases << ": ";
solve();
}
}
提出情報
| 提出日時 |
|
| 問題 |
C - Security 2 |
| ユーザ |
ansh_it_is |
| 言語 |
C++ 20 (gcc 12.2) |
| 得点 |
300 |
| コード長 |
2902 Byte |
| 結果 |
AC |
| 実行時間 |
4 ms |
| メモリ |
5772 KiB |
コンパイルエラー
Main.cpp: In function ‘void solve()’:
Main.cpp:61:9: warning: unused variable ‘sum’ [-Wunused-variable]
61 | int sum = 0;
| ^~~
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
300 / 300 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt |
| All |
00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 00-sample-01.txt |
AC |
1 ms |
3420 KiB |
| 00-sample-02.txt |
AC |
1 ms |
3504 KiB |
| 00-sample-03.txt |
AC |
1 ms |
3496 KiB |
| 01-01.txt |
AC |
1 ms |
3420 KiB |
| 01-02.txt |
AC |
1 ms |
3484 KiB |
| 01-03.txt |
AC |
1 ms |
3492 KiB |
| 01-04.txt |
AC |
1 ms |
3488 KiB |
| 01-05.txt |
AC |
1 ms |
3424 KiB |
| 01-06.txt |
AC |
1 ms |
3488 KiB |
| 01-07.txt |
AC |
1 ms |
3624 KiB |
| 01-08.txt |
AC |
1 ms |
3488 KiB |
| 01-09.txt |
AC |
1 ms |
3452 KiB |
| 01-10.txt |
AC |
1 ms |
3624 KiB |
| 01-11.txt |
AC |
4 ms |
5704 KiB |
| 01-12.txt |
AC |
4 ms |
5712 KiB |
| 01-13.txt |
AC |
4 ms |
5772 KiB |
| 01-14.txt |
AC |
4 ms |
5740 KiB |