Problem 0148 : Candy and Class Flag #include <iostream> #include <iomanip> using namespace std; int main(void) { int n; while( cin >> n ){ cout << "3C"; cout.width(2); cout.fill('0'); if( n%39 ) cout << n%39 << endl; else cout << 39 << endl; } return 0; } Pr</iomanip></iostream>…

Problem 0181 : Persistence パソコン甲子園2008予選 問題09 こだわり #include <iostream> #include <vector> #include <limits.h> using namespace std; int m, n; vector<int> bw; vector< vector<int> > bsw; int calc() { int new_val; int i, j, k; for( i=1; i<=n; i++ ) bsw[1][i] = bw[i];</int></int></limits.h></vector></iostream>…