Submission #7252491


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#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 FORR(i, m, n) for(int i = m;i >= n;i--)
#define INF 1<<30
#define LINF 1LL<<62
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
const int MOD = 1000000007;
 
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  string s,t;cin >> s>> t;
  ll ans = 0;
  rep(i,3){
      if(s[i]==t[i])ans++;
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task A - Tenki
User mathda1
Language C++14 (GCC 5.4.1)
Score 100
Code Size 643 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All Sample
Score / Max Score 100 / 100 0 / 0
Status
AC × 14
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_0, testcase_1, testcase_10, testcase_2, testcase_3, testcase_4, testcase_5, testcase_6, testcase_7, testcase_8, testcase_9
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
testcase_0 AC 1 ms 256 KB
testcase_1 AC 1 ms 256 KB
testcase_10 AC 1 ms 256 KB
testcase_2 AC 1 ms 256 KB
testcase_3 AC 1 ms 256 KB
testcase_4 AC 1 ms 256 KB
testcase_5 AC 1 ms 256 KB
testcase_6 AC 1 ms 256 KB
testcase_7 AC 1 ms 256 KB
testcase_8 AC 1 ms 256 KB
testcase_9 AC 1 ms 256 KB