- CppStudy_2002_2/STL과제/성적처리 . . . . 52 matches
class ScoresTable
vector<int> _Scores;
int _TotalScore;
double _AverageScore;
ScoresTable(const string& aStudentName) : _StudentName(aStudentName)
_TotalScore = 0;
_AverageScore = 0.0;
void addScoreToVector(int aScore)
_Scores.push_back(aScore);
void calculateTotalScore()
for(unsigned int i = 0 ; i < _Scores.size() ; ++i)
_TotalScore += _Scores[i];
void calculateAverageScore()
_AverageScore = (double)_TotalScore / 4.0;
int getnthScore(int n) const
return _Scores[n];
int getTotalScore() const
return _TotalScore;
double getAverageScore() const
return _AverageScore;
- CPPStudy_2005_1/STL성적처리_1_class . . . . 25 matches
vector<int> getSubjectScore() {return m_subjects;};
void addSubjectScore(int score);
void Student::addSubjectScore(int score)
m_subjects.push_back(score);
== ScoreProcess.h ==
#ifndef GUARD_ScoreProject
#define GUARD_ScoreProject
class ScoreProcess {
ScoreProcess(ifstream &fin,vector<Student> &students);
istream& readScores(istream &in);
ostream& displayScores(ostream &out);
== ScoreProcess.cpp ==
#include "ScoreProcess.h"
ScoreProcess::ScoreProcess(ifstream &fin,vector<Student> &students) : m_fin(fin),m_students(students)
istream& ScoreProcess::readScores(istream &in)
int scoreTemp;
it!=subject.end() && m_fin>>scoreTemp;++it)
student->addSubjectScore(scoreTemp);
ostream& ScoreProcess::displayScores(ostream &out)
vector<int>scores = it->getSubjectScore();
- 강희경/메모장 . . . . 16 matches
#define NUMBER_OF_SCORES 5
struct ScoreData{
int score;
void InputScores(struct ArratData* aArrayData, struct ScoreData* aArray);
void PrintArray(struct ArratData* aArrayData, struct ScoreData* aArray);
void RankScores(struct ScoreData* aArray);
void PrintRanks(struct ScoreData* aArray);
struct ScoreData scoreArray[NUMBER_OF_SCORES];
InputScores(&arrayData, scoreArray);
PrintArray(&arrayData, scoreArray);
RankScores(scoreArray);
PrintRanks(scoreArray);
void InputScores(struct ArratData* aArrayData, struct ScoreData* aArray){
/*Enter a number for score[0] : 80
Enter a number for score[1] : 50
Enter a number for score[2] : 99
Enter a number for score[3] : 74
Enter a number for score[4] : 88
while(count < NUMBER_OF_SCORES){
printf("\nEnter a number for score[%d] : ", count);
- C 스터디_2005여름/학점계산프로그램/김태훈김상섭 . . . . 13 matches
class Score
Score() {};
Score(string n, vector<double> s)
setscore(s);
void setscore(vector<double> s)
score = s;
for(vector<double>::iterator i=score.begin();i !=score.end();++i)
vector<double> getscore() { return score;}
vector<double> score;
void getdata(vector<Score>& ban,const char* filename);
double changescore(string score);
bool zcompare(Score& a,Score& b);
vector<Score> ban;
for(vector<Score>::iterator i=ban.begin();i!=ban.begin()+ban.size()/10;++i)
void getdata(vector<Score>& ban,const char* filename){
Score temp;
vector<double> scoretmp;
scoretmp.push_back(changescore(tmp));
temp = Score(name,scoretmp);
scoretmp.clear();
- CPPStudy_2005_1/STL성적처리_1 . . . . 8 matches
ostream& displayScores(ostream &out, const vector<Student_info> &students);
istream& readScores(istream &in, ifstream &fin, vector<Student_info> &students);
ifstream fin("score.txt");
readScores(cin,fin,students);
displayScores(cout,students);
vector<double> averageScore;
transform(students.begin(),students.end(),back_inserter(averageScore),average);
ostream& displayScores(ostream &out, const vector<Student_info> &students)
istream& readScores(istream &in, ifstream &fin, vector<Student_info> &students)
int scoreTemp;
it!=subject.end() && fin>>scoreTemp;++it)
student.subjects.push_back(scoreTemp);
http://zeropage.org/~namsangboy/score.GIF
- ContestScoreBoard/신재동 . . . . 7 matches
=== ContestScoreBoard/신재동 ===
int totalScore;
teams[i].totalScore = 0;
teams[teamNumber].totalScore += solveTime;
teams[teamNumber].totalScore += 20;
cout << teamNumber << " " << teams[i].totalSolveProblem << " " << teams[i].totalScore << endl;
[ContestScoreBoard]
- ProjectPrometheus/AT_RecommendationPrototype . . . . 7 matches
def getRecommendationBookListLimitScore(self, aScore):
if self.bookRelation[book] >= aScore:
def testRecommendationBookListLimitScore(self):
limitedBookList = self.book1.getRecommendationBookListLimitScore(15)
def testRecommendationBookListLimitScoreMore(self):
limitedBookList = self.book1.getRecommendationBookListLimitScore(15)
- 비행기게임/BasisSource . . . . 7 matches
class Score:
self.score = 0
def plusScore(self,arg):
self.score += 10
self.score += 20
self.printScore()
def printScore(self):
print self.score
score = Score()
score.plusScore(1)
score.plusScore(2)
- ContestScoreBoard . . . . 6 matches
=== About [ContestScoreBoard] ===
|| [문보창] || C++ || 90min || [ContestScoreBoard/문보창] ||
|| [신재동] || C++ || 45min || [ContestScoreBoard/신재동] ||
|| 차영권 || C++ || 100min|| [ContestScoreBoard/차영권] ||
|| [조현태] || C || . || [ContestScoreBoard/조현태] ||
|| [허아영] || C++ || 몰라요? || [ContestScoreBoard/허아영] ||
- JTDStudy/첫번째과제/상욱 . . . . 5 matches
// show score
JOptionPane.showMessageDialog(null, checkScore());
} while(checkScore() != "You are correct!");
public String checkScore() {
public void testCheckScore() {
assertEquals("1 Strike, 2 Ball", object.checkScore());
- MobileJavaStudy/SnakeBite/Spec2Source . . . . 4 matches
private boolean printScore;
printScore = false;
if(printScore) {
printScore = false;
- MobileJavaStudy/SnakeBite/Spec3Source . . . . 4 matches
private boolean printScore;
printScore = false;
if(printScore) {
printScore = false;
- 데블스캠프2012/넷째날/묻지마Csharp/서민관 . . . . 4 matches
int currentScore = 0;
currentScore++;
label3.Text = "Score : " + currentScore;
- 프로그래밍/Score . . . . 4 matches
[http://acm.kaist.ac.kr/Problems/2005a.pdf Score 문제 보기]
public class Score {
Score s = new Score();
- MobileJavaStudy/SnakeBite/FinalSource . . . . 3 matches
private int score;
score = 0;
score += 10;
if(score % 3 == 0) {
paintScore(g);
public void paintScore(Graphics g) {
g.drawString("Score: "+score, boardX, 2, Graphics.TOP|Graphics.LEFT);
- 데블스캠프2006/월요일 . . . . 3 matches
||am 04:00~06:00 ||[데블스캠프2006/CPPFileInput] [http://zerowiki.dnip.net/~namsangboy/schoolScore.html 데블스캠프2006/성적관리프로그램] [http://zeropage.org/svn/namsangboy/SchoolScore/SchoolScore.cpp Source]|| 남상협 (01) ||
- 벡터/황재선 . . . . 3 matches
int score;
bool compareWithScore(student a, student b);
stu[0].score = 1;
stu[1].score = 10;
stu[2].score = 6;
stu[3].score = 4;
stu[4].score = 5;
cout << (*i).name << "\t" << (*i).score << endl;
sort(ss.begin(), ss.end(), compareWithScore);
cout << (*i).name << "\t" << (*i).score << endl;
bool compareWithScore(student a, student b)
return a.score < b.score;
- ContestScoreBoard/문보창 . . . . 2 matches
// no10258 - Contest Score Board
[ContestScoreBoard] [AOI]
- ProjectPrometheus/Iteration2 . . . . 2 matches
|| {{{~cpp RecommendationBookListLimitScore}}}|| 특정 가중치 점수 이하대의 책 리스트는 보여주지 않기 테스트. || ○ ||
|| {{{~cpp RecommendationBookListLimitScoreMore}}} || 특정 가중치 점수 이하대의 책 리스트는 보여주지 않기 테스트. More || ○ ||
- 덜덜덜/숙제제출페이지 . . . . 2 matches
struct score{
score student[5];
위에 이름까지 같이 함께 묶어서 넣고 싶으면 .. 이름은 타입이 다르기때문에 구조체라는것을 써서 같이 묶어서 넣을수 있습니다. 구조체는 나중에 배울겁니다. ^^ 그리고 주석을 사용안하고 변수명으로 의미를 알수 있게 해줄수 있다면 그게 더 좋습니다. 변수명이 조금 길어지더라도 주석 없어도 이해가도록 짜면 좋습니다.(리펙토링에 나오는 얘기..) 예를 들면 국어 성적 변수명은 KoreaScore 혹은 ScoreOfKorea 이런식으로 쓸수 있습니다. - [상협]
- 벡터/임민수 . . . . 2 matches
int score;
student(string aName, int aScore) // 생성자 ?? !!
score = aScore;
bool comp_score(student a, student b);
sort(vector1.begin(), vector1.end(), comp_score);
cout << vector1[i].score << endl ;
bool comp_score(student a, student b)
return a.score < b.score;
- AOI . . . . 1 match
|| [ContestScoreBoard] ||O ||. ||. ||. || O ||. ||. ||O ||
- ContestScoreBoard/조현태 . . . . 1 match
int score;
++temp_point->score;
temp_point->score=0;
printf("%d\t%d\t%d\n",temp_point->team_number,temp_point->score,temp_point->used_time);
[AOI] [ContestScoreBoard]
- ContestScoreBoard/차영권 . . . . 1 match
[ContestScoreBoard] [AOI]
- ContestScoreBoard/허아영 . . . . 1 match
[ContestScoreBoard]
- Debugging . . . . 1 match
[http://zeropage.org/~namsangboy/Score.zip Debugging/Seminar2005자료소스]
- Score/1002 . . . . 1 match
See Also [프로그래밍/Score]
- 프로그래밍 . . . . 1 match
* 2005.11.18 [프로그래밍/Score]
Found 28 matching pages out of 7555 total pages (5000 pages are searched)
You can also click here to search title.
