Submission #3228625
Source Code Expand
#include <iostream> #include <vector> #include <numeric>//accumulate(v.begin(), v.end(), 0); #include <algorithm>//sort(v.begin(),v.end()); #include <string>// #include <cmath> #include <iomanip> //setprecision(2) using namespace std; #define ll long long #define rep(i, n) for(int i = 0; i < (int)(n); i++) int main(){ string s; int N; cin >> s; N=s.size(); ll ans = 0; //2^(N-1)のbit全探索 rep(i,1 << (N - 1)) { //初期化 ll sum = 0; //文字列を整数型に変換 ll a = s[0] - '0'; //文字列を探索 rep(j,N-1) { //bitが立っていたら+を挿入したと考える if (i & (1 << j)) { sum += a; a = 0; } //bitが立っていなかったら次の文字に行く準備 a = a * 10 + s[j + 1] - '0'; } //探索の結果をansに加算して次のループへ sum += a; ans += sum; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Many Formulas |
User | ajifurai |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1297 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||
---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||
Status | AC |
|
Set Name | Test Cases |
---|---|
Sample | |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, sample_01.txt, sample_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |